oj.uz

Submission #748747

# Submission time Handle Problem Language Result Execution time Memory
748747 2023-05-26T21:10:44 Z LKR__enjoyer Bank (IZhO14_bank) C++17
52 / 100
 2 ms 340 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++){
int x=mask&(1<<i); if(!x)continue;
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=1;i<(1<<m);i++)evaluate(i);
curr=mask_list[lef[0]];
for(int i=1;i<n;i++){
proc(i);
if(curr.empty()){cout<<"NO"; return 0;}
}
cout<<"YES";

return 0;   
}

Subtask #1
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 320 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 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 2 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -