oj.uz

Submission #627189

# Submission time Handle Problem Language Result Execution time Memory
627189 2022-08-12T11:01:01 Z madtuber Bank (IZhO14_bank) C++14
100 / 100
 139 ms 8540 KB 
#include <bits/stdc++.h>
#define all(x) begin(x),end(x)
#define fir first
#define sec second
#define sz(x) x.size()
#define pb push_back
 
using namespace std;
using ll = long long;
using vi = vector<int>;
using pi = pair<int,int>;
using pdb = pair<double,double>;
using pll = pair<ll,ll>;
using vll = vector<ll>;
const double EPS = (1e-7);
 
void setio(string s){
    freopen((s + ".in").c_str(),"r",stdin);
    freopen((s + ".out").c_str(),"w",stdout);
}

void solve(){
    int n, m;
    cin >> n >> m;

    vi a(n);
    vi b(m);
    for(auto& i : a) cin >> i;
    for(auto& i : b) cin >> i;

    vector<pi> dp(1 << m);

    bool ok = 0;
    for(int i{}; i < (1 << m); i++){
        for(int j{}; j < m; j++){
            if (i & (1 << j)){
                if (dp[i ^ (1<<j)].sec + b[j] == a[dp[i^(1<<j)].fir]){
                    dp[i] = max(dp[i], {dp[i^(1<<j)].fir+1, 0});
                }else if (dp[i ^ (1<<j)].sec + b[j] < a[dp[i^(1<<j)].fir]){
                    dp[i] = max(dp[i], {dp[i^(1<<j)].fir, dp[i^(1<<j)].sec + b[j]});
                }
                ok |= dp[i].fir == n;
            }
        }
    }
    
    cout << (ok ? "YES" : "NO");
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    while(t--){
        solve();
    }
    return 0;
}

Compilation message

bank.cpp: In function 'void setio(std::string)':
bank.cpp:18:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |     freopen((s + ".in").c_str(),"r",stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bank.cpp:19:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |     freopen((s + ".out").c_str(),"w",stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 87 ms 8532 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 89 ms 8532 KB Output is correct
9 Correct 76 ms 8532 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 320 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 2 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 3 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 468 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 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 87 ms 8532 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 89 ms 8532 KB Output is correct
9 Correct 76 ms 8532 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 316 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 320 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 320 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 3 ms 340 KB Output is correct
27 Correct 2 ms 340 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 95 ms 8504 KB Output is correct
32 Correct 102 ms 8532 KB Output is correct
33 Correct 123 ms 8532 KB Output is correct
34 Correct 112 ms 8532 KB Output is correct
35 Correct 112 ms 8532 KB Output is correct
36 Correct 86 ms 8532 KB Output is correct
37 Correct 106 ms 8532 KB Output is correct
38 Correct 75 ms 8532 KB Output is correct
39 Correct 70 ms 8532 KB Output is correct
40 Correct 101 ms 8532 KB Output is correct
41 Correct 90 ms 8508 KB Output is correct
42 Correct 127 ms 8532 KB Output is correct
43 Correct 111 ms 8516 KB Output is correct
44 Correct 93 ms 8512 KB Output is correct
45 Correct 139 ms 8532 KB Output is correct
46 Correct 127 ms 8416 KB Output is correct
47 Correct 87 ms 8532 KB Output is correct
48 Correct 92 ms 8516 KB Output is correct
49 Correct 79 ms 8532 KB Output is correct
50 Correct 74 ms 8512 KB Output is correct
51 Correct 97 ms 8532 KB Output is correct
52 Correct 81 ms 8540 KB Output is correct
53 Correct 97 ms 8532 KB Output is correct
54 Correct 88 ms 8492 KB Output is correct
55 Correct 80 ms 8532 KB Output is correct
56 Correct 65 ms 8512 KB Output is correct
57 Correct 62 ms 8532 KB Output is correct
58 Correct 63 ms 8532 KB Output is correct