oj.uz

Submission #551867

# Submission time Handle Problem Language Result Execution time Memory
551867 2022-04-21T18:38:57 Z antontsiorvas Bank (IZhO14_bank) C++14
100 / 100
 108 ms 8508 KB 
#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;

const int MAXN = 20, MAXM = 20;

int n, m, sal[MAXN+5], bank[MAXM+5];
pair<int,int> dp[1<<MAXN+5];

int main(){
	scanf("%d%d",&n,&m);
	for(int i=1; i<=n; i++) scanf("%d",&sal[i]);
	for(int i=1; i<=m; i++) scanf("%d",&bank[i]);
	int cs = (1<<m)-1;
	dp[0] = {0,0};
	for(int i=1; i<=cs; i++){
		dp[i] = {-1,-1};
		for(int j=1; j<=m; j++){
			if(!(i&(1<<(j-1)))) continue;
			int prev = i^(1<<(j-1));
			if(dp[prev].s == -1) continue;
			int cur = dp[prev].s + bank[j], wanted = sal[dp[prev].f+1];
			if(cur < wanted) dp[i] = {dp[prev].f, cur};
			else if(cur == wanted) dp[i] = {dp[prev].f+1,0};
		}
	}
	for(int i=1; i<=cs; i++){
		if(dp[i].f == n){
			printf("YES\n");
			return 0;
		}
	}
	printf("NO\n");
}

Compilation message

bank.cpp:9:25: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
    9 | pair<int,int> dp[1<<MAXN+5];
      |                     ~~~~^~
bank.cpp: In function 'int main()':
bank.cpp:12:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |  scanf("%d%d",&n,&m);
      |  ~~~~~^~~~~~~~~~~~~~
bank.cpp:13:31: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |  for(int i=1; i<=n; i++) scanf("%d",&sal[i]);
      |                          ~~~~~^~~~~~~~~~~~~~
bank.cpp:14:31: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |  for(int i=1; i<=m; i++) scanf("%d",&bank[i]);
      |                          ~~~~~^~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 79 ms 8496 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 82 ms 8380 KB Output is correct
9 Correct 85 ms 8476 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 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 1 ms 436 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 436 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 2 ms 436 KB Output is correct
10 Correct 2 ms 432 KB Output is correct
11 Correct 2 ms 432 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 79 ms 8496 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 82 ms 8380 KB Output is correct
9 Correct 85 ms 8476 KB Output is correct
10 Correct 1 ms 308 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 312 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 436 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 436 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 2 ms 340 KB Output is correct
28 Correct 2 ms 436 KB Output is correct
29 Correct 2 ms 432 KB Output is correct
30 Correct 2 ms 432 KB Output is correct
31 Correct 82 ms 8472 KB Output is correct
32 Correct 86 ms 8408 KB Output is correct
33 Correct 75 ms 8412 KB Output is correct
34 Correct 68 ms 8424 KB Output is correct
35 Correct 67 ms 8444 KB Output is correct
36 Correct 65 ms 8468 KB Output is correct
37 Correct 64 ms 8400 KB Output is correct
38 Correct 66 ms 8388 KB Output is correct
39 Correct 71 ms 8396 KB Output is correct
40 Correct 68 ms 8456 KB Output is correct
41 Correct 68 ms 8432 KB Output is correct
42 Correct 108 ms 8480 KB Output is correct
43 Correct 66 ms 8484 KB Output is correct
44 Correct 65 ms 8424 KB Output is correct
45 Correct 105 ms 8452 KB Output is correct
46 Correct 91 ms 8412 KB Output is correct
47 Correct 66 ms 8444 KB Output is correct
48 Correct 76 ms 8392 KB Output is correct
49 Correct 64 ms 8400 KB Output is correct
50 Correct 78 ms 8384 KB Output is correct
51 Correct 68 ms 8416 KB Output is correct
52 Correct 69 ms 8484 KB Output is correct
53 Correct 94 ms 8424 KB Output is correct
54 Correct 88 ms 8428 KB Output is correct
55 Correct 76 ms 8424 KB Output is correct
56 Correct 75 ms 8508 KB Output is correct
57 Correct 73 ms 8380 KB Output is correct
58 Correct 73 ms 8496 KB Output is correct