Submission #331483

#TimeUsernameProblemLanguageResultExecution timeMemory
331483Sho10Devil's Share (RMI19_devil)C++14
0 / 100
74 ms1772 KiB
#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,k,cnt[10]; map<ll,ll>viz; int32_t main(){ CODE_START; cin>>t; while(t--){ cin>>k; for(ll i=1;i<=9;i++){ cin>>cnt[i]; } if(cnt[2]<k){ for(ll i=1;i<=2;i++) { for(ll j=1;j<=cnt[i];j++) { cout<<i; } } cout<<endl; continue; } string ans=""; for(ll i=1;i<k;i++) { ans+=(2+'0'); } cnt[2]-=k-1; ll sz=cnt[1]+cnt[2]; ll nr=(cnt[2]+cnt[1]-1)/cnt[1]; viz.clear(); for(ll i=1;i<=nr;i++) { for(ll j=i;j<=sz;j+=k){ if(cnt[2]){ viz[j]=1; cnt[2]--; } } } for(ll i=sz;i>=1;i--) { if(viz[i]==1){ ans+=(2+'0'); }else ans+=(1+'0'); } reverse(ans.begin(),ans.end()); cout<<ans<<endl; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...