| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 166037 | GioChkhaidze | Bank (IZhO14_bank) | C++14 | 1065 ms | 26104 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC optimize ("O3")
#pragma GCC optimize ("Ofast")
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int n,m,S0,S1,S2,i,j,mask;
int a[22],b[22];
ll F1[1058576],F2[1058576],F3[1058576];
bool ans[(1<<21)];
main () {
cin>>n>>m;
for (i=0; i<n; i++) {
cin>>a[i];
S1+=a[i];
}
for (i=0; i<m; i++)
cin>>b[i];
for (j=0; j<n; j++) {
for (mask=0; mask<(1<<m); ++mask) {
S0=0;
for (i=0; i<m; i++)
if ((mask>>i)&1) S0+=b[i];
if (S0==a[j]) F2[mask]++;
}
for (int i=0; i<m; ++i)
for (mask=0; mask<(1<<m); ++mask)
if ((mask>>i)&1) F2[mask]+=F2[mask^(1<<i)];
for (mask=0; mask<(1<<m); ++mask) {
if (!j) F3[mask]=F2[mask];
else F3[mask]=F1[mask]*F2[mask];
F1[mask]=F3[mask];
F2[mask]=0;
}
for (i=m-1; i>=0; --i)
for (mask=(1<<m)-1; mask>=0; --mask)
if ((mask>>i)&1) F3[mask]-=F3[mask^(1<<i)];
for (mask=0; mask<(1<<m); ++mask)
ans[mask]|=F3[mask];
}
for (mask=(1<<m)-1; mask>=0; --mask)
if (ans[mask]) {
S2=0;
for (i=0; i<m; i++)
if ((mask>>i)&1) S2+=b[i];
if (S1==S2) { cout<<"YES\n"; return 0; }
}
cout<<"NO\n";
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
