oj.uz

Submission #477935

# Submission time Handle Problem Language Result Execution time Memory
477935 2021-10-04T16:32:34 Z BackNoob Bank (IZhO14_bank) C++14
100 / 100
 126 ms 8620 KB 
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define endl '\n'
#define mask(i) (1LL << (i))
#define task "name"
#define ull unsigned long long
using namespace std;
const ll mxN = 220797 + 7;
const ll inf = 1e9 + 277;
const ll mod = 2147483648;
const ll infll = 1e18 + 7;
const ll base = 307;
 
template <typename T1, typename T2> bool minimize(T1 &a, T2 b) {
	if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b) {
	if (a < b) {a = b; return true;} return false;
}
 
int a[mxN] , b[mxN] , c[mxN];
int dp1[(1 << 20) + 7];
int dp2[(1 << 20) + 7];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    //freopen("task.inp" , "r" , stdin);
    //freopen("task.out" , "w" , stdout);
    
    int n , m;
    cin >> n >> m;
    for(int i = 1 ; i <= n ; i++) cin >> a[i];
    for(int i = 1 ; i <= m ; i++) cin >> b[i];

    memset(dp1 , -1 , sizeof(dp1));
	dp1[0] = 0;
	dp2[0] = 1;
	for(int mask = 0 ; mask < (1 << m) ; mask++) {
		for(int last = 0 ; last < m ; last++) {
			if(!(mask & (1 << last))) continue;

			int pre = mask & ~(1 << last);
			if(dp1[pre] == -1) continue;

			int cur = dp2[pre];
			if(dp1[pre] + b[last + 1] < a[cur]) {
				dp1[mask] = dp1[pre] + b[last + 1];
				dp2[mask] = dp2[pre];
			}
			if(dp1[pre] + b[last + 1] == a[cur]) {
				dp1[mask] = 0;
				dp2[mask] = cur + 1;
				if(cur + 1 > n) {
					cout << "YES";
					return 0;
				}
			} 
		}
	}
	cout << "NO" << endl;
    return 0;
}

Subtask #1
19.0 / 19.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 72 ms 4456 KB Output is correct
6 Correct 2 ms 4428 KB Output is correct
7 Correct 3 ms 4428 KB Output is correct
8 Correct 3 ms 4428 KB Output is correct
9 Correct 84 ms 8468 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 4376 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 4428 KB Output is correct
9 Correct 3 ms 4428 KB Output is correct
10 Correct 2 ms 4428 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 4428 KB Output is correct
3 Correct 3 ms 4428 KB Output is correct
4 Correct 3 ms 4428 KB Output is correct
5 Correct 3 ms 4428 KB Output is correct
6 Correct 3 ms 4428 KB Output is correct
7 Correct 4 ms 4428 KB Output is correct
8 Correct 3 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 3 ms 4428 KB Output is correct

Subtask #4
29.0 / 29.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 72 ms 4456 KB Output is correct
6 Correct 2 ms 4428 KB Output is correct
7 Correct 3 ms 4428 KB Output is correct
8 Correct 3 ms 4428 KB Output is correct
9 Correct 84 ms 8468 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 4376 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 4428 KB Output is correct
18 Correct 3 ms 4428 KB Output is correct
19 Correct 2 ms 4428 KB Output is correct
20 Correct 3 ms 4428 KB Output is correct
21 Correct 3 ms 4428 KB Output is correct
22 Correct 3 ms 4428 KB Output is correct
23 Correct 3 ms 4428 KB Output is correct
24 Correct 3 ms 4428 KB Output is correct
25 Correct 3 ms 4428 KB Output is correct
26 Correct 4 ms 4428 KB Output is correct
27 Correct 3 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 3 ms 4428 KB Output is correct
31 Correct 101 ms 8516 KB Output is correct
32 Correct 106 ms 8484 KB Output is correct
33 Correct 89 ms 8452 KB Output is correct
34 Correct 71 ms 5424 KB Output is correct
35 Correct 73 ms 5528 KB Output is correct
36 Correct 71 ms 4576 KB Output is correct
37 Correct 71 ms 4684 KB Output is correct
38 Correct 76 ms 4436 KB Output is correct
39 Correct 3 ms 4428 KB Output is correct
40 Correct 72 ms 4476 KB Output is correct
41 Correct 70 ms 4548 KB Output is correct
42 Correct 126 ms 8424 KB Output is correct
43 Correct 76 ms 6780 KB Output is correct
44 Correct 75 ms 4468 KB Output is correct
45 Correct 3 ms 4428 KB Output is correct
46 Correct 100 ms 8452 KB Output is correct
47 Correct 71 ms 4664 KB Output is correct
48 Correct 2 ms 4428 KB Output is correct
49 Correct 79 ms 4508 KB Output is correct
50 Correct 102 ms 8516 KB Output is correct
51 Correct 72 ms 4740 KB Output is correct
52 Correct 82 ms 8620 KB Output is correct
53 Correct 116 ms 8404 KB Output is correct
54 Correct 95 ms 8416 KB Output is correct
55 Correct 94 ms 8472 KB Output is correct
56 Correct 83 ms 8520 KB Output is correct
57 Correct 85 ms 8436 KB Output is correct
58 Correct 80 ms 8476 KB Output is correct