Submission #331492

# Submission time Handle Problem Language Result Execution time Memory
331492 2020-11-28T17:43:32 Z Sho10 Devil's Share (RMI19_devil) C++14
29 / 100
310 ms 7644 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=0;i<=sz;i++)
   {
       viz[sz-i]=2-((i*cnt[1]+cnt[1]-1)%(cnt[1]+cnt[2])<cnt[1]);
   }
   for(ll i=sz;i>=1;i--)
   {
       ans+=(viz[i]+'0');
   }
    reverse(ans.begin(),ans.end());
    cout<<ans<<endl;
}
}

Compilation message

devil.cpp: In function 'int32_t main()':
devil.cpp:49:8: warning: unused variable 'nr' [-Wunused-variable]
   49 |     ll nr=(cnt[2]+cnt[1]-1)/cnt[1];
      |        ^~
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 364 KB Token parameter [name=X] equals to "112", doesn't correspond to pattern "[0-9]{7}"
# Verdict Execution time Memory Grader output
1 Incorrect 44 ms 748 KB Token parameter [name=X] equals to "111112", doesn't correspond to pattern "[0-9]{31}"
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 63 ms 1260 KB Output is correct
2 Correct 61 ms 1644 KB Output is correct
3 Correct 120 ms 5716 KB Output is correct
4 Correct 174 ms 7580 KB Output is correct
5 Correct 310 ms 7644 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 364 KB Token parameter [name=X] equals to "112", doesn't correspond to pattern "[0-9]{7}"