oj.uz

Submission #485625

# Submission time Handle Problem Language Result Execution time Memory
485625 2021-11-08T15:41:06 Z keertan Bank (IZhO14_bank) C++17
100 / 100
 122 ms 8524 KB 
#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++) {
        bool ok=0;
        int valo=-1;
		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) {
                if (valo==-1){valo= new_amt;}
                else if (valo!= new_amt){cout<<"fuck";}
				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;
}

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:26:14: warning: unused variable 'ok' [-Wunused-variable]
   26 |         bool ok=0;
      |              ^~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 460 KB Output is correct
5 Correct 74 ms 8492 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 4 ms 8396 KB Output is correct
9 Correct 86 ms 8496 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 460 KB Output is correct
5 Correct 74 ms 8492 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 4 ms 8396 KB Output is correct
9 Correct 86 ms 8496 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 2 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 103 ms 8500 KB Output is correct
32 Correct 111 ms 8492 KB Output is correct
33 Correct 82 ms 8496 KB Output is correct
34 Correct 72 ms 8396 KB Output is correct
35 Correct 73 ms 8496 KB Output is correct
36 Correct 76 ms 8492 KB Output is correct
37 Correct 72 ms 8396 KB Output is correct
38 Correct 74 ms 8500 KB Output is correct
39 Correct 4 ms 8524 KB Output is correct
40 Correct 73 ms 8492 KB Output is correct
41 Correct 76 ms 8492 KB Output is correct
42 Correct 122 ms 8516 KB Output is correct
43 Correct 77 ms 8496 KB Output is correct
44 Correct 72 ms 8396 KB Output is correct
45 Correct 5 ms 8524 KB Output is correct
46 Correct 97 ms 8396 KB Output is correct
47 Correct 72 ms 8460 KB Output is correct
48 Correct 5 ms 8504 KB Output is correct
49 Correct 75 ms 8496 KB Output is correct
50 Correct 84 ms 8516 KB Output is correct
51 Correct 73 ms 8496 KB Output is correct
52 Correct 78 ms 8516 KB Output is correct
53 Correct 108 ms 8396 KB Output is correct
54 Correct 96 ms 8396 KB Output is correct
55 Correct 85 ms 8396 KB Output is correct
56 Correct 82 ms 8396 KB Output is correct
57 Correct 84 ms 8500 KB Output is correct
58 Correct 84 ms 8396 KB Output is correct