# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
39084 |
2018-01-09T09:21:55 Z |
mrtsima22 |
Bank (IZhO14_bank) |
C++14 |
|
4 ms |
840 KB |
#include <bits/stdc++.h>
using namespace std;
#define lo long
lo b[100003],n,m,s[100003],sum[100003];
lo g[100003],d[23][100003],jam[100003];
string ans="NO";
int main(){std::ios::sync_with_stdio(false);
cin>>n>>m;
for(lo i=0;i<n;i++)
{
cin>>b[i];
sum[i]=sum[i-1]+b[i];
}
for(lo i=0;i<m;i++)
{
cin>>g[i];
}
for(lo i=0;i<(1<<m);i++)
{
for(lo j=0;j<m;j++)
{
if(!((i>>j)&1))
{
jam[i|(1<<j)]=jam[i]+g[j];
}
}
}
d[0][0]=1;
for(lo i=0;i<=n;i++)
{
for(lo j=0;j<(1<<m);j++)
{
if(!d[i][j])
{
continue;
}
if(i==n)
{
ans="YES";
break;
}
if(sum[i]==jam[i])
{
d[i+1][j]=1;
}
for(lo t=0; t<m; t++)
{
if(!((j>>t)&1))
{
d[i][j|(1<<t)]=1;
}
}
}
}
cout<<ans<<endl;
}
/*
* *
* * * *
* * * *
* * * *
* * * *
* * *
* *
* *
* *
* *
* *
* *
* *
* *
*
*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
508 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
840 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |