oj.uz

Submission #879207

# Submission time Handle Problem Language Result Execution time Memory
879207 2023-11-26T21:51:43 Z mahmoudbadawy Bank (IZhO14_bank) C++17
100 / 100
 123 ms 8936 KB 
#include <bits/stdc++.h>

using namespace std;

const int N=21;

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

int main()
{
	scanf("%d %d",&n,&m);
	for(int i=0;i<n;i++) scanf("%d",&a[i]);
	for(int i=0;i<m;i++) scanf("%d",&b[i]);
	int ans=0;
	for(int i=1;i<(1<<m);i++)
	{
		for(int j=0;j<m;j++)
		{
			if((i&(1<<j))==0) continue;
			int prev=i^(1<<j);
			int curs = b[j] + dp[prev].second;
			int need = dp[prev].first;
			if(need>=n) continue;
			if(curs<a[need]) dp[i]=max(dp[i],make_pair(need, curs));
			if(curs==a[need]) dp[i]=max(dp[i], make_pair(need+1, 0));
		}
		ans=max(ans, dp[i].first);
	}
	puts(ans==n?"YES":"NO");
}

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:13:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |  scanf("%d %d",&n,&m);
      |  ~~~~~^~~~~~~~~~~~~~~
bank.cpp:14:28: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |  for(int i=0;i<n;i++) scanf("%d",&a[i]);
      |                       ~~~~~^~~~~~~~~~~~
bank.cpp:15:28: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |  for(int i=0;i<m;i++) scanf("%d",&b[i]);
      |                       ~~~~~^~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 86 ms 8428 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 90 ms 8412 KB Output is correct
9 Correct 83 ms 8528 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 1 ms 392 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 2 ms 548 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 352 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 86 ms 8428 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 90 ms 8412 KB Output is correct
9 Correct 83 ms 8528 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 1 ms 392 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 2 ms 548 KB Output is correct
28 Correct 2 ms 348 KB Output is correct
29 Correct 2 ms 348 KB Output is correct
30 Correct 2 ms 352 KB Output is correct
31 Correct 99 ms 8480 KB Output is correct
32 Correct 98 ms 8532 KB Output is correct
33 Correct 116 ms 8520 KB Output is correct
34 Correct 107 ms 8528 KB Output is correct
35 Correct 108 ms 8428 KB Output is correct
36 Correct 90 ms 8856 KB Output is correct
37 Correct 104 ms 8420 KB Output is correct
38 Correct 76 ms 8528 KB Output is correct
39 Correct 77 ms 8464 KB Output is correct
40 Correct 89 ms 8532 KB Output is correct
41 Correct 83 ms 8528 KB Output is correct
42 Correct 119 ms 8620 KB Output is correct
43 Correct 110 ms 8476 KB Output is correct
44 Correct 85 ms 8528 KB Output is correct
45 Correct 123 ms 8784 KB Output is correct
46 Correct 117 ms 8536 KB Output is correct
47 Correct 90 ms 8528 KB Output is correct
48 Correct 91 ms 8532 KB Output is correct
49 Correct 78 ms 8532 KB Output is correct
50 Correct 79 ms 8532 KB Output is correct
51 Correct 92 ms 8472 KB Output is correct
52 Correct 87 ms 8528 KB Output is correct
53 Correct 96 ms 8532 KB Output is correct
54 Correct 87 ms 8528 KB Output is correct
55 Correct 81 ms 8532 KB Output is correct
56 Correct 85 ms 8532 KB Output is correct
57 Correct 83 ms 8528 KB Output is correct
58 Correct 85 ms 8936 KB Output is correct