# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
68457 | 2018-08-17T07:28:28 Z | yusufake | Bank (IZhO14_bank) | C++ | 71 ms | 876 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int N = 2e3 + 3; #define pb push_back vector < int > V[N]; bool H[20][1<<20]; int A[N],B[N],T[N],n,m,i,j,t,ans; void f(int i, int m){ if(ans) return; if(i == n) { ans = 1; return; } if(H[i][m]) return; H[i][m] = 1; int j, x = A[i]; for(j=0;j<V[x].size();j++){ if((V[x][j] & m) == V[x][j]) f(i+1,(m^V[x][j])); } } int main(){ scanf("%d%d",&n,&m); for(i=0;i<n;i++) { scanf("%d",&A[i]); T[ A[i] ] = 1; } for(i=0;i<m;i++) scanf("%d",&B[i]); for(i=1;i<(1<<m);i++){ t = 0; for(j=0;j<m;j++) if(i & (1 << j)) t += B[j]; if(!T[t]) continue; V[t].pb(i); } ans = 0; f(0,(1<<m)-1); puts(ans ? "YES" : "NO"); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 500 KB | Output is correct |
3 | Correct | 2 ms | 568 KB | Output is correct |
4 | Correct | 4 ms | 568 KB | Output is correct |
5 | Correct | 70 ms | 568 KB | Output is correct |
6 | Correct | 2 ms | 568 KB | Output is correct |
7 | Correct | 2 ms | 568 KB | Output is correct |
8 | Correct | 71 ms | 756 KB | Output is correct |
9 | Correct | 71 ms | 764 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 764 KB | Output is correct |
2 | Correct | 2 ms | 764 KB | Output is correct |
3 | Correct | 2 ms | 764 KB | Output is correct |
4 | Correct | 2 ms | 764 KB | Output is correct |
5 | Correct | 2 ms | 764 KB | Output is correct |
6 | Correct | 2 ms | 764 KB | Output is correct |
7 | Correct | 2 ms | 764 KB | Output is correct |
8 | Correct | 2 ms | 764 KB | Output is correct |
9 | Correct | 2 ms | 764 KB | Output is correct |
10 | Correct | 2 ms | 764 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 764 KB | Output is correct |
2 | Correct | 2 ms | 764 KB | Output is correct |
3 | Runtime error | 3 ms | 876 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 500 KB | Output is correct |
3 | Correct | 2 ms | 568 KB | Output is correct |
4 | Correct | 4 ms | 568 KB | Output is correct |
5 | Correct | 70 ms | 568 KB | Output is correct |
6 | Correct | 2 ms | 568 KB | Output is correct |
7 | Correct | 2 ms | 568 KB | Output is correct |
8 | Correct | 71 ms | 756 KB | Output is correct |
9 | Correct | 71 ms | 764 KB | Output is correct |
10 | Correct | 2 ms | 764 KB | Output is correct |
11 | Correct | 2 ms | 764 KB | Output is correct |
12 | Correct | 2 ms | 764 KB | Output is correct |
13 | Correct | 2 ms | 764 KB | Output is correct |
14 | Correct | 2 ms | 764 KB | Output is correct |
15 | Correct | 2 ms | 764 KB | Output is correct |
16 | Correct | 2 ms | 764 KB | Output is correct |
17 | Correct | 2 ms | 764 KB | Output is correct |
18 | Correct | 2 ms | 764 KB | Output is correct |
19 | Correct | 2 ms | 764 KB | Output is correct |
20 | Correct | 3 ms | 764 KB | Output is correct |
21 | Correct | 2 ms | 764 KB | Output is correct |
22 | Runtime error | 3 ms | 876 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
23 | Halted | 0 ms | 0 KB | - |