Submission #408631

#	Time	Username	Problem	Language	Result	Execution time	Memory
408631		atoiz	Devil's Share (RMI19_devil)	C++14	100 / 100	90 ms	3772 KiB

devil

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>

using namespace std;

int main(int argc, char const *argv[])
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int t;
	cin >> t;
	while (t--) {
		int K;
		cin >> K;
		vector<pair<string, int>> vec(9);
		for (int i = 0; i < 9; ++i) {
			cin >> vec[i].second;
			vec[i].first = '1' + i;
		}

		string suffix = "";
		while ((int) suffix.size() < K - 1) {
			if (vec.back().second > K - 1 - (int) suffix.size()) {
				vec.back().second -= K - 1 - (int) suffix.size();
				suffix = string(K - 1 - (int) suffix.size(), vec.back().first[0]) + suffix;
			} else {
				suffix = string(vec.back().second, vec.back().first[0]) + suffix;
				vec.pop_back();
			}
		}

		while (vec.back().second == 0) vec.pop_back();
		for (int i = 0; i < (int) vec.size() - 1; ++i) {
			if (vec[i].second == 0) continue;
			if (vec[i].second < vec.back().second) {
				auto last = vec.back();
				vec.back().first += vec[i].first;
				vec.back().second = vec[i].second;
				vec.push_back(last);
				vec.back().second -= vec[i].second;
			} else {
				vec.back().first += vec[i].first;
				vec[i].second -= vec.back().second;
				if (vec[i].second > 0) --i;
			}
		}

		for (int i = 0; i < (int) vec.back().second; ++i) {
			cout << vec.back().first;
		}
		cout << suffix << '\n';
    }
}

• Subtask 1: 13 / 13
• Subtask 2: 14 / 14
• Subtask 3: 29 / 29
• Subtask 4: 44 / 44