# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
980934 | 2024-05-12T15:58:32 Z | khanhtb | Bank (IZhO14_bank) | C++14 | 1000 ms | 51096 KB |
#include<bits/stdc++.h> #define ll long long #define ull unsigned long long #define ld double #define pb push_back #define pf push_front #define vi vector<ll> #define vll vector<vi> #define pll pair<ll,ll> #define vpll vector<pll> #define all(a) a.begin(), a.end() #define fi first #define se second using namespace std; const ll mod = 1e9+7; const ll inf = 1e18; const ll base = 26; const ll blocksz = 320; const ll N = 1e6+8; const ll buff = 2e7+8; ll n,m,dp[21][1<<20],a[21],b[21]; vi premask[N]; void solve(){ cin >> n >> m; for(ll i = 1; i <= n; i++) cin >> a[i]; for(ll i = 0; i < m; i++) cin >> b[i]; for(ll mask = 0; mask < 1<<m; mask++){ dp[0][mask] = 1; ll sum = 0; for(ll i = 0; i < m; i++){ if(mask>>i&1) sum += b[i]; } premask[sum].pb(mask); } for(ll i = 0; i < n; i++){ for(ll mask = 0; mask < 1<<m; mask++){ if(dp[mask]){ for(ll submask:premask[a[i+1]]){ if(submask&mask) continue; dp[i+1][submask|mask] |= dp[i][mask]; } } } } cout << (dp[n][(1<<m)-1]?"YES":"NO"); } signed main(){ ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); if(fopen("test.inp","r")){ freopen("test.inp","r",stdin); freopen("test.out","w",stdout); } int T = 1; // cin >> T; while(T--){ solve(); cout << '\n'; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 25176 KB | Output is correct |
2 | Correct | 5 ms | 25180 KB | Output is correct |
3 | Correct | 6 ms | 25180 KB | Output is correct |
4 | Correct | 12 ms | 25692 KB | Output is correct |
5 | Correct | 80 ms | 45712 KB | Output is correct |
6 | Correct | 5 ms | 25180 KB | Output is correct |
7 | Correct | 6 ms | 25292 KB | Output is correct |
8 | Execution timed out | 1051 ms | 51096 KB | Time limit exceeded |
9 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 25180 KB | Output is correct |
2 | Correct | 6 ms | 25180 KB | Output is correct |
3 | Correct | 5 ms | 25180 KB | Output is correct |
4 | Correct | 6 ms | 25180 KB | Output is correct |
5 | Correct | 6 ms | 25180 KB | Output is correct |
6 | Correct | 6 ms | 25180 KB | Output is correct |
7 | Correct | 6 ms | 25180 KB | Output is correct |
8 | Correct | 8 ms | 25180 KB | Output is correct |
9 | Correct | 5 ms | 25180 KB | Output is correct |
10 | Correct | 6 ms | 25176 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 8 ms | 26204 KB | Output is correct |
2 | Correct | 8 ms | 25728 KB | Output is correct |
3 | Correct | 8 ms | 26460 KB | Output is correct |
4 | Correct | 9 ms | 26996 KB | Output is correct |
5 | Correct | 9 ms | 26460 KB | Output is correct |
6 | Correct | 8 ms | 25432 KB | Output is correct |
7 | Correct | 7 ms | 25948 KB | Output is correct |
8 | Correct | 7 ms | 25692 KB | Output is correct |
9 | Correct | 8 ms | 26204 KB | Output is correct |
10 | Correct | 8 ms | 26204 KB | Output is correct |
11 | Correct | 7 ms | 25208 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 25176 KB | Output is correct |
2 | Correct | 5 ms | 25180 KB | Output is correct |
3 | Correct | 6 ms | 25180 KB | Output is correct |
4 | Correct | 12 ms | 25692 KB | Output is correct |
5 | Correct | 80 ms | 45712 KB | Output is correct |
6 | Correct | 5 ms | 25180 KB | Output is correct |
7 | Correct | 6 ms | 25292 KB | Output is correct |
8 | Execution timed out | 1051 ms | 51096 KB | Time limit exceeded |
9 | Halted | 0 ms | 0 KB | - |