oj.uz

Submission #310723

# Submission time Handle Problem Language Result Execution time Memory
310723 2020-10-07T17:16:54 Z bigDuck Devil's Share (RMI19_devil) C++14
14 / 100
 76 ms 2040 KB 
#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;
    //if(k==0){cout<<"\n"; continue;}
    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=9; i>=1; i--){
        for(int j=1; j<=d[i]; j++){cout<<i;}
    }

    cout<<suf;    cout<<'\n';
}



return 0;
}

Subtask #1
0 / 13.0

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 1400 KB Output is correct
2 Correct 59 ms 1784 KB Output is correct
3 Correct 61 ms 1784 KB Output is correct
4 Correct 76 ms 2040 KB Output is correct
5 Correct 45 ms 1400 KB Output is correct
6 Correct 42 ms 1276 KB Output is correct
7 Correct 42 ms 1400 KB Output is correct
8 Correct 43 ms 1276 KB Output is correct
9 Correct 42 ms 1272 KB Output is correct

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 62 ms 1272 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 384 KB Output isn't correct