Submission #331466

#	Time	Username	Problem	Language	Result	Execution time	Memory
331466		Sho10	Devil's Share (RMI19_devil)	C++14	13 / 100	1583 ms	492 KiB

devil

#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];
    }
    ll pos=4;
    ll sum=0;
    for(ll i=4;i>=1;i--)
    {
     sum+=cnt[i];
     if(sum>=k){
        solve(i,1);
        break;
     }
    }
 cout<<ans<<endl;
}
}

Compilation message (stderr)

devil.cpp: In function 'void solve(int, int)':
devil.cpp:34:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 | for(int i=0;i<s.size()-k+1;i++)
      |             ~^~~~~~~~~~~~~
devil.cpp: In function 'int32_t main()':
devil.cpp:73:8: warning: unused variable 'pos' [-Wunused-variable]
   73 |     ll pos=4;
      |        ^~~

• Subtask 1: 13 / 13
• Subtask 2: 0 / 14
• Subtask 3: 0 / 29
• Subtask 4: 0 / 44