oj.uz

Submission #17466

# Submission time Handle Problem Language Result Execution time Memory
17466 2015-12-18T10:22:33 Z AZE_XeRoX Bank (IZhO14_bank) C++
19 / 100
 67 ms 636 KB 
#include <iostream>
#include <cmath>
#include <algorithm>
#include <iomanip>

#define MAXN 100001
#define intt long long int


using namespace std; 

intt  x , y , a[MAXN] , b[MAXN] , ans = 0  ;

int main()
{

cin >> x >> y  ;

for ( intt i = 0 ; i < x ; i ++ ) 

cin >> a[i] ;

for ( intt i = 0 ; i < y ; i ++ ) 


cin >> b[i] ;

for(intt i = 0; i < (1<<y); i++)         {
  
    intt c = 0;
  
    for (intt j = 0; j < y; j++)
  
        if (i & (1<<j)) c += b[j];
  
    if (c==a[0]) ans = 1;
             
                                         }
if(ans == 1) cout << "YES"<<endl;

else cout << "NO"<<endl;


return 0 ;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 2 ms 372 KB Output is correct
3 Correct 2 ms 448 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 67 ms 544 KB Output is correct
6 Correct 2 ms 544 KB Output is correct
7 Correct 2 ms 544 KB Output is correct
8 Correct 67 ms 544 KB Output is correct
9 Correct 67 ms 560 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 560 KB Output is correct
2 Correct 2 ms 560 KB Output is correct
3 Correct 2 ms 560 KB Output is correct
4 Incorrect 2 ms 560 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 560 KB Output is correct
2 Correct 3 ms 616 KB Output is correct
3 Correct 2 ms 616 KB Output is correct
4 Correct 2 ms 620 KB Output is correct
5 Incorrect 2 ms 636 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 2 ms 372 KB Output is correct
3 Correct 2 ms 448 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 67 ms 544 KB Output is correct
6 Correct 2 ms 544 KB Output is correct
7 Correct 2 ms 544 KB Output is correct
8 Correct 67 ms 544 KB Output is correct
9 Correct 67 ms 560 KB Output is correct
10 Correct 2 ms 560 KB Output is correct
11 Correct 2 ms 560 KB Output is correct
12 Correct 2 ms 560 KB Output is correct
13 Incorrect 2 ms 560 KB Output isn't correct
14 Halted 0 ms 0 KB -