# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
338020 | Nimbostratus | Devil's Share (RMI19_devil) | C++17 | 1588 ms | 620 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>
using namespace std;
typedef long long ll;
const ll INF = 1e15;
int TC;
int K,cnt[15];
int32_t main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
//freopen("in","r",stdin);
//freopen("out","w",stdout);
cin >> TC;
while(TC--)
{
string perm,str;
ll mn = INF;
cin >> K;
for(int i=1;i<=9;i++) cin >> cnt[i];
for(int i=1;i<=9;i++)
for(int j=1;j<=cnt[i];j++)
perm += char('0' + i);
do
{
ll cur = 0;
for(int i=0;i+K-1<perm.size();i++)
cur = max(cur,stoll(perm.substr(i,K)));
if(mn > cur)
{
mn = cur;
str = perm;
}
}
while(next_permutation(perm.begin(),perm.end()));
cout << str << 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... |