oj.uz

Submission #485189

# Submission time Handle Problem Language Result Execution time Memory
485189 2021-11-06T13:44:23 Z XII Bank (IZhO14_bank) C++17
100 / 100
 109 ms 8516 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

#define fi first
#define se second
#define mp make_pair
#define eb emplace_back
#define ALL(x) (x).begin(), (x).end()

#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define FORU(i, a, b) for(int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)

#define IOS cin.tie(0)->sync_with_stdio(false);
#define PROB "IZhO14_bank"
void Fi(){
    if(fopen(PROB".inp", "r")){
        freopen(PROB".inp", "r", stdin);
        freopen(PROB".out", "w", stdout);
    }
}

const int N = 20;
int n, m;
int a[N + 1], b[N];

int dp[1 << N], lef[1 << N];

int main(){
    IOS;
    Fi();
    cin >> n >> m;
    FORU(i, 1, n) cin >> a[i];
    FOR(i, 0, m) cin >> b[i];

    memset(dp, -1, sizeof(dp));
    dp[0] = lef[0] = 0;
    FOR(mask, 1, 1 << m){
        FOR(j, 0, m) if(mask & (1 << j)){
            if(dp[mask ^ (1 << j)] == -1) continue;
            int newi = dp[mask ^ (1 << j)] + 1;
            int have = lef[mask ^ (1 << j)] + b[j];
            if(have < a[newi]){
                dp[mask] = newi - 1;
                lef[mask] = have;
            } else if(have == a[newi]){
                dp[mask] = newi;
                lef[mask] = 0;
            }
        }
        if(dp[mask] == n){
            cout << "YES";
            return 0;
        }
    }
    cout << "NO";
    return 0;
}

Compilation message

bank.cpp: In function 'void Fi()':
bank.cpp:20:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |         freopen(PROB".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
bank.cpp:21:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |         freopen(PROB".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4300 KB Output is correct
2 Correct 2 ms 4300 KB Output is correct
3 Correct 2 ms 4428 KB Output is correct
4 Correct 2 ms 4300 KB Output is correct
5 Correct 62 ms 4436 KB Output is correct
6 Correct 2 ms 4300 KB Output is correct
7 Correct 2 ms 4300 KB Output is correct
8 Correct 2 ms 4428 KB Output is correct
9 Correct 69 ms 8384 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4428 KB Output is correct
2 Correct 3 ms 4480 KB Output is correct
3 Correct 4 ms 4428 KB Output is correct
4 Correct 3 ms 4312 KB Output is correct
5 Correct 3 ms 4428 KB Output is correct
6 Correct 3 ms 4428 KB Output is correct
7 Correct 3 ms 4428 KB Output is correct
8 Correct 2 ms 4428 KB Output is correct
9 Correct 3 ms 4428 KB Output is correct
10 Correct 3 ms 4428 KB Output is correct
11 Correct 2 ms 4428 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4300 KB Output is correct
2 Correct 2 ms 4300 KB Output is correct
3 Correct 2 ms 4428 KB Output is correct
4 Correct 2 ms 4300 KB Output is correct
5 Correct 62 ms 4436 KB Output is correct
6 Correct 2 ms 4300 KB Output is correct
7 Correct 2 ms 4300 KB Output is correct
8 Correct 2 ms 4428 KB Output is correct
9 Correct 69 ms 8384 KB Output is correct
10 Correct 2 ms 4428 KB Output is correct
11 Correct 2 ms 4428 KB Output is correct
12 Correct 2 ms 4428 KB Output is correct
13 Correct 2 ms 4428 KB Output is correct
14 Correct 2 ms 4428 KB Output is correct
15 Correct 2 ms 4428 KB Output is correct
16 Correct 2 ms 4428 KB Output is correct
17 Correct 2 ms 4300 KB Output is correct
18 Correct 2 ms 4428 KB Output is correct
19 Correct 2 ms 4300 KB Output is correct
20 Correct 3 ms 4428 KB Output is correct
21 Correct 3 ms 4480 KB Output is correct
22 Correct 4 ms 4428 KB Output is correct
23 Correct 3 ms 4312 KB Output is correct
24 Correct 3 ms 4428 KB Output is correct
25 Correct 3 ms 4428 KB Output is correct
26 Correct 3 ms 4428 KB Output is correct
27 Correct 2 ms 4428 KB Output is correct
28 Correct 3 ms 4428 KB Output is correct
29 Correct 3 ms 4428 KB Output is correct
30 Correct 2 ms 4428 KB Output is correct
31 Correct 83 ms 8432 KB Output is correct
32 Correct 91 ms 8456 KB Output is correct
33 Correct 80 ms 8384 KB Output is correct
34 Correct 67 ms 5444 KB Output is correct
35 Correct 63 ms 5468 KB Output is correct
36 Correct 63 ms 4568 KB Output is correct
37 Correct 68 ms 4748 KB Output is correct
38 Correct 62 ms 4420 KB Output is correct
39 Correct 2 ms 4300 KB Output is correct
40 Correct 62 ms 4452 KB Output is correct
41 Correct 62 ms 4512 KB Output is correct
42 Correct 109 ms 8504 KB Output is correct
43 Correct 65 ms 6764 KB Output is correct
44 Correct 66 ms 4440 KB Output is correct
45 Correct 3 ms 4416 KB Output is correct
46 Correct 92 ms 8436 KB Output is correct
47 Correct 62 ms 4632 KB Output is correct
48 Correct 2 ms 4428 KB Output is correct
49 Correct 61 ms 4488 KB Output is correct
50 Correct 86 ms 8388 KB Output is correct
51 Correct 63 ms 4756 KB Output is correct
52 Correct 68 ms 8464 KB Output is correct
53 Correct 95 ms 8516 KB Output is correct
54 Correct 96 ms 8388 KB Output is correct
55 Correct 88 ms 8436 KB Output is correct
56 Correct 90 ms 8512 KB Output is correct
57 Correct 92 ms 8516 KB Output is correct
58 Correct 85 ms 8464 KB Output is correct