oj.uz

Submission #330387

# Submission time Handle Problem Language Result Execution time Memory
330387 2020-11-25T04:44:08 Z Vince729 Bank (IZhO14_bank) C++11
71 / 100
 1000 ms 86764 KB 
#include<iostream>
#include<cstdio>
#include<string>
#include<vector>
#include<cstring>
#include<algorithm>
#include<set>
#include<map>
#include<complex>
using namespace std;

typedef long long ll;
typedef complex<double> pt;
#define x() real()
#define y() imag()
#define smx(a, b) a = max(a, b)
#define smn(a, b) a = min(a, b)
#define in(mp, v) mp.find(v) != mp.end()

const int MAXN = 20;
const int MOD = 1000000007;

int n, m, a[MAXN+1], b[MAXN];
int dp[MAXN+1][1<<MAXN];

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int j = 0; j < m; j++) cin >> b[j];
    memset(dp, 0xbf, sizeof(dp));
    dp[0][0] = 0;
    bool found = false, f1 = false;
    for (int i = 1; i <= n; i++) {
        found = false; f1 = false;
        for (int k = 0; k < (1<<m); k++) {
            if (dp[i-1][k] == a[i-1]) {
                dp[i][k] = 0;
                f1 = true;
            } else {
                if (!f1) continue;
                for (int j = 0; j < m; j++) {
                    if (k & (1<<j)) {
                        smx(dp[i][k], dp[i][k ^ (1<<j)] + b[j]);
                    }
                }
            }
            if (dp[i][k] == a[i]) found = true;
            //cout << k << " " << dp[i][k] << endl;
        }
    }
    if (found) {
        cout << "YES" << endl;
    } else cout << "NO" << endl;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 86508 KB Output is correct
2 Correct 40 ms 86508 KB Output is correct
3 Correct 40 ms 86508 KB Output is correct
4 Correct 44 ms 86508 KB Output is correct
5 Correct 112 ms 86508 KB Output is correct
6 Correct 40 ms 86508 KB Output is correct
7 Correct 41 ms 86508 KB Output is correct
8 Correct 110 ms 86508 KB Output is correct
9 Correct 108 ms 86632 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 86508 KB Output is correct
2 Correct 40 ms 86508 KB Output is correct
3 Correct 41 ms 86508 KB Output is correct
4 Correct 42 ms 86508 KB Output is correct
5 Correct 42 ms 86508 KB Output is correct
6 Correct 41 ms 86508 KB Output is correct
7 Correct 41 ms 86508 KB Output is correct
8 Correct 42 ms 86508 KB Output is correct
9 Correct 41 ms 86508 KB Output is correct
10 Correct 41 ms 86508 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 86508 KB Output is correct
2 Correct 44 ms 86508 KB Output is correct
3 Correct 48 ms 86524 KB Output is correct
4 Correct 43 ms 86508 KB Output is correct
5 Correct 44 ms 86508 KB Output is correct
6 Correct 42 ms 86508 KB Output is correct
7 Correct 45 ms 86508 KB Output is correct
8 Correct 44 ms 86508 KB Output is correct
9 Correct 46 ms 86636 KB Output is correct
10 Correct 44 ms 86508 KB Output is correct
11 Correct 43 ms 86508 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 86508 KB Output is correct
2 Correct 40 ms 86508 KB Output is correct
3 Correct 40 ms 86508 KB Output is correct
4 Correct 44 ms 86508 KB Output is correct
5 Correct 112 ms 86508 KB Output is correct
6 Correct 40 ms 86508 KB Output is correct
7 Correct 41 ms 86508 KB Output is correct
8 Correct 110 ms 86508 KB Output is correct
9 Correct 108 ms 86632 KB Output is correct
10 Correct 40 ms 86508 KB Output is correct
11 Correct 40 ms 86508 KB Output is correct
12 Correct 41 ms 86508 KB Output is correct
13 Correct 42 ms 86508 KB Output is correct
14 Correct 42 ms 86508 KB Output is correct
15 Correct 41 ms 86508 KB Output is correct
16 Correct 41 ms 86508 KB Output is correct
17 Correct 42 ms 86508 KB Output is correct
18 Correct 41 ms 86508 KB Output is correct
19 Correct 41 ms 86508 KB Output is correct
20 Correct 44 ms 86508 KB Output is correct
21 Correct 44 ms 86508 KB Output is correct
22 Correct 48 ms 86524 KB Output is correct
23 Correct 43 ms 86508 KB Output is correct
24 Correct 44 ms 86508 KB Output is correct
25 Correct 42 ms 86508 KB Output is correct
26 Correct 45 ms 86508 KB Output is correct
27 Correct 44 ms 86508 KB Output is correct
28 Correct 46 ms 86636 KB Output is correct
29 Correct 44 ms 86508 KB Output is correct
30 Correct 43 ms 86508 KB Output is correct
31 Correct 175 ms 86636 KB Output is correct
32 Correct 243 ms 86508 KB Output is correct
33 Correct 470 ms 86508 KB Output is correct
34 Correct 637 ms 86508 KB Output is correct
35 Correct 475 ms 86508 KB Output is correct
36 Correct 559 ms 86508 KB Output is correct
37 Correct 188 ms 86636 KB Output is correct
38 Correct 113 ms 86628 KB Output is correct
39 Correct 572 ms 86508 KB Output is correct
40 Correct 300 ms 86508 KB Output is correct
41 Correct 191 ms 86508 KB Output is correct
42 Correct 372 ms 86636 KB Output is correct
43 Correct 454 ms 86508 KB Output is correct
44 Correct 127 ms 86636 KB Output is correct
45 Correct 244 ms 86764 KB Output is correct
46 Correct 410 ms 86636 KB Output is correct
47 Correct 698 ms 86636 KB Output is correct
48 Correct 108 ms 86508 KB Output is correct
49 Correct 109 ms 86508 KB Output is correct
50 Execution timed out 1103 ms 86508 KB Time limit exceeded
51 Halted 0 ms 0 KB -