oj.uz

Submission #521888

# Submission time Handle Problem Language Result Execution time Memory
521888 2022-02-03T11:26:12 Z Kalashnikov Bank (IZhO14_bank) C++17
100 / 100
 105 ms 8624 KB 
#include <bits/stdc++.h>
 
#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define all(a) a.begin() , a.end()
#define F first
#define S second
 
using namespace std;
using ll = long long;
 
const int N = 20+5 , inf = 2e9 + 7;
const ll INF = 1e18 ,   mod = 1e9+7 , P = 6547;

int a[N] , b[N];
int n , m;
pair<int,int> dp[(1 << 21)];

void solve(int tc) {
	cin >> n >> m;
	for(int i = 1; i <= n; i ++) {
		cin >> a[i];
	}
	for(int i = 1; i <= m; i ++) {
		cin >> b[i];
	}
	sort(b+1, b+m+1);
	for(int mask = 1; mask < (1 << m); mask ++) {
		for(int i = 1; i <= m; i ++) {
			if(mask & (1 << i-1)) {
				int p = mask - (1 << i-1);
				if(dp[p].S + b[i] == a[dp[p].F+1]) {
					dp[mask] = max(dp[mask] , {dp[p].F+1 , 0});
				}
				else {
					dp[mask] = max(dp[mask] , {dp[p].F , dp[p].S+b[i]});
				}
			}
		}
	}
	if(dp[(1 << m) - 1].F == n) {
		cout << "YES";
	}
	else
		cout << "NO";
}
/*
*/
main() {
    ios;
    int tt = 1 , tc = 0;
    // cin >> tt;
    while(tt --) {
        solve(++tc);
    }
    return 0;
}

Compilation message

bank.cpp: In function 'void solve(int)':
bank.cpp:30:21: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   30 |    if(mask & (1 << i-1)) {
      |                    ~^~
bank.cpp:31:27: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   31 |     int p = mask - (1 << i-1);
      |                          ~^~
bank.cpp: At global scope:
bank.cpp:49:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   49 | main() {
      | ^~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 73 ms 8504 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 88 ms 8428 KB Output is correct
9 Correct 72 ms 8508 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 316 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 316 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 444 KB Output is correct
2 Correct 2 ms 448 KB Output is correct
3 Correct 1 ms 448 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 2 ms 448 KB Output is correct
6 Correct 1 ms 452 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 448 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 2 ms 408 KB Output is correct
11 Correct 1 ms 332 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 73 ms 8504 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 88 ms 8428 KB Output is correct
9 Correct 72 ms 8508 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 316 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 316 KB Output is correct
20 Correct 2 ms 444 KB Output is correct
21 Correct 2 ms 448 KB Output is correct
22 Correct 1 ms 448 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 2 ms 448 KB Output is correct
25 Correct 1 ms 452 KB Output is correct
26 Correct 2 ms 332 KB Output is correct
27 Correct 2 ms 448 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 2 ms 408 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 82 ms 8424 KB Output is correct
32 Correct 78 ms 8448 KB Output is correct
33 Correct 91 ms 8504 KB Output is correct
34 Correct 78 ms 8388 KB Output is correct
35 Correct 79 ms 8396 KB Output is correct
36 Correct 84 ms 8412 KB Output is correct
37 Correct 81 ms 8388 KB Output is correct
38 Correct 73 ms 8536 KB Output is correct
39 Correct 75 ms 8480 KB Output is correct
40 Correct 80 ms 8492 KB Output is correct
41 Correct 85 ms 8624 KB Output is correct
42 Correct 93 ms 8400 KB Output is correct
43 Correct 90 ms 8460 KB Output is correct
44 Correct 71 ms 8424 KB Output is correct
45 Correct 101 ms 8504 KB Output is correct
46 Correct 105 ms 8600 KB Output is correct
47 Correct 79 ms 8472 KB Output is correct
48 Correct 84 ms 8388 KB Output is correct
49 Correct 72 ms 8504 KB Output is correct
50 Correct 77 ms 8488 KB Output is correct
51 Correct 87 ms 8516 KB Output is correct
52 Correct 88 ms 8408 KB Output is correct
53 Correct 84 ms 8392 KB Output is correct
54 Correct 89 ms 8500 KB Output is correct
55 Correct 76 ms 8396 KB Output is correct
56 Correct 81 ms 8524 KB Output is correct
57 Correct 77 ms 8440 KB Output is correct
58 Correct 80 ms 8388 KB Output is correct