# |
제출 시각 |
아이디 |
문제 |
언어 |
결과 |
실행 시간 |
메모리 |
978952 |
2024-05-10T04:33:00 Z |
Ska |
은행 (IZhO14_bank) |
C++14 |
|
76 ms |
8792 KB |
#include <bits/stdc++.h>
using namespace std;
const int N = 20;
int n, m;
int a[N], b[N];
pair<int, int> f[1 << N];
void solve() {
for (int mask = 1; mask <= 1 << m; ++mask) {
bool ok = false;
for (int i = 0; i < m; ++i) {
if ((mask >> i & 1) == 0) {
continue;
}
int prev = mask ^ 1 << i;
if (f[prev].first == -1) {
continue;
}
if (f[prev].second + b[i] < a[f[prev].first]) {
f[mask] = {f[prev].first, f[prev].second + b[i]};
ok = true;
break;
} else if (f[prev].second + b[i] == a[f[prev].first]) {
f[mask] = {f[prev].first + 1, 0};
if (f[mask].first == n) {
cout << "YES\n";
return;
}
ok = true;
break;
}
}
if (!ok) {
f[mask].first = -1;
}
}
cout << "NO\n";
}
int 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];
}
solve();
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
70 ms |
8532 KB |
Output is correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
5 ms |
8540 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
344 KB |
Output is correct |
10 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
600 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
2 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
10 |
Correct |
2 ms |
348 KB |
Output is correct |
11 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
70 ms |
8532 KB |
Output is correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
5 ms |
8540 KB |
Output is correct |
10 |
Correct |
0 ms |
348 KB |
Output is correct |
11 |
Correct |
0 ms |
348 KB |
Output is correct |
12 |
Correct |
0 ms |
348 KB |
Output is correct |
13 |
Correct |
0 ms |
348 KB |
Output is correct |
14 |
Correct |
0 ms |
348 KB |
Output is correct |
15 |
Correct |
0 ms |
348 KB |
Output is correct |
16 |
Correct |
0 ms |
348 KB |
Output is correct |
17 |
Correct |
0 ms |
348 KB |
Output is correct |
18 |
Correct |
0 ms |
344 KB |
Output is correct |
19 |
Correct |
0 ms |
348 KB |
Output is correct |
20 |
Correct |
1 ms |
348 KB |
Output is correct |
21 |
Correct |
1 ms |
600 KB |
Output is correct |
22 |
Correct |
1 ms |
348 KB |
Output is correct |
23 |
Correct |
1 ms |
348 KB |
Output is correct |
24 |
Correct |
1 ms |
348 KB |
Output is correct |
25 |
Correct |
1 ms |
348 KB |
Output is correct |
26 |
Correct |
2 ms |
348 KB |
Output is correct |
27 |
Correct |
1 ms |
348 KB |
Output is correct |
28 |
Correct |
1 ms |
348 KB |
Output is correct |
29 |
Correct |
2 ms |
348 KB |
Output is correct |
30 |
Correct |
0 ms |
348 KB |
Output is correct |
31 |
Correct |
19 ms |
8540 KB |
Output is correct |
32 |
Correct |
10 ms |
8540 KB |
Output is correct |
33 |
Correct |
69 ms |
8580 KB |
Output is correct |
34 |
Correct |
69 ms |
8540 KB |
Output is correct |
35 |
Correct |
70 ms |
8564 KB |
Output is correct |
36 |
Correct |
69 ms |
8576 KB |
Output is correct |
37 |
Correct |
71 ms |
8568 KB |
Output is correct |
38 |
Correct |
69 ms |
8528 KB |
Output is correct |
39 |
Correct |
0 ms |
344 KB |
Output is correct |
40 |
Correct |
69 ms |
8532 KB |
Output is correct |
41 |
Correct |
69 ms |
8584 KB |
Output is correct |
42 |
Correct |
51 ms |
8532 KB |
Output is correct |
43 |
Correct |
70 ms |
8568 KB |
Output is correct |
44 |
Correct |
70 ms |
8528 KB |
Output is correct |
45 |
Correct |
1 ms |
344 KB |
Output is correct |
46 |
Correct |
71 ms |
8556 KB |
Output is correct |
47 |
Correct |
76 ms |
8528 KB |
Output is correct |
48 |
Correct |
0 ms |
348 KB |
Output is correct |
49 |
Correct |
72 ms |
8580 KB |
Output is correct |
50 |
Correct |
14 ms |
8540 KB |
Output is correct |
51 |
Correct |
68 ms |
8560 KB |
Output is correct |
52 |
Correct |
75 ms |
8528 KB |
Output is correct |
53 |
Correct |
14 ms |
8540 KB |
Output is correct |
54 |
Correct |
13 ms |
8580 KB |
Output is correct |
55 |
Correct |
14 ms |
8540 KB |
Output is correct |
56 |
Correct |
10 ms |
8540 KB |
Output is correct |
57 |
Correct |
10 ms |
8540 KB |
Output is correct |
58 |
Correct |
10 ms |
8792 KB |
Output is correct |