| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 537889 |
2022-03-15T19:12:13 Z |
nicolexxuu |
Bank (IZhO14_bank) |
C++14 |
|
118 ms |
8540 KB |
//#include <bits/stdc++.h>
//#define MAXN 21
//using namespace std;
//
//int a[MAXN], b[MAXN];
//bool possible[MAXN][1 << MAXN];
//vector<int> combos[MAXN * 1000];
//int N, M;
//
//int main() {
// ios_base::sync_with_stdio(0);
// cin.tie(NULL);
// cin >> N >> 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 i = 0; i < M; i++) {
// if(mask & (1 << i)) sum += b[i];
// }
// combos[sum].push_back(mask);
// }
//
// possible[0][0] = true;
// for(int i = 0; i < N; i++) {
// for(int mask = 1; mask < (1 << M); mask++) {
// for(int combo : combos[a[i]]) {
// if((combo & mask) == combo) possible[i+1][mask] |= possible[i][mask - combo];
// }
// }
// }
//
// bool res = false;
// for(int i = 0; i < (1 << M); i++) res |= possible[N][i];
// if(res) cout << "YES\n";
// else cout << "NO\n";
//}
#include <iostream>
#include <vector>
using std::cout;
using std::endl;
using std::vector;
int main() {
int people_num;
int note_num;
std::cin >> people_num >> note_num;
vector<int> people(people_num);
vector<int> banknotes(note_num);
for (int& p : people) {
std::cin >> p;
}
for (int& b : banknotes) {
std::cin >> b;
}
vector<int> leftover(1 << note_num, -1);
vector<int> people_covered(1 << note_num, -1);
leftover[0] = 0;
people_covered[0] = 0;
for (int s = 0; s < (1 << note_num); s++) {
for (int last = 0; last < note_num; last++) {
if ((s & (1 << last)) == 0) {
continue;
}
int prev = s & ~(1 << last);
if (people_covered[prev] == -1) {
continue;
}
int new_amt = leftover[prev] + banknotes[last];
// the salary of the current person we're going to try to pay
int curr_target = people[people_covered[prev]];
// if it's still not enough, just increment the leftover pile
if (new_amt < curr_target) {
people_covered[s] = people_covered[prev];
leftover[s] = new_amt;
}
/*
* or it's exactly right, in which case reset the leftover count
* and increment the covered amount
*/
else if (new_amt == curr_target) {
people_covered[s] = people_covered[prev] + 1;
leftover[s] = 0;
}
}
// we've covered all the people!
if (people_covered[s] == people_num) {
cout << "YES" << endl;
return 0;
}
}
cout << "NO" << endl;
}
| # |
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 |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
468 KB |
Output is correct |
| 5 |
Correct |
72 ms |
8504 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
0 ms |
212 KB |
Output is correct |
| 8 |
Correct |
4 ms |
8532 KB |
Output is correct |
| 9 |
Correct |
90 ms |
8520 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 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 |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
0 ms |
212 KB |
Output is correct |
| 6 |
Correct |
1 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 |
1 ms |
256 KB |
Output is correct |
| # |
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 |
340 KB |
Output is correct |
| 4 |
Correct |
2 ms |
436 KB |
Output is correct |
| 5 |
Correct |
1 ms |
340 KB |
Output is correct |
| 6 |
Correct |
2 ms |
424 KB |
Output is correct |
| 7 |
Correct |
2 ms |
340 KB |
Output is correct |
| 8 |
Correct |
1 ms |
340 KB |
Output is correct |
| 9 |
Correct |
2 ms |
340 KB |
Output is correct |
| 10 |
Correct |
1 ms |
340 KB |
Output is correct |
| 11 |
Correct |
1 ms |
340 KB |
Output is correct |
| # |
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 |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
468 KB |
Output is correct |
| 5 |
Correct |
72 ms |
8504 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
0 ms |
212 KB |
Output is correct |
| 8 |
Correct |
4 ms |
8532 KB |
Output is correct |
| 9 |
Correct |
90 ms |
8520 KB |
Output is correct |
| 10 |
Correct |
1 ms |
212 KB |
Output is correct |
| 11 |
Correct |
1 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 |
1 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 |
1 ms |
256 KB |
Output is correct |
| 20 |
Correct |
1 ms |
340 KB |
Output is correct |
| 21 |
Correct |
2 ms |
340 KB |
Output is correct |
| 22 |
Correct |
1 ms |
340 KB |
Output is correct |
| 23 |
Correct |
2 ms |
436 KB |
Output is correct |
| 24 |
Correct |
1 ms |
340 KB |
Output is correct |
| 25 |
Correct |
2 ms |
424 KB |
Output is correct |
| 26 |
Correct |
2 ms |
340 KB |
Output is correct |
| 27 |
Correct |
1 ms |
340 KB |
Output is correct |
| 28 |
Correct |
2 ms |
340 KB |
Output is correct |
| 29 |
Correct |
1 ms |
340 KB |
Output is correct |
| 30 |
Correct |
1 ms |
340 KB |
Output is correct |
| 31 |
Correct |
101 ms |
8520 KB |
Output is correct |
| 32 |
Correct |
105 ms |
8504 KB |
Output is correct |
| 33 |
Correct |
92 ms |
8532 KB |
Output is correct |
| 34 |
Correct |
84 ms |
8512 KB |
Output is correct |
| 35 |
Correct |
80 ms |
8504 KB |
Output is correct |
| 36 |
Correct |
74 ms |
8500 KB |
Output is correct |
| 37 |
Correct |
82 ms |
8500 KB |
Output is correct |
| 38 |
Correct |
79 ms |
8500 KB |
Output is correct |
| 39 |
Correct |
4 ms |
8532 KB |
Output is correct |
| 40 |
Correct |
75 ms |
8540 KB |
Output is correct |
| 41 |
Correct |
82 ms |
8500 KB |
Output is correct |
| 42 |
Correct |
118 ms |
8504 KB |
Output is correct |
| 43 |
Correct |
80 ms |
8404 KB |
Output is correct |
| 44 |
Correct |
82 ms |
8404 KB |
Output is correct |
| 45 |
Correct |
4 ms |
8404 KB |
Output is correct |
| 46 |
Correct |
98 ms |
8500 KB |
Output is correct |
| 47 |
Correct |
76 ms |
8504 KB |
Output is correct |
| 48 |
Correct |
6 ms |
8404 KB |
Output is correct |
| 49 |
Correct |
76 ms |
8504 KB |
Output is correct |
| 50 |
Correct |
100 ms |
8504 KB |
Output is correct |
| 51 |
Correct |
74 ms |
8404 KB |
Output is correct |
| 52 |
Correct |
75 ms |
8500 KB |
Output is correct |
| 53 |
Correct |
115 ms |
8500 KB |
Output is correct |
| 54 |
Correct |
107 ms |
8404 KB |
Output is correct |
| 55 |
Correct |
86 ms |
8504 KB |
Output is correct |
| 56 |
Correct |
82 ms |
8404 KB |
Output is correct |
| 57 |
Correct |
85 ms |
8404 KB |
Output is correct |
| 58 |
Correct |
82 ms |
8504 KB |
Output is correct |
