oj.uz

Submission #37598

# Submission time Handle Problem Language Result Execution time Memory
37598 2017-12-26T09:29:54 Z alenam0161 Bank (IZhO14_bank) C++14
100 / 100
 226 ms 14776 KB 
#include <bits/stdc++.h>

using namespace std;
#define ad push_back
const int N = 20;
int n,m;
bool used[N][1<<N];
vector<int> comb[N];
int a[N],b[N];
void rek(int x,int clc){
   if(x==n){
    cout<<"YES";exit(0);
   }
   if(used[x][clc]==true)return;
   used[x][clc]=true;
   for(int to:comb[x]){
    if(clc&to)continue;
    rek(x+1,clc|to);
   }
}
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);
   for(int i=0;i<(1<<m);++i){
    int csum=0;
    for(int j=0;j<20;++j)if(i&(1<<j))csum+=b[j];
    for(int j=0;j<n;++j)if(csum==a[j]){
        comb[j].ad(i);
    }
   }
   rek(0,0);
   cout<<"NO"<<endl;
   return 0;
}

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:22:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d%d",&n,&m);
    ~~~~~^~~~~~~~~~~~~~
bank.cpp:23:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    for(int i=0;i<n;++i)scanf("%d",a+i);
                        ~~~~~^~~~~~~~~~
bank.cpp:24:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    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 2 ms 376 KB Output is correct
2 Correct 2 ms 480 KB Output is correct
3 Correct 2 ms 480 KB Output is correct
4 Correct 4 ms 544 KB Output is correct
5 Correct 66 ms 592 KB Output is correct
6 Correct 2 ms 592 KB Output is correct
7 Correct 2 ms 592 KB Output is correct
8 Correct 66 ms 808 KB Output is correct
9 Correct 66 ms 808 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 480 KB Output is correct
3 Correct 2 ms 480 KB Output is correct
4 Correct 4 ms 544 KB Output is correct
5 Correct 66 ms 592 KB Output is correct
6 Correct 2 ms 592 KB Output is correct
7 Correct 2 ms 592 KB Output is correct
8 Correct 66 ms 808 KB Output is correct
9 Correct 66 ms 808 KB Output is correct
10 Correct 2 ms 808 KB Output is correct
11 Correct 2 ms 808 KB Output is correct
12 Correct 2 ms 808 KB Output is correct
13 Correct 2 ms 808 KB Output is correct
14 Correct 2 ms 808 KB Output is correct
15 Correct 2 ms 808 KB Output is correct
16 Correct 2 ms 808 KB Output is correct
17 Correct 2 ms 808 KB Output is correct
18 Correct 2 ms 808 KB Output is correct
19 Correct 2 ms 808 KB Output is correct
20 Correct 3 ms 808 KB Output is correct
21 Correct 3 ms 808 KB Output is correct
22 Correct 3 ms 808 KB Output is correct
23 Correct 3 ms 808 KB Output is correct
24 Correct 3 ms 808 KB Output is correct
25 Correct 3 ms 808 KB Output is correct
26 Correct 3 ms 808 KB Output is correct
27 Correct 3 ms 808 KB Output is correct
28 Correct 3 ms 808 KB Output is correct
29 Correct 3 ms 808 KB Output is correct
30 Correct 3 ms 808 KB Output is correct
31 Correct 68 ms 808 KB Output is correct
32 Correct 68 ms 808 KB Output is correct
33 Correct 72 ms 808 KB Output is correct
34 Correct 74 ms 808 KB Output is correct
35 Correct 77 ms 808 KB Output is correct
36 Correct 87 ms 808 KB Output is correct
37 Correct 68 ms 808 KB Output is correct
38 Correct 70 ms 808 KB Output is correct
39 Correct 74 ms 808 KB Output is correct
40 Correct 76 ms 808 KB Output is correct
41 Correct 86 ms 808 KB Output is correct
42 Correct 77 ms 3696 KB Output is correct
43 Correct 75 ms 3696 KB Output is correct
44 Correct 81 ms 3696 KB Output is correct
45 Correct 70 ms 3696 KB Output is correct
46 Correct 71 ms 3696 KB Output is correct
47 Correct 81 ms 3696 KB Output is correct
48 Correct 66 ms 3696 KB Output is correct
49 Correct 66 ms 3696 KB Output is correct
50 Correct 86 ms 3696 KB Output is correct
51 Correct 75 ms 3696 KB Output is correct
52 Correct 75 ms 3696 KB Output is correct
53 Correct 76 ms 3696 KB Output is correct
54 Correct 86 ms 3696 KB Output is correct
55 Correct 86 ms 3696 KB Output is correct
56 Correct 87 ms 3696 KB Output is correct
57 Correct 226 ms 14776 KB Output is correct
58 Correct 85 ms 14776 KB Output is correct