이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long
#define double long double
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000007
#define PI 3.14159265359
#define MAXN 100005
#define INF 1000000005
#define LINF 1000000000000000005ll
#define CODE_START ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll t,cnt[10],k,cnt2[10];
int32_t main(){
CODE_START;
cin>>t;
while(t--){
cin>>k;
for(ll i=1;i<=9;i++)
{
cin>>cnt[i];
}
string ans="";
ll mx=0;
for(ll i=1;i<=9;i++)
{
if(cnt[i]){
mx=max(mx,i);
}
}
cnt[mx]--;
ans+=(mx+'0');
mx=0;
for(ll i=9;i>=1;i--)
{
if(cnt[i]){
mx=i;
break;
}
}
ll sum=0;
for(ll i=1;i<mx;i++)
{
if(sum>=cnt[mx]){
break;
}
sum+=cnt[i];
}
if(sum>=cnt[mx]){
for(ll i=1;i<mx&&cnt[mx];i++)
{
while(cnt[i]&&cnt[mx]){
cout<<mx;
cnt[mx]--;
if(cnt[i]){
cout<<i;
cnt[i]--;
}
}
}
}
for(ll i=1;i<=9;i++)
{
while(cnt[i]){
cout<<i;
cnt[i]--;
}
}
cout<<ans<<endl;
}
}
/*
Subtask 2:
1
2
1 1 2 0 0 0 0 0 0
*/
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |