# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
671845 | 2022-12-14T04:38:50 Z | Baytoro | Bank (IZhO14_bank) | C++17 | 79 ms | 16948 KB |
#include <bits/stdc++.h> using namespace std; #define ios ios::sync_with_stdio(false); cin.tie(NULL); #define pb push_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define fr first #define sc second //#define int long long #define endl '\n' void fopn(string name){ freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout); } const int INF=1e9,mod=1e9+7; int dp[(1<<20)+5]; int ok[(1<<20)+5]; vector<int> f(vector<int> a, vector<int> b){ memset(ok,-1,sizeof(ok)); memset(dp,0,sizeof(ok)); int n=a.size(); int m=b.size(); vector<int> ans; for(int i=0;i<n;i++){ for(int mask=1;mask<(1<<m);mask++){ for(int j=0;j<m;j++){ if(mask&(1<<j)){ //cout<<ok[(mask^(1<<j))]<<endl; if(ok[mask^(1<<j)]<i-1) continue; dp[mask]=(dp[mask^(1<<j)])+b[j]; //get(mask); //cout<<j<<' '<< if(dp[mask]>a[i]) continue; ok[mask]=i-1; if(dp[mask]==a[i]){ dp[mask]=0; ok[mask]=i; //get(mask); if(i==n-1){ ans.pb(mask); } } break; } } } } return ans; } int n,m; void solve(){ cin>>n>>m; vector<int> a(n+1),b(m+1); for(int i=0;i<n;i++) cin>>a[i]; for(int i=0;i<m;i++) cin>>b[i]; vector<int> tmp; for(int i=0;i<n/2;i++) tmp.pb(a[i]); vector<int> ans1=f(tmp,b); tmp.clear(); for(int i=n/2;i<n;i++) tmp.pb(a[i]); vector<int> ans2=f(tmp,b); //cout<<ans2.size()<<endl; if(ans1.size()==0){ if(ans2.size()>0){ cout<<"YES\n"; return; } cout<<"NO\n"; return; } for(auto i: ans1){ if(ans2.size()==0) continue; for(auto j: ans2){ if(!(i&j)){ cout<<"YES\n"; return; } } } cout<<"NO\n"; } main(){ ios; int T=1; //cin>>T; while(T--){ solve(); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 8524 KB | Output is correct |
2 | Correct | 4 ms | 8404 KB | Output is correct |
3 | Correct | 4 ms | 8404 KB | Output is correct |
4 | Correct | 6 ms | 8532 KB | Output is correct |
5 | Runtime error | 79 ms | 16948 KB | Execution killed with signal 11 |
6 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 8404 KB | Output is correct |
2 | Correct | 5 ms | 8404 KB | Output is correct |
3 | Correct | 4 ms | 8404 KB | Output is correct |
4 | Correct | 4 ms | 8404 KB | Output is correct |
5 | Correct | 5 ms | 8404 KB | Output is correct |
6 | Correct | 5 ms | 8404 KB | Output is correct |
7 | Correct | 6 ms | 8404 KB | Output is correct |
8 | Correct | 5 ms | 8404 KB | Output is correct |
9 | Correct | 5 ms | 8404 KB | Output is correct |
10 | Correct | 5 ms | 8528 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 16 ms | 8404 KB | Output is correct |
2 | Correct | 8 ms | 8404 KB | Output is correct |
3 | Correct | 21 ms | 8404 KB | Output is correct |
4 | Incorrect | 29 ms | 8432 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 8524 KB | Output is correct |
2 | Correct | 4 ms | 8404 KB | Output is correct |
3 | Correct | 4 ms | 8404 KB | Output is correct |
4 | Correct | 6 ms | 8532 KB | Output is correct |
5 | Runtime error | 79 ms | 16948 KB | Execution killed with signal 11 |
6 | Halted | 0 ms | 0 KB | - |