题解 | 称砝码

#include <iostream>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <iomanip>
#include <stack>
#include <numeric>
#include <ctime>
#include <string>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#include <bits/stdc++.h>
#define il inline

using namespace std;
using ll = long long;
using ull = unsigned long long;

const ll N = 1e4 + 5, mod = 1e9 + 7, inf = 2e18;

il void solve() {
    int n;
    cin >> n;
    vector<ll>m(n + 5), x(n + 5);
    ll sum = 0;
    for (int i = 1; i <= n; i++)cin >> m[i];
    for (int i = 1; i <= n; i++) {
        cin >> x[i];
        sum += x[i] * m[i];
    }
    vector<int>dp(sum + 5);
    dp[0] = 1;

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= x[i]; j++) {
            for (int k = sum; k >= m[i]; k--) {
                dp[k] |= dp[k - m[i]];
            }
        }
    }
    int ans = 0;
    for (int i = 0; i <= sum; i++) {
        ans += dp[i];
    }
    cout << ans;
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int t = 1;

    //cin >> t;

    while (t--) {

        solve();

    }

    return 0;
}