Submission #331430

# Submission time Handle Problem Language Result Execution time Memory
331430 2020-11-28T13:13:30 Z Sho10 Devil's Share (RMI19_devil) C++14
0 / 100
78 ms 1388 KB
#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[25],k;
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);
        }
    }
    ans+=(mx+'0');
     cnt[mx]--;
    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++)
    {
        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++)
    {
      for(ll j=1;j<=cnt[i];j++)
      {
          cout<<i;
      }
    }
    cout<<ans<<endl;
}
}
/*
Subtask 2:
1
2
1 1 2 0 0 0 0 0 0
*/
# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 364 KB Output isn't correct
# Verdict Execution time Memory Grader output
1 Incorrect 78 ms 1388 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 65 ms 1260 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 364 KB Output isn't correct