# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
68527 |
2018-08-17T09:08:45 Z |
quoriess |
Bank (IZhO14_bank) |
C++14 |
|
74 ms |
1692 KB |
#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main(){
int n,m;
cin>>n>>m;
vector<int> salary,banks;
for (int i = 0; i < n; i++)
{
int a;
cin>>a;
salary.push_back(a);
}
for (int j = 0; j < m; j++)
{
int a;
cin>>a;
banks.push_back(a);
}
vector<bitset<20> > sncler[n];
for (int i = 0; i < 1<<m; i++)
{
bitset<20> smd(i);
int tplm=0;
for (int j = 0; j < m; j++)
{
if(smd[j])tplm+=banks[j];
}
for(int j=0;j<n;j++){
if(salary[j]==tplm)
sncler[j].push_back(smd);
}
}
int mstb=1<<m;
bool dp[n][mstb];
for(int i=0;i<n;i++){
for(int j=0;j<mstb;j++)dp[i][j]=0;
}
for(auto j:sncler[0])dp[0][j.to_ulong()]=1;
for (int i = 1; i < n; i++)
{
for(int k=0;k<mstb;k++){
for (auto j: sncler[i])
{
if(k&&j.to_ulong()==0){
dp[i][k^j.to_ulong()]=dp[i-1][k]||dp[i][k^j.to_ulong()];
}
}
}
}
bool ans=0;
for(int i=1;i<mstb;i++)if(dp[n-1][i])ans=true;
cout << (ans?"YES":"NO")<<"\n";
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
508 KB |
Output is correct |
3 |
Correct |
2 ms |
508 KB |
Output is correct |
4 |
Correct |
4 ms |
508 KB |
Output is correct |
5 |
Correct |
73 ms |
1344 KB |
Output is correct |
6 |
Correct |
2 ms |
1344 KB |
Output is correct |
7 |
Correct |
2 ms |
1344 KB |
Output is correct |
8 |
Correct |
74 ms |
1596 KB |
Output is correct |
9 |
Correct |
74 ms |
1692 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
1692 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
1692 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
508 KB |
Output is correct |
3 |
Correct |
2 ms |
508 KB |
Output is correct |
4 |
Correct |
4 ms |
508 KB |
Output is correct |
5 |
Correct |
73 ms |
1344 KB |
Output is correct |
6 |
Correct |
2 ms |
1344 KB |
Output is correct |
7 |
Correct |
2 ms |
1344 KB |
Output is correct |
8 |
Correct |
74 ms |
1596 KB |
Output is correct |
9 |
Correct |
74 ms |
1692 KB |
Output is correct |
10 |
Incorrect |
2 ms |
1692 KB |
Output isn't correct |
11 |
Halted |
0 ms |
0 KB |
- |