# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
768082 |
2023-06-27T12:35:30 Z |
raysh07 |
Bank (IZhO14_bank) |
C++17 |
|
1000 ms |
4688 KB |
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define INF (int)1e18
mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());
void Solve()
{
int n, m; cin >> n >> m;
vector <int> a(n), b(m);
for (auto &x : a) cin >> x;
for (auto &x : b) cin >> x;
int s1 = 0;
vector <int> s(1 << m, 0);
for (int i = 1; i < (1 << m); i++){
for (int j = 0; j < m; j++){
if (i >> j & 1) s[i] += b[j];
}
}
vector <bool> can(1 << m, false);
can[0] = true;
for (auto x : a){
s1 += x;
vector <bool> nc(1 << m, false);
for (int i = 0; i < (1 << m); i++){
nc[i] = can[i];
for (int j = 0; j < m; j++){
if (i >> j & 1){
int mask = i ^ (1 << j);
if (nc[mask] && s[mask] >= s1 - x && s[i] <= s1){
nc[i] = true;
}
}
}
if (nc[i] && s[i] == s1) can[i] = true;
else can[i] = false;
}
}
for (auto x : can) if (x == true){
cout << "YES\n";
return;
}
cout << "NO\n";
}
int32_t main()
{
auto begin = std::chrono::high_resolution_clock::now();
ios_base::sync_with_stdio(0);
cin.tie(0);
int t = 1;
// cin >> t;
for(int i = 1; i <= t; i++)
{
//cout << "Case #" << i << ": ";
Solve();
}
auto end = std::chrono::high_resolution_clock::now();
auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n";
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
5 ms |
468 KB |
Output is correct |
5 |
Correct |
145 ms |
4680 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
143 ms |
4676 KB |
Output is correct |
9 |
Correct |
135 ms |
4688 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
8 ms |
340 KB |
Output is correct |
2 |
Correct |
4 ms |
340 KB |
Output is correct |
3 |
Correct |
11 ms |
388 KB |
Output is correct |
4 |
Correct |
15 ms |
388 KB |
Output is correct |
5 |
Correct |
11 ms |
388 KB |
Output is correct |
6 |
Correct |
6 ms |
340 KB |
Output is correct |
7 |
Correct |
5 ms |
340 KB |
Output is correct |
8 |
Correct |
4 ms |
340 KB |
Output is correct |
9 |
Correct |
9 ms |
340 KB |
Output is correct |
10 |
Correct |
9 ms |
384 KB |
Output is correct |
11 |
Correct |
15 ms |
352 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
5 ms |
468 KB |
Output is correct |
5 |
Correct |
145 ms |
4680 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
143 ms |
4676 KB |
Output is correct |
9 |
Correct |
135 ms |
4688 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
212 KB |
Output is correct |
12 |
Correct |
1 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |
14 |
Correct |
1 ms |
212 KB |
Output is correct |
15 |
Correct |
1 ms |
212 KB |
Output is correct |
16 |
Correct |
1 ms |
212 KB |
Output is correct |
17 |
Correct |
1 ms |
212 KB |
Output is correct |
18 |
Correct |
1 ms |
212 KB |
Output is correct |
19 |
Correct |
1 ms |
212 KB |
Output is correct |
20 |
Correct |
8 ms |
340 KB |
Output is correct |
21 |
Correct |
4 ms |
340 KB |
Output is correct |
22 |
Correct |
11 ms |
388 KB |
Output is correct |
23 |
Correct |
15 ms |
388 KB |
Output is correct |
24 |
Correct |
11 ms |
388 KB |
Output is correct |
25 |
Correct |
6 ms |
340 KB |
Output is correct |
26 |
Correct |
5 ms |
340 KB |
Output is correct |
27 |
Correct |
4 ms |
340 KB |
Output is correct |
28 |
Correct |
9 ms |
340 KB |
Output is correct |
29 |
Correct |
9 ms |
384 KB |
Output is correct |
30 |
Correct |
15 ms |
352 KB |
Output is correct |
31 |
Correct |
227 ms |
4688 KB |
Output is correct |
32 |
Correct |
313 ms |
4684 KB |
Output is correct |
33 |
Correct |
630 ms |
4688 KB |
Output is correct |
34 |
Correct |
895 ms |
4684 KB |
Output is correct |
35 |
Correct |
968 ms |
4680 KB |
Output is correct |
36 |
Execution timed out |
1077 ms |
4684 KB |
Time limit exceeded |
37 |
Halted |
0 ms |
0 KB |
- |