Submission #643955

# Submission time Handle Problem Language Result Execution time Memory
643955 2022-09-23T09:51:24 Z Nafeeszx Bank (IZhO14_bank) C++14
100 / 100
81 ms 8540 KB
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define trav(a, x) for(auto& a : x)
#define FOR(i, a, b) for (int i=(a); i<=(signed)(b); i++)
#define ROF(i, a, b) for (int i=(a); i>=(signed)(b); i--)
#define F0R(i, a) for (int i=0; i<(signed)(a); i++)
#define vi vector<int>
typedef long long ll;

const int MAXN = 2e5;
const int mod = 1e9 + 7, MOD = 998244353;



int main()
{	
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n, m; cin >> n >> m;
    vector<int> a(n), b(m);
    F0R(i, n) cin >> a[i]; F0R(i, m) cin >> b[i];
    vector<pair<int, int>> dp(1 << m, {-1, 0});
    dp[0] = {0, 0};
    F0R(i, 1 << m) {
        if(dp[i].first == n) {
            cout << "YES\n";
            exit(0);
        }
        if(dp[i].first == -1) continue;
    
        F0R(j, m) if(((1 << j) & i) == 0) {
            int k = dp[i].first;
            int l = dp[i].second;
            if(l + b[j] < a[k]) {
                dp[(1 << j) | i].second = l + b[j];
                dp[(1 << j) | i].first = k;
            } else if(l + b[j] == a[k]) {
                dp[(1 << j) | i].first = k+1;
                dp[(1 << j) | i].second = 0;
            }
        }
    }
    cout << "NO\n";
    return 0;
}



# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 5 ms 8532 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 5 ms 8532 KB Output is correct
9 Correct 59 ms 8508 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 448 KB Output is correct
7 Correct 1 ms 452 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 5 ms 8532 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 5 ms 8532 KB Output is correct
9 Correct 59 ms 8508 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 324 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 448 KB Output is correct
26 Correct 1 ms 452 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 66 ms 8532 KB Output is correct
32 Correct 74 ms 8532 KB Output is correct
33 Correct 12 ms 8540 KB Output is correct
34 Correct 5 ms 8516 KB Output is correct
35 Correct 5 ms 8532 KB Output is correct
36 Correct 4 ms 8532 KB Output is correct
37 Correct 4 ms 8520 KB Output is correct
38 Correct 5 ms 8532 KB Output is correct
39 Correct 4 ms 8532 KB Output is correct
40 Correct 5 ms 8472 KB Output is correct
41 Correct 5 ms 8532 KB Output is correct
42 Correct 50 ms 8532 KB Output is correct
43 Correct 9 ms 8532 KB Output is correct
44 Correct 5 ms 8532 KB Output is correct
45 Correct 4 ms 8532 KB Output is correct
46 Correct 22 ms 8532 KB Output is correct
47 Correct 5 ms 8504 KB Output is correct
48 Correct 4 ms 8532 KB Output is correct
49 Correct 5 ms 8532 KB Output is correct
50 Correct 68 ms 8532 KB Output is correct
51 Correct 7 ms 8532 KB Output is correct
52 Correct 9 ms 8532 KB Output is correct
53 Correct 81 ms 8532 KB Output is correct
54 Correct 73 ms 8532 KB Output is correct
55 Correct 78 ms 8532 KB Output is correct
56 Correct 77 ms 8532 KB Output is correct
57 Correct 75 ms 8532 KB Output is correct
58 Correct 72 ms 8532 KB Output is correct