# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
331418 | 2020-11-28T12:15:47 Z | Sho10 | Devil's Share (RMI19_devil) | C++14 | 42 ms | 2028 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[10],k; int32_t main(){ CODE_START; cin>>t; while(t--){ cin>>k; ll sum=0,s1=0; for(ll i=1;i<=9;i++) { cin>>cnt[i]; sum+=cnt[i]; } string ans=""; for(ll i=9;i>=1;i--) { if(cnt[i]){ for(ll j=1;j<cnt[i];j++) { ans+=(i+'0'); for(ll k=1;k<=i;k++) { if(cnt[k]){ ans+=(k+'0'); cnt[k]--; break; } } } ans+=(i+'0'); cnt[i]=0; break; } } reverse(ans.begin(),ans.end()); for(ll i=1;i<=9;i++) { while(cnt[i]){ ans+=(i+'0'); cnt[i]--; } } reverse(ans.begin(),ans.end()); cout<<ans<<endl; } } /* Subtask 2: 1 2 1 1 2 0 0 0 0 0 0 */
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 364 KB | Output isn't correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 42 ms | 2028 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 32 ms | 1900 KB | Token parameter [name=X] equals to "212121212121212222222222222", doesn't correspond to pattern "[0-9]{26}" |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 364 KB | Output isn't correct |