Submission #748748

# Submission time Handle Problem Language Result Execution time Memory
748748 2023-05-26T21:15:00 Z LKR__enjoyer Bank (IZhO14_bank) C++17
71 / 100
595 ms 262144 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];
vector<int> 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)return;
mask_list[wyn].pb(mask);    
}

void proc(int ind){
vector<int> nex={};
for(int i : curr){
for(int j : mask_list[lef[ind]])
if((i&j)==0)nex.pb((i|j));    
}
curr=nex;
}

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

return 0;   
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 61 ms 6832 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 60 ms 5680 KB Output is correct
9 Correct 69 ms 6096 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 61 ms 6832 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 60 ms 5680 KB Output is correct
9 Correct 69 ms 6096 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 2 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 63 ms 5664 KB Output is correct
32 Correct 595 ms 10128 KB Output is correct
33 Correct 59 ms 1064 KB Output is correct
34 Correct 56 ms 212 KB Output is correct
35 Correct 57 ms 448 KB Output is correct
36 Correct 55 ms 212 KB Output is correct
37 Correct 56 ms 464 KB Output is correct
38 Correct 56 ms 452 KB Output is correct
39 Runtime error 477 ms 262144 KB Execution killed with signal 9
40 Halted 0 ms 0 KB -