oj.uz

Submission #331433

# Submission time Handle Problem Language Result Execution time Memory
331433 2020-11-28T13:20:34 Z Sho10 Devil's Share (RMI19_devil) C++14
14 / 100
 82 ms 2176 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];
    }
    ll mx=0;
    for(ll i=1;i<=9;i++){
    if(cnt[i]>0){mx=i;}
    }

    string ans="";
    ans.pb('0'+mx);
    cnt[mx]--;
    mx=0;
    for(ll i=9; i>=1; i--){
        if(cnt[i]>0){
                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]>0);i++){
            while((cnt[i]>0)&&(cnt[mx]>0)){
                    cout<<mx;
            cnt[mx]--;
            if(cnt[i]>0)
                {cout<<i;
            cnt[i]--;
            }
            }
        }
    }
 for(ll i=9;i>=1;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
*/

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 364 KB Output isn't correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 1388 KB Output is correct
2 Correct 63 ms 1772 KB Output is correct
3 Correct 63 ms 1792 KB Output is correct
4 Correct 79 ms 2176 KB Output is correct
5 Correct 45 ms 1388 KB Output is correct
6 Correct 46 ms 1388 KB Output is correct
7 Correct 47 ms 1388 KB Output is correct
8 Correct 46 ms 1260 KB Output is correct
9 Correct 45 ms 1260 KB Output is correct

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 60 ms 1260 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 364 KB Output isn't correct