# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
331464 | Sho10 | Devil's Share (RMI19_devil) | C++14 | 1575 ms | 492 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
int t,cnt[10],k,sz=0;
string ans="";
string s="";
string mn="";
void solve(int nr,int pos){
s+=(nr+'0');
cnt[nr]--;
if(pos==sz){
string mx="";
for(int i=1;i<=k;i++)
{
mx+='1';
}
for(int i=0;i<s.size()-k+1;i++)
{
string x=s.substr(i,k);
mx=max(mx,x);
}
if(mx<mn){
ans=s;
mn=mx;
}
cnt[nr]++;
s.pop_back();
return;
}
for(int i=1;i<=4;i++)
{
if(cnt[i]){
solve(i,pos+1);
}
}
cnt[nr]++;
s.pop_back();
return;
}
int32_t main(){
CODE_START;
cin>>t;
while(t--){
cin>>k;
mn="";
for(int i=1;i<=k;i++)
{
mn+='9';
}
sz=0;
for(int i=1;i<=9;i++)
{
cin>>cnt[i];
sz+=cnt[i];
}
s="";
for(int i=4;i>=1;i--)
{
if(cnt[i]){
solve(i,1);
break;
}
}
cout<<ans<<endl;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |