Submission #1214579

#	Time	Username	Problem	Language	Result	Execution time	Memory
1214579		BoggyMan	Bank (IZhO14_bank)	C++20	100 / 100	107 ms	8640 KiB

bank

#include <iostream>
#include <vector>
#include <bits/stdc++.h>
#include <algorithm>   // for std::shuffle
#include <random>      // for std::random_device, std::mt19937
#include <iostream>
#include <vector>
using std::cout;
using std::endl;
using std::vector;

bool comp( const int & a , const int & b){
        return a > b;
}
int main() {
	int people_num;
	int note_num;
    std::random_device rd;                // non-deterministic seed source
    std::mt19937       gen(rd());         // Mersenne Twister engine

	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; }
    //sort(people.begin(), people.end(),comp  );
    std::shuffle(people.begin(), people.end(), gen);
   // for( auto & g: people)cout << g<<" ";cout<<endl;
	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;
}

• Subtask 1: 19 / 19
• Subtask 2: 25 / 25
• Subtask 3: 27 / 27
• Subtask 4: 29 / 29