oj.uz

답안 #498262

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
498262 2021-12-24T17:39:41 Z couplefire Devil's Share (RMI19_devil) C++17
100 / 100
 155 ms 5184 KB 
#include <bits/stdc++.h>
using namespace std;

int K, c[10];
vector<string> s;
deque<string> d;

string solve() {
	string X = "";
	int idx = s.size()-1;
	while(!d.empty()) {
		string cur = d.front(); d.pop_front();
		s[idx] += cur;
		if(idx != 0 && (d.empty() || cur != d.front())) {
			while((int)s.size() > idx) {
				d.push_back(s.back());
				s.pop_back();
			}
		}
		idx--;
		if(idx == -1) idx = s.size()-1;
	}
	for(auto x : s) X += x;
	return X;
}

int main() {
	cin.tie(0)->sync_with_stdio(0);
	int T; cin >> T;
	while(T--) {
		s.clear(); d.clear();
		cin >> K;
		for(int i = 1; i <= 9; i++) cin >> c[i];
		string suffix = ""; 
		int cif = 9;
		for(int i = 0; i < K-1; i++) {
			while(c[cif] == 0) cif--;
			suffix += cif+'0';
			c[cif]--;
		}
		while(c[cif] == 0) cif--;
		while(c[cif]) s.push_back(string(1, cif+'0')), c[cif]--;
		for(int i = 1; i <= 9; i++) {
			while(c[i]) {
				d.push_back(string(1, i+'0'));
				c[i]--;
			}
		}
		string x = solve();
		reverse(suffix.begin(), suffix.end());
		cout << x + suffix << endl;
	}
}

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 332 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 117 ms 1964 KB Output is correct
2 Correct 89 ms 1720 KB Output is correct
3 Correct 78 ms 1720 KB Output is correct
4 Correct 116 ms 2020 KB Output is correct
5 Correct 48 ms 1412 KB Output is correct
6 Correct 42 ms 1400 KB Output is correct
7 Correct 42 ms 1316 KB Output is correct
8 Correct 36 ms 1656 KB Output is correct
9 Correct 36 ms 4524 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 72 ms 1736 KB Output is correct
2 Correct 45 ms 1516 KB Output is correct
3 Correct 24 ms 4400 KB Output is correct
4 Correct 39 ms 4636 KB Output is correct
5 Correct 66 ms 4724 KB Output is correct

Subtask #4
44.0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 332 KB Output is correct
2 Correct 117 ms 1964 KB Output is correct
3 Correct 89 ms 1720 KB Output is correct
4 Correct 78 ms 1720 KB Output is correct
5 Correct 116 ms 2020 KB Output is correct
6 Correct 48 ms 1412 KB Output is correct
7 Correct 42 ms 1400 KB Output is correct
8 Correct 42 ms 1316 KB Output is correct
9 Correct 36 ms 1656 KB Output is correct
10 Correct 36 ms 4524 KB Output is correct
11 Correct 72 ms 1736 KB Output is correct
12 Correct 45 ms 1516 KB Output is correct
13 Correct 24 ms 4400 KB Output is correct
14 Correct 39 ms 4636 KB Output is correct
15 Correct 66 ms 4724 KB Output is correct
16 Correct 109 ms 1920 KB Output is correct
17 Correct 110 ms 2108 KB Output is correct
18 Correct 114 ms 1844 KB Output is correct
19 Correct 155 ms 2644 KB Output is correct
20 Correct 28 ms 1448 KB Output is correct
21 Correct 25 ms 1308 KB Output is correct
22 Correct 28 ms 1668 KB Output is correct
23 Correct 35 ms 5184 KB Output is correct