oj.uz

Submission #972229

# Submission time Handle Problem Language Result Execution time Memory
972229 2024-04-30T09:01:36 Z hihihihaw Bank (IZhO14_bank) C++17
100 / 100
 113 ms 8888 KB 
#include <iostream>
#include <vector>

using std::cout;
using std::endl;
using std::vector;

int main() {
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
	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++) {
        int y=0;
		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;
                y|=1;
			}
			/*
			 * 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;
                y|=2;
			}
		}
        if (y==3){
            cout<<s<<endl;
            cout<<-1<<endl;
        }
		// we've covered all the people!
		if (people_covered[s] == people_num) {
			cout << "YES" << endl;
			return 0;
		}
	}
	cout << "NO" << endl;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 76 ms 8792 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 3 ms 8540 KB Output is correct
9 Correct 78 ms 8540 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 76 ms 8792 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 3 ms 8540 KB Output is correct
9 Correct 78 ms 8540 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 440 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 436 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 2 ms 344 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 2 ms 348 KB Output is correct
31 Correct 100 ms 8540 KB Output is correct
32 Correct 97 ms 8640 KB Output is correct
33 Correct 86 ms 8640 KB Output is correct
34 Correct 77 ms 8888 KB Output is correct
35 Correct 81 ms 8536 KB Output is correct
36 Correct 80 ms 8536 KB Output is correct
37 Correct 77 ms 8540 KB Output is correct
38 Correct 75 ms 8784 KB Output is correct
39 Correct 4 ms 8536 KB Output is correct
40 Correct 76 ms 8540 KB Output is correct
41 Correct 78 ms 8540 KB Output is correct
42 Correct 113 ms 8636 KB Output is correct
43 Correct 78 ms 8540 KB Output is correct
44 Correct 76 ms 8536 KB Output is correct
45 Correct 4 ms 8536 KB Output is correct
46 Correct 97 ms 8644 KB Output is correct
47 Correct 77 ms 8636 KB Output is correct
48 Correct 4 ms 8536 KB Output is correct
49 Correct 79 ms 8788 KB Output is correct
50 Correct 85 ms 8536 KB Output is correct
51 Correct 78 ms 8540 KB Output is correct
52 Correct 85 ms 8540 KB Output is correct
53 Correct 95 ms 8640 KB Output is correct
54 Correct 93 ms 8796 KB Output is correct
55 Correct 84 ms 8536 KB Output is correct
56 Correct 85 ms 8540 KB Output is correct
57 Correct 83 ms 8540 KB Output is correct
58 Correct 82 ms 8636 KB Output is correct