# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
794636 |
2023-07-26T17:22:20 Z |
nguyennehehe |
Bank (IZhO14_bank) |
C++14 |
|
1000 ms |
320 KB |
#include<bits/stdc++.h>
using namespace std;
const int N = 20;
int n, m, a[N], b[N];
int groups[N], v[N];
bool good;
void sub1() {
bool ok = false;
for (int s = 1; s < (1 << m); ++s) {
int sum = 0;
for (int i = 0; i < m; ++i) {
if (s >> i & 1) sum += b[i];
}
ok |= sum == a[0];
}
cout << (ok ? "YES" : "NO");
}
void backtrack(int id) {
if (id == m) {
fill(v, v + n, 0);
for (int i = 0; i < m; ++i) {
v[groups[i]] += b[i];
}
bool ok = true;
for (int i = 0; i < n; ++i) {
ok &= a[i] == v[i];
}
good |= ok;
return;
}
for (int i = 0; i < n; ++i) {
if (good) return;
groups[id] = i;
backtrack(id + 1);
}
}
void sub2() {
good = false;
backtrack(0);
cout << (good ? "YES" : "NO");
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> m;
for (int i = 0; i < n; ++i) cin >> a[i];
for (int i = 0; i < m; ++i) cin >> b[i];
if (n == 1) sub1();
else if (n <= 10 && m <= 10) sub2();
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
2 ms |
316 KB |
Output is correct |
5 |
Correct |
67 ms |
292 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
67 ms |
212 KB |
Output is correct |
9 |
Correct |
68 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
16 ms |
320 KB |
Output is correct |
5 |
Execution timed out |
1083 ms |
212 KB |
Time limit exceeded |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
2 ms |
316 KB |
Output is correct |
5 |
Correct |
67 ms |
292 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
67 ms |
212 KB |
Output is correct |
9 |
Correct |
68 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
11 |
Correct |
0 ms |
212 KB |
Output is correct |
12 |
Correct |
0 ms |
212 KB |
Output is correct |
13 |
Correct |
16 ms |
320 KB |
Output is correct |
14 |
Execution timed out |
1083 ms |
212 KB |
Time limit exceeded |
15 |
Halted |
0 ms |
0 KB |
- |