# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
684437 |
2023-01-21T08:06:45 Z |
pragmatist |
Bank (IZhO14_bank) |
C++17 |
|
1000 ms |
4416 KB |
/*
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
#pragma GCC target ("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
*/
#pragma GCC target("avx2", "bmi", "bmi2", "lzcnt", "popcnt")
#include<bits/stdc++.h>
#define sz(v) (int)v.size()
#define ll long long
#define pb push_back
#define x first
#define y second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define nl "\n"
using namespace std;
using pii = pair<int, int>;
const int N = (int)3e5 + 7; // make sure this is right
const int M = (int)1e6 + 7;
const int inf = (int)1e9 + 7;
const ll INF = (ll)3e18 + 7;
const ll MOD = (ll)998244353; // make sure this is right
bool bit(int x, int i) {
return x >> i & 1;
}
pii dir[] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
int n, m, a[21], b[20], sum[1 << 20];
int dp[21][1 << 20];
void solve() {
cin >> n >> m;
for(int i = 1; i <= n; ++i) {
cin >> a[i];
}
for(int i = 0; i < m; ++i) {
cin >> b[i];
}
for(int mask = 0; mask < (1 << m); ++mask) {
int cur = 0;
for(int i = 0; i < m; ++i) {
if(bit(mask, i)) {
cur += b[i];
}
}
sum[mask] = cur;
}
dp[0][0] = 1;
for(int i = 1; i <= n; ++i) {
for(int mask = 0; mask < (1 << m); ++mask) {
for(int sub = mask; sub && !dp[i][mask]; sub = (sub - 1) & mask) {
if(sum[sub] == a[i]) {
dp[i][mask] |= dp[i - 1][mask ^ sub];
}
}
}
}
for(int mask = 0; mask < (1 << m); ++mask) {
if(dp[n][mask]) {
cout << "YES\n";
return;
}
}
cout << "NO\n";
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int test = 1;
//cin >> test;
for(int i = 1; i <= test; ++i) {
//cout << "Case #" << i << ": ";
solve();
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
384 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
20 ms |
584 KB |
Output is correct |
5 |
Execution timed out |
1085 ms |
4416 KB |
Time limit exceeded |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
332 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
324 KB |
Output is correct |
8 |
Correct |
1 ms |
324 KB |
Output is correct |
9 |
Correct |
1 ms |
340 KB |
Output is correct |
10 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
38 ms |
788 KB |
Output is correct |
2 |
Correct |
21 ms |
580 KB |
Output is correct |
3 |
Correct |
53 ms |
972 KB |
Output is correct |
4 |
Correct |
72 ms |
1168 KB |
Output is correct |
5 |
Correct |
53 ms |
996 KB |
Output is correct |
6 |
Correct |
26 ms |
340 KB |
Output is correct |
7 |
Correct |
24 ms |
672 KB |
Output is correct |
8 |
Correct |
25 ms |
584 KB |
Output is correct |
9 |
Correct |
61 ms |
844 KB |
Output is correct |
10 |
Correct |
43 ms |
832 KB |
Output is correct |
11 |
Correct |
73 ms |
416 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
384 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
20 ms |
584 KB |
Output is correct |
5 |
Execution timed out |
1085 ms |
4416 KB |
Time limit exceeded |
6 |
Halted |
0 ms |
0 KB |
- |