| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 765627 |
2023-06-24T23:49:21 Z |
edfearay11 |
Bank (IZhO14_bank) |
C++17 |
|
1000 ms |
316 KB |
#include<bits/stdc++.h>
using namespace std;
#define f(i,a,b) for(int i=a;i<b;i++)
#define af(i,a,b) for(int i=a;i>=b;i--)
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define PB push_back
#define MP make_pair
#define F first
#define S second
typedef long long int ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
const ll mod=1e9+7;
const int maxN=2e5+5;
const ll inf=1e12;
int n,m;
vector<int> v,u;
bool xx=false;
int vis[30];
void prob(int i, int j){
/*f(l,0,n){
cout<<v[l]<<" ";
}
cout<<"\n";
f(l,0,m){
cout<<vis[l]<<" ";
}
cout<<"\n";
*/
if(i==n){
xx=true;
return;
}
if(v[i]==0){
f(x,0,m) prob(i+1,x);
return;
}
if(vis[j]==1) return;
if(v[i]<u[j]) return;
vis[j]=1;
v[i]-=u[j];
f(x,j+1,m){
prob(i,x);
}
v[i]+=u[j];
vis[j]=0;
}
void go(){
cin>>n>>m;
int a;
f(i,0,n){
cin>>a;
v.PB(a);
}
f(i,0,m){
cin>>a;
u.PB(a);
}
u.PB(0);
m++;
f(i,0,m) prob(0,i);
if(xx) cout<<"YES\n";
else cout<<"NO\n";
}
int main(){
fastio;
int test=1;
//cin>>test;
f(i,1,test+1){
//cout<<"Case "<<i<<":\n";
go();
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 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 |
1 ms |
212 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 |
8 ms |
316 KB |
Output is correct |
| 9 |
Correct |
11 ms |
212 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
316 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
0 ms |
212 KB |
Output is correct |
| 6 |
Correct |
2 ms |
212 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
1 ms |
212 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 |
212 KB |
Output is correct |
| 3 |
Execution timed out |
1002 ms |
300 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 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 |
1 ms |
212 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 |
8 ms |
316 KB |
Output is correct |
| 9 |
Correct |
11 ms |
212 KB |
Output is correct |
| 10 |
Correct |
6 ms |
316 KB |
Output is correct |
| 11 |
Correct |
0 ms |
212 KB |
Output is correct |
| 12 |
Correct |
0 ms |
212 KB |
Output is correct |
| 13 |
Correct |
0 ms |
212 KB |
Output is correct |
| 14 |
Correct |
0 ms |
212 KB |
Output is correct |
| 15 |
Correct |
2 ms |
212 KB |
Output is correct |
| 16 |
Correct |
1 ms |
212 KB |
Output is correct |
| 17 |
Correct |
1 ms |
212 KB |
Output is correct |
| 18 |
Correct |
1 ms |
212 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 |
212 KB |
Output is correct |
| 22 |
Execution timed out |
1002 ms |
300 KB |
Time limit exceeded |
| 23 |
Halted |
0 ms |
0 KB |
- |
