# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
671748 |
2022-12-13T16:24:17 Z |
smartmonky |
Bank (IZhO14_bank) |
C++14 |
|
53 ms |
2692 KB |
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
using namespace std;
const int N = 1e5;
vector <int> g[N];
int n, vis[25][N];
void rec(int pos, int v){
if(pos == n + 1){
cout <<"YES";
exit(0);
}
vis[pos][v] = 1;
for(auto to : g[pos]){
if((to & v) == v && !vis[pos + 1][(v ^ to)])
rec(pos + 1, (v ^ to));
}
}
main(){
int m;
cin >> n >> m;
vector <int> v(n + 1), a(m + 1);
for(int i = 1; i <= n; i++){
cin >> v[i];
}
for(int i = 1; i <= m; i++){
cin >> a[i];
}
for(int i = 1; i <= (1 << m); i++){
int sum = 0;
for(int j = 1; j <= m; j++)
if(i & (1 << j)){
sum += a[j];
}
for(int j = 1; j <= n; j++){
if(v[j] == sum)g[j].pb(i);
}
}
rec(1, 0);
cout << "NO";
}
Compilation message
bank.cpp:24:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
24 | main(){
| ^~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2644 KB |
Output is correct |
2 |
Correct |
2 ms |
2644 KB |
Output is correct |
3 |
Correct |
2 ms |
2644 KB |
Output is correct |
4 |
Correct |
3 ms |
2644 KB |
Output is correct |
5 |
Correct |
53 ms |
2652 KB |
Output is correct |
6 |
Correct |
3 ms |
2644 KB |
Output is correct |
7 |
Correct |
2 ms |
2660 KB |
Output is correct |
8 |
Correct |
52 ms |
2692 KB |
Output is correct |
9 |
Correct |
53 ms |
2644 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
2660 KB |
Output is correct |
2 |
Incorrect |
2 ms |
2656 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
2644 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2644 KB |
Output is correct |
2 |
Correct |
2 ms |
2644 KB |
Output is correct |
3 |
Correct |
2 ms |
2644 KB |
Output is correct |
4 |
Correct |
3 ms |
2644 KB |
Output is correct |
5 |
Correct |
53 ms |
2652 KB |
Output is correct |
6 |
Correct |
3 ms |
2644 KB |
Output is correct |
7 |
Correct |
2 ms |
2660 KB |
Output is correct |
8 |
Correct |
52 ms |
2692 KB |
Output is correct |
9 |
Correct |
53 ms |
2644 KB |
Output is correct |
10 |
Correct |
2 ms |
2660 KB |
Output is correct |
11 |
Incorrect |
2 ms |
2656 KB |
Output isn't correct |
12 |
Halted |
0 ms |
0 KB |
- |