Submission #748751

# Submission time Handle Problem Language Result Execution time Memory
748751 2023-05-26T21:24:26 Z LKR__enjoyer Bank (IZhO14_bank) C++17
100 / 100
357 ms 732 KB
#include<bits/stdc++.h>
#define f first
#define s second
#define pb push_back
typedef long long ll;
#define pii pair<int,int>
using namespace std;
int n,m;
vector<int> lef,rig;
vector<int> mask_list[1001];
bitset<1001> jest;
bitset<1100000> curr;
void evaluate(int mask){
int wyn=0;
for(int i=0;i<m;i++)if((mask&(1<<i)))wyn+=rig[i];
if(wyn>1000||jest[wyn]==0)return;
mask_list[wyn].pb(mask);    
}

void proc(int ind){
bitset<1100000> nex={false};
for(int i=0;i<(1<<m);i++){
if(!curr[i])continue;
for(int j : mask_list[lef[ind]])
if(!(i&j))nex[(i|j)]=1;
}
curr=nex;
}

int main()
{        
cin>>n>>m;
lef.resize(n);
rig.resize(m);
for(int &i:lef){cin>>i; jest[i]=1;}
for(int &i:rig)cin>>i;
for(int i=0;i<(1<<m);i++)evaluate(i);
for(int i : mask_list[lef[0]])curr[i]=1;
if(curr.count()==0){cout<<"NO"; return 0;}
for(int i=1;i<n;i++){
proc(i);
if(curr.count()==0){cout<<"NO"; return 0;}
}
cout<<"YES";

return 0;   
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 212 KB Output is correct
5 Correct 62 ms 312 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 62 ms 480 KB Output is correct
9 Correct 62 ms 312 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 212 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 212 KB Output is correct
5 Correct 62 ms 312 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 62 ms 480 KB Output is correct
9 Correct 62 ms 312 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 2 ms 212 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 2 ms 596 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 63 ms 584 KB Output is correct
32 Correct 104 ms 732 KB Output is correct
33 Correct 64 ms 568 KB Output is correct
34 Correct 67 ms 560 KB Output is correct
35 Correct 69 ms 572 KB Output is correct
36 Correct 75 ms 580 KB Output is correct
37 Correct 62 ms 444 KB Output is correct
38 Correct 63 ms 308 KB Output is correct
39 Correct 79 ms 564 KB Output is correct
40 Correct 63 ms 564 KB Output is correct
41 Correct 62 ms 568 KB Output is correct
42 Correct 65 ms 588 KB Output is correct
43 Correct 65 ms 580 KB Output is correct
44 Correct 60 ms 308 KB Output is correct
45 Correct 63 ms 572 KB Output is correct
46 Correct 64 ms 572 KB Output is correct
47 Correct 72 ms 452 KB Output is correct
48 Correct 65 ms 476 KB Output is correct
49 Correct 62 ms 212 KB Output is correct
50 Correct 147 ms 576 KB Output is correct
51 Correct 73 ms 588 KB Output is correct
52 Correct 73 ms 584 KB Output is correct
53 Correct 357 ms 708 KB Output is correct
54 Correct 173 ms 580 KB Output is correct
55 Correct 149 ms 572 KB Output is correct
56 Correct 151 ms 572 KB Output is correct
57 Correct 161 ms 452 KB Output is correct
58 Correct 154 ms 584 KB Output is correct