oj.uz

Submission #331488

# Submission time Handle Problem Language Result Execution time Memory
331488 2020-11-28T17:38:03 Z Sho10 Devil's Share (RMI19_devil) C++14
0 / 100
 79 ms 1532 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,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<=sz;i++)
   {
       if(cnt[2]==0){
        break;
       }
       for(ll j=1;j<=nr;j++)
       {
           if((i-j)%k==0){
viz[i]=1;
cnt[2]--;
break;
           }
       }
   }
    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;
}
}

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 492 KB Execution killed with signal 8 (could be triggered by violating memory limits)

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 492 KB Execution killed with signal 8 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 79 ms 1532 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 492 KB Execution killed with signal 8 (could be triggered by violating memory limits)