| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 346723 |
2021-01-10T19:37:38 Z |
knightron0 |
Bank (IZhO14_bank) |
C++14 |
|
714 ms |
175852 KB |
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define clr(a) memset(a, 0, sizeof(a))
#define sz(x) x.size()
#define printvector(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout<<*it<<" "; cout<<endl;
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, x, y) for (int i = x; i < y; i++)
#define DEC(i, x, y) for (int i = x; i >= y; i--)
#define all(v) v.begin(), v.end()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define alla(a, n) a, a + n
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (a * b)/gcd(a, b)
#define int long long int
#define ull unsigned long long
#define printarray(arr, n) for(int i= 0;i<n;i++) cout<<arr[i]<<' '; cout<<endl;
#define printvecpairs(vec) for(auto it: vec) cout<<it.fr<<' '<<it.sc<<endl;
#define initdp(a) memset(a, -1, sizeof(a));
#define endl '\n'
#define float long double
using namespace std;
const int MOD = 1e9 + 7;
const int INF = 2e15;
const int MAXN = 20;
int fastexpo(int b, int exp){
if(exp == 0) return 1;
if(exp == 1) return b;
int ans = (fastexpo(b,exp/2) % MOD);
ans *= ans;
ans %= MOD;
if(exp % 2 == 1){
ans *= b;
}
ans %= MOD;
return ans;
}
int a[MAXN], b[MAXN];
int n, m;
vector<int> poss[1006];
int dp[MAXN][(1LL<<MAXN)];
bool solve(int idx, int mask){
if(idx == n) return 1;
if(dp[idx][mask] != -1){
if(dp[idx][mask] == 0) return 0;
else return 1;
}
bool ans = 0;
for(auto mask2: poss[a[idx]]){
if((mask2&mask) == 0){
ans |= solve(idx+1, mask2|mask);
}
}
if(ans) dp[idx][mask] = 1;
else dp[idx][mask] = 0;
return ans;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
initdp(dp);
cin>>n>>m;
int mx = 0;
for(int i= 0;i<n;i++){
cin>>a[i];
mx = max(mx, a[i]);
}
for(int i = 0;i<m;i++){
cin>>b[i];
}
for(int mask = 0;mask<(1LL<<m);mask++){
int sum =0;
for(int i = 0;i<m;i++){
if((1LL<<i) & mask){
sum += b[i];
}
}
if(sum <= mx) poss[sum].pb(mask);
}
if(solve(0, 0)){
cout<<"YES"<<endl;
} else {
cout<<"NO"<<endl;
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
86 ms |
164460 KB |
Output is correct |
| 2 |
Correct |
87 ms |
164460 KB |
Output is correct |
| 3 |
Correct |
88 ms |
164460 KB |
Output is correct |
| 4 |
Correct |
88 ms |
164588 KB |
Output is correct |
| 5 |
Correct |
154 ms |
164588 KB |
Output is correct |
| 6 |
Correct |
87 ms |
164460 KB |
Output is correct |
| 7 |
Correct |
87 ms |
164592 KB |
Output is correct |
| 8 |
Correct |
156 ms |
169836 KB |
Output is correct |
| 9 |
Correct |
161 ms |
175852 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
86 ms |
164460 KB |
Output is correct |
| 2 |
Correct |
87 ms |
164460 KB |
Output is correct |
| 3 |
Correct |
88 ms |
164588 KB |
Output is correct |
| 4 |
Correct |
87 ms |
164460 KB |
Output is correct |
| 5 |
Correct |
86 ms |
164588 KB |
Output is correct |
| 6 |
Correct |
87 ms |
164568 KB |
Output is correct |
| 7 |
Correct |
87 ms |
164460 KB |
Output is correct |
| 8 |
Correct |
87 ms |
164460 KB |
Output is correct |
| 9 |
Correct |
88 ms |
164460 KB |
Output is correct |
| 10 |
Correct |
87 ms |
164460 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
88 ms |
164460 KB |
Output is correct |
| 2 |
Correct |
88 ms |
164588 KB |
Output is correct |
| 3 |
Correct |
94 ms |
164540 KB |
Output is correct |
| 4 |
Correct |
87 ms |
164460 KB |
Output is correct |
| 5 |
Correct |
88 ms |
164460 KB |
Output is correct |
| 6 |
Correct |
89 ms |
164460 KB |
Output is correct |
| 7 |
Correct |
89 ms |
164588 KB |
Output is correct |
| 8 |
Correct |
88 ms |
164588 KB |
Output is correct |
| 9 |
Correct |
98 ms |
164588 KB |
Output is correct |
| 10 |
Correct |
89 ms |
164460 KB |
Output is correct |
| 11 |
Correct |
89 ms |
164716 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
86 ms |
164460 KB |
Output is correct |
| 2 |
Correct |
87 ms |
164460 KB |
Output is correct |
| 3 |
Correct |
88 ms |
164460 KB |
Output is correct |
| 4 |
Correct |
88 ms |
164588 KB |
Output is correct |
| 5 |
Correct |
154 ms |
164588 KB |
Output is correct |
| 6 |
Correct |
87 ms |
164460 KB |
Output is correct |
| 7 |
Correct |
87 ms |
164592 KB |
Output is correct |
| 8 |
Correct |
156 ms |
169836 KB |
Output is correct |
| 9 |
Correct |
161 ms |
175852 KB |
Output is correct |
| 10 |
Correct |
86 ms |
164460 KB |
Output is correct |
| 11 |
Correct |
87 ms |
164460 KB |
Output is correct |
| 12 |
Correct |
88 ms |
164588 KB |
Output is correct |
| 13 |
Correct |
87 ms |
164460 KB |
Output is correct |
| 14 |
Correct |
86 ms |
164588 KB |
Output is correct |
| 15 |
Correct |
87 ms |
164568 KB |
Output is correct |
| 16 |
Correct |
87 ms |
164460 KB |
Output is correct |
| 17 |
Correct |
87 ms |
164460 KB |
Output is correct |
| 18 |
Correct |
88 ms |
164460 KB |
Output is correct |
| 19 |
Correct |
87 ms |
164460 KB |
Output is correct |
| 20 |
Correct |
88 ms |
164460 KB |
Output is correct |
| 21 |
Correct |
88 ms |
164588 KB |
Output is correct |
| 22 |
Correct |
94 ms |
164540 KB |
Output is correct |
| 23 |
Correct |
87 ms |
164460 KB |
Output is correct |
| 24 |
Correct |
88 ms |
164460 KB |
Output is correct |
| 25 |
Correct |
89 ms |
164460 KB |
Output is correct |
| 26 |
Correct |
89 ms |
164588 KB |
Output is correct |
| 27 |
Correct |
88 ms |
164588 KB |
Output is correct |
| 28 |
Correct |
98 ms |
164588 KB |
Output is correct |
| 29 |
Correct |
89 ms |
164460 KB |
Output is correct |
| 30 |
Correct |
89 ms |
164716 KB |
Output is correct |
| 31 |
Correct |
161 ms |
172780 KB |
Output is correct |
| 32 |
Correct |
209 ms |
169068 KB |
Output is correct |
| 33 |
Correct |
162 ms |
164588 KB |
Output is correct |
| 34 |
Correct |
154 ms |
164588 KB |
Output is correct |
| 35 |
Correct |
155 ms |
164588 KB |
Output is correct |
| 36 |
Correct |
152 ms |
164588 KB |
Output is correct |
| 37 |
Correct |
152 ms |
164588 KB |
Output is correct |
| 38 |
Correct |
153 ms |
164460 KB |
Output is correct |
| 39 |
Correct |
179 ms |
164588 KB |
Output is correct |
| 40 |
Correct |
158 ms |
164584 KB |
Output is correct |
| 41 |
Correct |
151 ms |
164588 KB |
Output is correct |
| 42 |
Correct |
157 ms |
164972 KB |
Output is correct |
| 43 |
Correct |
154 ms |
164588 KB |
Output is correct |
| 44 |
Correct |
153 ms |
164788 KB |
Output is correct |
| 45 |
Correct |
154 ms |
164844 KB |
Output is correct |
| 46 |
Correct |
157 ms |
165100 KB |
Output is correct |
| 47 |
Correct |
153 ms |
164460 KB |
Output is correct |
| 48 |
Correct |
154 ms |
166380 KB |
Output is correct |
| 49 |
Correct |
152 ms |
164588 KB |
Output is correct |
| 50 |
Correct |
424 ms |
164584 KB |
Output is correct |
| 51 |
Correct |
154 ms |
167148 KB |
Output is correct |
| 52 |
Correct |
156 ms |
164588 KB |
Output is correct |
| 53 |
Correct |
714 ms |
164616 KB |
Output is correct |
| 54 |
Correct |
462 ms |
164716 KB |
Output is correct |
| 55 |
Correct |
424 ms |
164460 KB |
Output is correct |
| 56 |
Correct |
467 ms |
164588 KB |
Output is correct |
| 57 |
Correct |
469 ms |
164588 KB |
Output is correct |
| 58 |
Correct |
468 ms |
164588 KB |
Output is correct |
