oj.uz

Submission #974190

# Submission time Handle Problem Language Result Execution time Memory
974190 2024-05-03T05:39:59 Z Art_ogo Bank (IZhO14_bank) C++17
100 / 100
 102 ms 8788 KB 
#include <bits/stdc++.h>

#define ll long long
#define fi first
#define se second
#define ve vector
#define all(x) x.begin(), x.end()
#define pb(x) push_back(x)

using namespace std;

mt19937 rnd;

typedef pair<ll, ll> pll;
typedef pair<int, int> pii;

void solve(){
    int n, m;
    cin >> n >> m;
    ve<int> a(n);
    ve<int> b(m);
    for(auto& i : a)
        cin >> i;
    for(auto& j : b)
        cin >> j;
    ve<int> cur(1 << m, -1);
    ve<int> lefts(1 << m, -1);
    cur[0] = lefts[0] = 0;
    for(int i = 1; i < (1 << m); i++){
        for(int j = 0; j < m; j++){
            if(!((i >> j) & 1))
                continue;
            int prev = i ^ (1 << j);
            if(cur[prev] == -1)
                continue;
            int li = lefts[prev] + b[j];
            if(li > a[cur[prev]])
                continue;
            if(li == a[cur[prev]]){
                cur[i] = cur[prev] + 1;
                lefts[i] = 0;
            }
            else{
                cur[i] = cur[prev];
                lefts[i] = li;
            }
            if(cur[i] == n){
                cout << "YES";
                return;
            }
        }
    }
    cout << "NO";
}

signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    int T = 1;
    //    cin >> T;
    while(T--){
        solve();
    }
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 360 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 716 KB Output is correct
5 Correct 73 ms 8664 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 3 ms 8540 KB Output is correct
9 Correct 82 ms 8660 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 360 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 716 KB Output is correct
5 Correct 73 ms 8664 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 3 ms 8540 KB Output is correct
9 Correct 82 ms 8660 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 1 ms 460 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 512 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 96 ms 8540 KB Output is correct
32 Correct 94 ms 8540 KB Output is correct
33 Correct 74 ms 8660 KB Output is correct
34 Correct 68 ms 8540 KB Output is correct
35 Correct 76 ms 8540 KB Output is correct
36 Correct 72 ms 8536 KB Output is correct
37 Correct 71 ms 8660 KB Output is correct
38 Correct 73 ms 8660 KB Output is correct
39 Correct 2 ms 8540 KB Output is correct
40 Correct 69 ms 8540 KB Output is correct
41 Correct 73 ms 8540 KB Output is correct
42 Correct 102 ms 8536 KB Output is correct
43 Correct 71 ms 8664 KB Output is correct
44 Correct 73 ms 8540 KB Output is correct
45 Correct 3 ms 8536 KB Output is correct
46 Correct 83 ms 8668 KB Output is correct
47 Correct 69 ms 8540 KB Output is correct
48 Correct 3 ms 8536 KB Output is correct
49 Correct 72 ms 8664 KB Output is correct
50 Correct 83 ms 8540 KB Output is correct
51 Correct 72 ms 8668 KB Output is correct
52 Correct 71 ms 8540 KB Output is correct
53 Correct 97 ms 8536 KB Output is correct
54 Correct 93 ms 8788 KB Output is correct
55 Correct 81 ms 8660 KB Output is correct
56 Correct 83 ms 8540 KB Output is correct
57 Correct 85 ms 8540 KB Output is correct
58 Correct 83 ms 8736 KB Output is correct