#include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
#define uint unsigned int
using namespace std;
int main() {
#ifdef HOME
ifstream cin("A.in");
ofstream cout("A.out");
#endif
int t, i, k;
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
cin >> t;
while(t--) {
cin >> k;
vector <int> num(10);
for(i = 1; i <= 9; i++) {
cin >> num[i];
}
string b;
int cur = 0;
for(i = 9; i >= 1; i--) {
while(num[i] > 0 && cur < k - 1) {
cur++;
b.push_back(i + '0');
num[i]--;
}
}
reverse(b.begin(), b.end());
vector <string> a;
for(i = 9; i >= 1; i--) {
if(num[i]) {
a.resize(num[i], string(1, i + '0'));
num[i] = 0;
break;
}
}
int sz = a.size(), pos = (int)a.size() - 1;
int dig = 1, last = 10;
while(dig < 10) {
while(dig < 10 && num[dig] == 0) {
dig++;
}
if(dig < 10) {
if(last < dig) {
sz = pos + 1;
}
last = dig;
num[dig]--;
a[pos].push_back(dig + '0');
pos = (pos == 0 ? sz - 1 : pos - 1);
}
}
for(auto &it : a) {
cout << it;
//cerr << it;
}
cout << b << "\n";
//cerr << b << "\n";
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
7 ms |
376 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
64 ms |
2040 KB |
Output is correct |
2 |
Correct |
51 ms |
1784 KB |
Output is correct |
3 |
Correct |
48 ms |
1784 KB |
Output is correct |
4 |
Correct |
69 ms |
2168 KB |
Output is correct |
5 |
Correct |
26 ms |
1400 KB |
Output is correct |
6 |
Correct |
25 ms |
1272 KB |
Output is correct |
7 |
Correct |
22 ms |
1272 KB |
Output is correct |
8 |
Correct |
21 ms |
1400 KB |
Output is correct |
9 |
Correct |
21 ms |
1888 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
51 ms |
1788 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
7 ms |
376 KB |
Output isn't correct |