oj.uz

Submission #554581

# Submission time Handle Problem Language Result Execution time Memory
554581 2022-04-28T19:04:33 Z rafatoa Bank (IZhO14_bank) C++17
100 / 100
 149 ms 16744 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
 
#define int ll
#define double ld
const int inf = 2e9;
const int INF = 4e18;
const int mod = 1e9+7;
const int mx = 200001;
 
#define F first
#define S second
#define vi vector<int>
#define vvi vector<vi>
#define pi pair<int, int>
#define vpi vector<pi>
#define vb vector<bool>
#define pb push_back
#define read(a) for(auto &x:a) cin >> x;
#define print(a) for(auto x:a) cout << x << " "; cout << "\n";
 
#define ppb pop_back

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);

    // #ifndef ONLINE_JUDGE
    //     freopen("in.txt", "r", stdin);
    //     freopen("out.txt", "w", stdout);
    // #endif

    int n, m; cin >> n >> m;
    vi a(n), b(m); read(a); read(b);

    vpi best(1<<m, {0, 0});

    for(int s=1; s<(1<<m); s++){
        for(int t=0; t<m; t++){
            if(!(s&(1<<t))) continue;

            pi option = best[s^(1<<t)];
            if(best[s^(1<<t)].S + b[t] < a[best[s^(1<<t)].F]){
                option.S = best[s^(1<<t)].S + b[t];
            }else if(best[s^(1<<t)].S + b[t] == a[best[s^(1<<t)].F]){
                option.F++;
                option.S = 0;
            }

            best[s] = max(best[s], option);
        }
    }

    for(auto x:best){
        if(x.F == n){
            cout << "YES\n";
            return 0;
        }
    }

    cout << "NO\n";
    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 3 ms 832 KB Output is correct
5 Correct 90 ms 16708 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 104 ms 16724 KB Output is correct
9 Correct 78 ms 16724 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 232 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 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 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

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 468 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 576 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 2 ms 572 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 2 ms 580 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 3 ms 832 KB Output is correct
5 Correct 90 ms 16708 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 104 ms 16724 KB Output is correct
9 Correct 78 ms 16724 KB Output is correct
10 Correct 1 ms 232 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 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 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 3 ms 468 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 2 ms 576 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 2 ms 572 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 2 ms 596 KB Output is correct
30 Correct 2 ms 580 KB Output is correct
31 Correct 104 ms 16704 KB Output is correct
32 Correct 108 ms 16708 KB Output is correct
33 Correct 122 ms 16724 KB Output is correct
34 Correct 93 ms 16736 KB Output is correct
35 Correct 102 ms 16724 KB Output is correct
36 Correct 106 ms 16708 KB Output is correct
37 Correct 98 ms 16724 KB Output is correct
38 Correct 88 ms 16724 KB Output is correct
39 Correct 83 ms 16704 KB Output is correct
40 Correct 98 ms 16700 KB Output is correct
41 Correct 87 ms 16724 KB Output is correct
42 Correct 149 ms 16724 KB Output is correct
43 Correct 105 ms 16704 KB Output is correct
44 Correct 90 ms 16724 KB Output is correct
45 Correct 142 ms 16724 KB Output is correct
46 Correct 134 ms 16704 KB Output is correct
47 Correct 96 ms 16724 KB Output is correct
48 Correct 107 ms 16724 KB Output is correct
49 Correct 85 ms 16724 KB Output is correct
50 Correct 90 ms 16724 KB Output is correct
51 Correct 104 ms 16724 KB Output is correct
52 Correct 95 ms 16724 KB Output is correct
53 Correct 108 ms 16704 KB Output is correct
54 Correct 100 ms 16744 KB Output is correct
55 Correct 90 ms 16724 KB Output is correct
56 Correct 85 ms 16624 KB Output is correct
57 Correct 89 ms 16724 KB Output is correct
58 Correct 90 ms 16656 KB Output is correct