제출 #310719

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
310719		bigDuck	Devil's Share (RMI19_devil)	C++14	0 / 100	73 ms	1528 KiB

devil

#include<bits/stdc++.h>
using namespace std;
#define INIT  ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define mp make_pair
#define pb push_back
#define ft first
#define sc second
#define ll long long
#define pii pair<int, int>
#define count_bits __builtin_popcount
#define int ll







int t, n, m, k, a[300010], q, l, r;
int d[20];
int32_t main(){
INIT
cin>>t;
while(t--){
    cin>>k;
    for(int i=1; i<=9; i++){
        cin>>d[i];
    }
    int dmax=0;
    for(int i=1; i<=9; i++){
    if(d[i]>0){dmax=max(dmax, i);}
    }

    string suf=""; suf.pb('0'+dmax);
    d[dmax]--;
    dmax=0;
    for(int i=9; i>=1; i--){
        if(d[i]>0){dmax=i; break;}
    }

    int sum=0; for(int i=1; i<dmax; i++){if(sum>=d[dmax]){break;} sum+=d[i]; }
    if(sum>=d[dmax]){
        for(int i=1; (i<=dmax) && (d[dmax]>0); i++){
            while( (d[i]>0) && (d[dmax]>0) ){cout<<dmax; d[dmax]--;if(d[i]>0){cout<<i; d[i]--;}  }
        }
    }
    for(int i=1; i<=9; i++){
        for(int j=1; j<=d[i]; j++){cout<<i;}
    }
    if(suf[0]=='0'){cout<<"\n";continue;}
    cout<<suf;    cout<<'\n';
}



return 0;
}

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