# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
272386 | 2020-08-18T11:38:06 Z | AKaan37 | Devil's Share (RMI19_devil) | C++17 | 159 ms | 1308 KB |
//Bismillahirrahmanirrahim //█▀█─█──█──█▀█─█─█ //█▄█─█──█──█▄█─█▄█ //█─█─█▄─█▄─█─█─█─█ #include <bits/stdc++.h> using namespace std; typedef long long lo; typedef pair< lo,lo > PII; #define fi first #define se second #define mp make_pair #define endl "\n" #define pb push_back #define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL) #define FOR for(int i=1;i<=n;i++) #define mid ((start+end)/2) #define ort ((bas+son)/2) const lo inf = 1000000000000000000; const lo KOK = 100000; const lo LOG = 30; const lo li = 500005; const lo mod = 1000000007; int n,m,b[li],a[li],k,flag,t; int cev; string s; vector<int> v; int main(void){ //~ freopen("at.txt","r",stdin); //~ freopen("att.txt","w",stdout); scanf("%d",&t); while(t--){ scanf("%d",&n); for(int i=1;i<=9;i++){ scanf("%d",&a[i]); } int bas=1; int son=9; while(a[son]==0 && son>=1)son--; int sira=0; cev=0; flag=0; for(int i=1;i<=son;i++){ cev+=a[i]; if(cev>=a[son]){if(a[i]==1 && cev+a[son]>=n)flag=1;bas=i;break;} } //~ cout<<bas<<endl; if(flag){ int eskison=son; while(son>=eskison){ //~ cout<<son<<endl; if(a[son]==0)break; if(sira%2){ while(a[son]==0 && son>=eskison)son--; if(son<eskison)break; printf("%d",son); a[son]--; } else{ while(a[bas]==0 && bas>0)bas--; //~ if(bas<0)break; printf("%d",bas); a[bas]--; } sira++; } bas=1; while(bas<=9){ while(a[bas]){printf("%d",bas);a[bas]--;} bas++; } printf("\n"); } else{ int eskison=son; while(son>=eskison){ //~ cout<<son<<endl; if(a[son]==0)break; if(sira%2==0){ while(a[son]==0 && son>=eskison)son--; if(son<eskison)break; printf("%d",son); a[son]--; } else{ while(a[bas]==0 && bas>0)bas--; //~ if(bas<0)break; printf("%d",bas); a[bas]--; } sira++; } bas=1; while(bas<=9){ while(a[bas]){printf("%d",bas);a[bas]--;} bas++; } printf("\n"); } } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 384 KB | Output isn't correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 159 ms | 1308 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 126 ms | 1272 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 384 KB | Output isn't correct |