Submission #331553

# Submission time Handle Problem Language Result Execution time Memory
331553 2020-11-28T22:09:34 Z jovan_b Bank (IZhO14_bank) C++17
100 / 100
111 ms 8684 KB
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
 
pair <int, int> dp[2000005];
int a[25];
int b[25];
 
int main(){
    ios_base::sync_with_stdio(false), cin.tie(0);
	cout.precision(10);
	cout << fixed;
 
	int n, m;
	cin >> n >> m;
	for(int i=1; i<=n; i++){
        cin >> a[i];
	}
	for(int j=0; j<m; j++){
        cin >> b[j];
	}
    for(int mask=0; mask<(1<<m); mask++){
        if(dp[mask].first == 0 && dp[mask].second == 0 && mask > 0) continue;
        for(int i=0; i<m; i++){
            if((1<<i)&mask) continue;
            int k = a[dp[mask].first+1] - dp[mask].second;
            if(k < b[i]) continue;
            else if(k == b[i]) dp[mask|(1<<i)] = {dp[mask].first+1, 0};
            else dp[mask|(1<<i)] = {dp[mask].first, dp[mask].second+b[i]};
        }
    }
	for(int i=0; i<(1<<m); i++){
        if(dp[i].first == n){
            cout << "YES\n";
            return 0;
        }
	}
	cout << "NO\n";
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 620 KB Output is correct
5 Correct 4 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 53 ms 8556 KB Output is correct
9 Correct 78 ms 8556 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 620 KB Output is correct
5 Correct 4 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 53 ms 8556 KB Output is correct
9 Correct 78 ms 8556 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 492 KB Output is correct
27 Correct 1 ms 492 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 492 KB Output is correct
31 Correct 76 ms 8556 KB Output is correct
32 Correct 96 ms 8568 KB Output is correct
33 Correct 16 ms 7916 KB Output is correct
34 Correct 4 ms 1664 KB Output is correct
35 Correct 4 ms 1900 KB Output is correct
36 Correct 6 ms 620 KB Output is correct
37 Correct 4 ms 1004 KB Output is correct
38 Correct 3 ms 236 KB Output is correct
39 Correct 27 ms 8300 KB Output is correct
40 Correct 4 ms 492 KB Output is correct
41 Correct 4 ms 620 KB Output is correct
42 Correct 59 ms 8556 KB Output is correct
43 Correct 7 ms 4204 KB Output is correct
44 Correct 4 ms 364 KB Output is correct
45 Correct 50 ms 8556 KB Output is correct
46 Correct 30 ms 8428 KB Output is correct
47 Correct 4 ms 620 KB Output is correct
48 Correct 24 ms 8044 KB Output is correct
49 Correct 4 ms 492 KB Output is correct
50 Correct 87 ms 8556 KB Output is correct
51 Correct 5 ms 876 KB Output is correct
52 Correct 11 ms 8428 KB Output is correct
53 Correct 111 ms 8616 KB Output is correct
54 Correct 99 ms 8684 KB Output is correct
55 Correct 87 ms 8556 KB Output is correct
56 Correct 83 ms 8556 KB Output is correct
57 Correct 83 ms 8556 KB Output is correct
58 Correct 83 ms 8556 KB Output is correct