oj.uz

Submission #520334

# Submission time Handle Problem Language Result Execution time Memory
520334 2022-01-29T13:32:07 Z krit3379 Bank (IZhO14_bank) C++17
100 / 100
 102 ms 8620 KB 
#include<bits/stdc++.h>
using namespace std;
#define N 20

int a[N],b[N];
pair<int,int> dp[1<<N];

int main(){
    int n,m,i,j,pre;
    scanf("%d %d",&n,&m);
    for(i=0;i<n;i++)scanf("%d",&a[i]);
    for(i=0;i<m;i++)scanf("%d",&b[i]);
    for(i=0;i<(1<<m);i++){
        for(j=0;j<m;j++){
            if((i&(1<<j))==0)continue;
            pre=i^(1<<j);
            auto [last,sum]=dp[pre];
            if(sum+b[j]==a[last]){
                dp[i]=max(dp[i],make_pair(last+1,0));
            }
            else{
                dp[i]=max(dp[i],make_pair(last,sum+b[j]));
            }
        }
    }
    if(dp[(1<<m)-1].first==n)printf("YES");
    else printf("NO");
    return 0;
}

Compilation message

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

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 72 ms 8436 KB Output is correct
6 Correct 0 ms 292 KB Output is correct
7 Correct 0 ms 304 KB Output is correct
8 Correct 88 ms 8420 KB Output is correct
9 Correct 76 ms 8484 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 204 KB Output is correct
3 Correct 0 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 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 2 ms 324 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 2 ms 396 KB Output is correct
6 Correct 1 ms 424 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 1 ms 332 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 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 72 ms 8436 KB Output is correct
6 Correct 0 ms 292 KB Output is correct
7 Correct 0 ms 304 KB Output is correct
8 Correct 88 ms 8420 KB Output is correct
9 Correct 76 ms 8484 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 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 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 2 ms 324 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 2 ms 396 KB Output is correct
25 Correct 1 ms 424 KB Output is correct
26 Correct 2 ms 332 KB Output is correct
27 Correct 2 ms 332 KB Output is correct
28 Correct 2 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 83 ms 8520 KB Output is correct
32 Correct 87 ms 8396 KB Output is correct
33 Correct 88 ms 8440 KB Output is correct
34 Correct 81 ms 8472 KB Output is correct
35 Correct 82 ms 8392 KB Output is correct
36 Correct 76 ms 8516 KB Output is correct
37 Correct 79 ms 8620 KB Output is correct
38 Correct 72 ms 8448 KB Output is correct
39 Correct 79 ms 8440 KB Output is correct
40 Correct 78 ms 8388 KB Output is correct
41 Correct 73 ms 8400 KB Output is correct
42 Correct 101 ms 8388 KB Output is correct
43 Correct 81 ms 8496 KB Output is correct
44 Correct 71 ms 8376 KB Output is correct
45 Correct 102 ms 8428 KB Output is correct
46 Correct 92 ms 8444 KB Output is correct
47 Correct 75 ms 8384 KB Output is correct
48 Correct 91 ms 8400 KB Output is correct
49 Correct 72 ms 8472 KB Output is correct
50 Correct 76 ms 8460 KB Output is correct
51 Correct 79 ms 8388 KB Output is correct
52 Correct 71 ms 8464 KB Output is correct
53 Correct 93 ms 8472 KB Output is correct
54 Correct 95 ms 8488 KB Output is correct
55 Correct 75 ms 8428 KB Output is correct
56 Correct 74 ms 8388 KB Output is correct
57 Correct 76 ms 8452 KB Output is correct
58 Correct 78 ms 8376 KB Output is correct