oj.uz

Submission #593191

# Submission time Handle Problem Language Result Execution time Memory
593191 2022-07-10T14:40:55 Z Do_you_copy Bank (IZhO14_bank) C++17
100 / 100
 31 ms 8536 KB 
#include <bits/stdc++.h>
#define taskname "test"
#define fi first
#define se second
#define pb push_back
#define faster ios_base::sync_with_stdio(0); cin.tie(0);
using namespace std;
using ll = long long;
using pii = pair <int, int>;
using pil = pair <int, ll>;
using pli = pair <ll, int>;
using pll = pair <ll, ll>;
using ull = unsigned ll;
mt19937 Rand(chrono::steady_clock::now().time_since_epoch().count());

ll min(const ll &a, const ll &b){
    return (a < b) ? a : b;
}

ll max(const ll &a, const ll &b){
    return (a > b) ? a : b;
}

//const ll Mod = 1000000009;
//const ll Mod2 = 999999999989;
//only use when required
const int maxN = 1e5 + 1;

int n, m;
pii dp[1 << 20];
int a[21], b[21];

void Init(){

    cin >> n >> m;
    for (int i = 0; i < n; ++i) cin >> a[i];
    for (int i = 0; i < m; ++i) cin >> b[i];
    for (int i = 0; i < 1 << m; ++i){
        dp[i] = {0, a[0]};
    }
    for (int i = 0; i < 1 << m; ++i){
        int mask = i;
        bool flag = 0;
        while (mask){
            int j = mask & -mask;
            if (dp[i ^ j].se != -1){
                if (dp[i ^ j].se >= b[__lg(j)]){
                    dp[i].se = dp[i ^ j].se - b[__lg(j)];
                    dp[i].fi = dp[i ^ j].fi;
                    if (!dp[i].se){
                        ++dp[i].fi;
                        if (dp[i].fi == n){
                            //bitset <5> foo(i);
                            //cerr << foo << " ";
                            cout << "YES\n"; return;
                        }
                        dp[i].se = a[dp[i].fi];
                    }
                    flag = 1;
                    break;
                }
            }
            mask ^= j;
        }
        if (!flag && i) dp[i].se = -1;
        //bitset<5> foo(i);
        //cerr << foo  << " " << dp[i].fi << " " << dp[i].se << "\n";
    }
    cout << "NO\n";
}


int main(){
    if (fopen(taskname".inp", "r")){
        freopen(taskname".inp", "r", stdin);
        //freopen(taskname".out", "w", stdout);
    }
    faster;
    ll tt = 1;
    //cin >> tt;
    while (tt--){
        Init();
    }
}

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:75:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   75 |         freopen(taskname".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 22 ms 8404 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 4 ms 8528 KB Output is correct
9 Correct 8 ms 8532 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 328 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 452 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 464 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 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 0 ms 328 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 22 ms 8404 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 4 ms 8528 KB Output is correct
9 Correct 8 ms 8532 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 292 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 328 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 460 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 452 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 464 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 14 ms 8536 KB Output is correct
32 Correct 10 ms 8532 KB Output is correct
33 Correct 26 ms 8524 KB Output is correct
34 Correct 22 ms 8532 KB Output is correct
35 Correct 21 ms 8524 KB Output is correct
36 Correct 22 ms 8536 KB Output is correct
37 Correct 22 ms 8404 KB Output is correct
38 Correct 22 ms 8524 KB Output is correct
39 Correct 4 ms 8528 KB Output is correct
40 Correct 21 ms 8416 KB Output is correct
41 Correct 22 ms 8520 KB Output is correct
42 Correct 29 ms 8404 KB Output is correct
43 Correct 24 ms 8520 KB Output is correct
44 Correct 21 ms 8532 KB Output is correct
45 Correct 4 ms 8532 KB Output is correct
46 Correct 31 ms 8532 KB Output is correct
47 Correct 21 ms 8404 KB Output is correct
48 Correct 4 ms 8528 KB Output is correct
49 Correct 21 ms 8404 KB Output is correct
50 Correct 14 ms 8524 KB Output is correct
51 Correct 22 ms 8404 KB Output is correct
52 Correct 23 ms 8520 KB Output is correct
53 Correct 12 ms 8404 KB Output is correct
54 Correct 14 ms 8532 KB Output is correct
55 Correct 14 ms 8500 KB Output is correct
56 Correct 11 ms 8528 KB Output is correct
57 Correct 12 ms 8404 KB Output is correct
58 Correct 12 ms 8532 KB Output is correct