# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
988272 | 2024-05-24T11:58:33 Z | Tsagana | Bank (IZhO14_bank) | C++14 | 17 ms | 6912 KB |
#include<bits/stdc++.h> #define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); #define int long long #define F first #define S second using namespace std; pair<int, int> dp[200000]; void solve () { vector<int> a, b; int n, m; cin >> n >> m; a.resize(n); b.resize(m); for (int &i: a) cin >> i; for (int &i: b) cin >> i; memset(dp, -1, sizeof dp); dp[0] = {0, 0}; for (int mask = 0; mask < (1 << m); mask++) { for (int last = 0; last < m; last++) { if (!(mask & (1 << last))) continue ; int pre = mask ^ (1 << last); if (dp[pre].F == -1) continue ; int remain = dp[pre].S + b[last]; int need = a[dp[pre].F]; if (remain < need) dp[mask] = {dp[pre].F, remain}; if (remain == need) dp[mask] = {dp[pre].F + 1, 0}; } if (dp[mask].F == n) {cout << "YES"; return ;} } cout << "NO"; } signed main() {IOS solve(); return 0;}
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 3672 KB | Output is correct |
2 | Correct | 1 ms | 3420 KB | Output is correct |
3 | Correct | 1 ms | 3420 KB | Output is correct |
4 | Correct | 1 ms | 3420 KB | Output is correct |
5 | Runtime error | 17 ms | 6912 KB | Execution killed with signal 11 |
6 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 3420 KB | Output is correct |
2 | Correct | 1 ms | 3420 KB | Output is correct |
3 | Correct | 2 ms | 3420 KB | Output is correct |
4 | Correct | 1 ms | 3420 KB | Output is correct |
5 | Correct | 1 ms | 3420 KB | Output is correct |
6 | Correct | 2 ms | 3420 KB | Output is correct |
7 | Correct | 1 ms | 3420 KB | Output is correct |
8 | Correct | 1 ms | 3420 KB | Output is correct |
9 | Correct | 1 ms | 3416 KB | Output is correct |
10 | Correct | 1 ms | 3420 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 3420 KB | Output is correct |
2 | Correct | 2 ms | 3452 KB | Output is correct |
3 | Correct | 2 ms | 3420 KB | Output is correct |
4 | Correct | 2 ms | 3416 KB | Output is correct |
5 | Correct | 2 ms | 3420 KB | Output is correct |
6 | Correct | 2 ms | 3420 KB | Output is correct |
7 | Correct | 2 ms | 3420 KB | Output is correct |
8 | Correct | 2 ms | 3416 KB | Output is correct |
9 | Correct | 2 ms | 3420 KB | Output is correct |
10 | Correct | 2 ms | 3420 KB | Output is correct |
11 | Correct | 2 ms | 3420 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 3672 KB | Output is correct |
2 | Correct | 1 ms | 3420 KB | Output is correct |
3 | Correct | 1 ms | 3420 KB | Output is correct |
4 | Correct | 1 ms | 3420 KB | Output is correct |
5 | Runtime error | 17 ms | 6912 KB | Execution killed with signal 11 |
6 | Halted | 0 ms | 0 KB | - |