/*
We found Despacito 5 during contest (not clickbait)
*/
#include <iostream>
#include <cstdio>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <cstring>
#include <cfloat>
#include <cmath>
#include <cassert>
#include <locale>
#include <string>
#include <bitset>
#include <functional>
#include <climits>
#include <iomanip>
using namespace std;
#define read(x) freopen(x,"r",stdin)
#define write(x) freopen(x,"w",stdout)
#define cl(a,b) memset(a,b,sizeof(a))
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define ll long long
#define ld long double
#define vec vector
#define vi vec<int>
#define heap priority_queue
#define res reserve
#define pb push_back
#define f(x,y,z) for(int x=(y); x<(z); x++)
#define fd(x,y,z) for(int x=(y); x>=(z); x--)
#define fit(x,y) for(auto x: y)
#define srt(x) sort(all(x))
#define rsrt(x) sort(rall(x))
#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin())
#define pii pair<int,int>
#define ppi pair<pii,int>
#define pip pair<int,pii>
#define mp make_pair
#define f1 first
#define s2 second
#define cdbg(x) cerr<<#x<<" = "<<x<<",\t";
#define cdbl cerr<<"\n----------\n";
#define pow2(x) ((x)*(x))
#define edist(x1, y1, x2, y2) (sqrt((pow2(x1-x2)+pow2(y1-y2))))
#define mdist(x1, y1, x2, y2) (abs((x1)-(x2))+abs((y1)-(y2)))
#define y1 FullSensei
#define mid ((ss+se)>>1)
#define left (si<<1)
#define right ((si<<1)+1)
#define pi 3.141592653589793
#define popcount __builtin_popcount
#define spc ' '
#define endl '\n'
#define in insert
#define up_b upper_bound
#define low_b lower_bound
#define Decimal fixed<<setprecision(20)
bool checkbit(int x,int y){return (x&(1<<y));}
int setbit(int x,int y){return (x^(1<<y));}
const int dirs[4][2]={{1,0},{0,1},{-1,0},{0,-1}};
const int mod=1e9+7;
const int p1=805306457;
const int p2=1610612741;
const int INF=1e9;
const int N=10;
const int M=10;
const int MVAL=1e3;
int a[N+3], b[M+3];
int n, m;
bool dp[N+3][MVAL+3][1<<M];
int main(){
scanf("%d %d",&n,&m);
assert(n<=N && m<=M);
f(i,1,n+1) scanf("%d",&a[i]);
f(i,0,m) scanf("%d",&b[i]);
if(n==1){
;
}
{
f(k,0,M+1)
dp[n+1][0][k]=dp[n][0][k]=true;
fd(i,n,1){
f(j,0,MVAL+1){
f(k,0,1<<m){
if(j==0){
dp[i][j][k]=dp[i+1][a[i+1]][k];
continue;
}
if(k==0)
continue;
f(l,0,m){
if(checkbit(k,l) && j>=b[l]){
dp[i][j][k]|=dp[i][j-b[l]][setbit(k,l)];
}
}
}
}
}
if(dp[1][a[1]][(1<<m)-1]==1){
cout<<"YES"<<endl;
}
else{
cout<<"NO"<<endl;
}
return 0;
}
return 0;
}
Compilation message
bank.cpp: In function 'int main()':
bank.cpp:81:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d",&n,&m);
~~~~~^~~~~~~~~~~~~~~
bank.cpp:83:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
f(i,1,n+1) scanf("%d",&a[i]);
~~~~~^~~~~~~~~~~~
bank.cpp:84:16: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
f(i,0,m) scanf("%d",&b[i]);
~~~~~^~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
1272 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
186 ms |
4396 KB |
Output is correct |
| 2 |
Correct |
140 ms |
4396 KB |
Output is correct |
| 3 |
Correct |
94 ms |
4396 KB |
Output is correct |
| 4 |
Correct |
188 ms |
4488 KB |
Output is correct |
| 5 |
Correct |
328 ms |
7580 KB |
Output is correct |
| 6 |
Incorrect |
235 ms |
7580 KB |
Output isn't correct |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
2 ms |
7580 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
1272 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
