| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 171425 |
2019-12-28T16:11:13 Z |
Nightmar |
Bank (IZhO14_bank) |
C++17 |
|
1000 ms |
1392 KB |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstdlib>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <iomanip>
#define SWS ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define pb push_back
#define ppb pop_back
#define ft first
#define sd second
#define read freopen("input.txt", "r", stdin)
#define write freopen("output.txt", "w", stdout)
#define files read; write
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int Z = (int)2e3 + 228;
const int N = (int)3e5 + 228;
const int INF = (int)1e9 + 228;
const int MOD = (int)1e9 + 7;
const ll LLINF = (ll)1e15 + 228;
bool f[20][1 << 21];
int main()
{
SWS;
//files;
int n, m;
cin >> n >> m;
vector<int> a(n), b(m);
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < m; i++)
cin >> b[i];
for (int mask = 0; mask < (1 << m); mask++)
{
int sum = 0;
for (int j = 0; j < m; j++)
if ((mask >> j) & 1) sum += b[j];
if (sum == a[0]) f[0][mask] = true;
}
for (int i = 1; i < n; i++)
for (int prev_mask = 0; prev_mask < (1 << m); prev_mask++)
{
if (!f[i - 1][prev_mask]) continue;
for (int mask = 0; mask < (1 << m); mask++)
{
if ((prev_mask & mask) != prev_mask) continue;
int sum = 0;
for (int j = 0; j < m; j++)
if (((mask >> j) & 1) && !((prev_mask >> j) & 1)) sum += b[j];
if (sum == a[i]) f[i][mask] = true;
}
}
bool ans = false;
for (int mask = 0; mask < (1 << m); mask++)
ans |= f[n - 1][mask];
if (ans) cout << "YES";
else cout << "NO";
return 0;
}
/*
*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
380 KB |
Output is correct |
| 2 |
Correct |
2 ms |
376 KB |
Output is correct |
| 3 |
Correct |
2 ms |
376 KB |
Output is correct |
| 4 |
Correct |
4 ms |
504 KB |
Output is correct |
| 5 |
Correct |
75 ms |
416 KB |
Output is correct |
| 6 |
Correct |
2 ms |
376 KB |
Output is correct |
| 7 |
Correct |
2 ms |
376 KB |
Output is correct |
| 8 |
Correct |
76 ms |
1392 KB |
Output is correct |
| 9 |
Correct |
75 ms |
504 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
376 KB |
Output is correct |
| 3 |
Correct |
2 ms |
376 KB |
Output is correct |
| 4 |
Correct |
2 ms |
376 KB |
Output is correct |
| 5 |
Correct |
2 ms |
376 KB |
Output is correct |
| 6 |
Correct |
2 ms |
376 KB |
Output is correct |
| 7 |
Correct |
3 ms |
376 KB |
Output is correct |
| 8 |
Correct |
2 ms |
376 KB |
Output is correct |
| 9 |
Correct |
2 ms |
376 KB |
Output is correct |
| 10 |
Correct |
2 ms |
376 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
376 KB |
Output is correct |
| 2 |
Correct |
3 ms |
376 KB |
Output is correct |
| 3 |
Correct |
4 ms |
376 KB |
Output is correct |
| 4 |
Correct |
3 ms |
376 KB |
Output is correct |
| 5 |
Correct |
4 ms |
376 KB |
Output is correct |
| 6 |
Correct |
3 ms |
376 KB |
Output is correct |
| 7 |
Correct |
4 ms |
376 KB |
Output is correct |
| 8 |
Correct |
4 ms |
376 KB |
Output is correct |
| 9 |
Correct |
4 ms |
376 KB |
Output is correct |
| 10 |
Correct |
4 ms |
376 KB |
Output is correct |
| 11 |
Correct |
4 ms |
376 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
380 KB |
Output is correct |
| 2 |
Correct |
2 ms |
376 KB |
Output is correct |
| 3 |
Correct |
2 ms |
376 KB |
Output is correct |
| 4 |
Correct |
4 ms |
504 KB |
Output is correct |
| 5 |
Correct |
75 ms |
416 KB |
Output is correct |
| 6 |
Correct |
2 ms |
376 KB |
Output is correct |
| 7 |
Correct |
2 ms |
376 KB |
Output is correct |
| 8 |
Correct |
76 ms |
1392 KB |
Output is correct |
| 9 |
Correct |
75 ms |
504 KB |
Output is correct |
| 10 |
Correct |
3 ms |
376 KB |
Output is correct |
| 11 |
Correct |
2 ms |
376 KB |
Output is correct |
| 12 |
Correct |
2 ms |
376 KB |
Output is correct |
| 13 |
Correct |
2 ms |
376 KB |
Output is correct |
| 14 |
Correct |
2 ms |
376 KB |
Output is correct |
| 15 |
Correct |
2 ms |
376 KB |
Output is correct |
| 16 |
Correct |
3 ms |
376 KB |
Output is correct |
| 17 |
Correct |
2 ms |
376 KB |
Output is correct |
| 18 |
Correct |
2 ms |
376 KB |
Output is correct |
| 19 |
Correct |
2 ms |
376 KB |
Output is correct |
| 20 |
Correct |
4 ms |
376 KB |
Output is correct |
| 21 |
Correct |
3 ms |
376 KB |
Output is correct |
| 22 |
Correct |
4 ms |
376 KB |
Output is correct |
| 23 |
Correct |
3 ms |
376 KB |
Output is correct |
| 24 |
Correct |
4 ms |
376 KB |
Output is correct |
| 25 |
Correct |
3 ms |
376 KB |
Output is correct |
| 26 |
Correct |
4 ms |
376 KB |
Output is correct |
| 27 |
Correct |
4 ms |
376 KB |
Output is correct |
| 28 |
Correct |
4 ms |
376 KB |
Output is correct |
| 29 |
Correct |
4 ms |
376 KB |
Output is correct |
| 30 |
Correct |
4 ms |
376 KB |
Output is correct |
| 31 |
Execution timed out |
1070 ms |
1136 KB |
Time limit exceeded |
| 32 |
Halted |
0 ms |
0 KB |
- |
