oj.uz

답안 #331425

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
331425 2020-11-28T12:48:20 Z Sho10 Devil's Share (RMI19_devil) C++14
0 / 100
 62 ms 1388 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,cnt[10],k,cnt2[10];
string ans="";
ll check(ll nr){
ans="";
ll s1,s2;
s1=nr%10;
ll valhalla;
valhalla=nr/10;
s2=valhalla%10;
ll sum=0;
swap(s1,s2);
for(ll j=s1+1;j<=9;j++)
{
    sum+=cnt[j];
}
if(sum>1){
    return 0;
}
if(sum==1){
for(ll j=s1+1;j<=9;j++)
{
    if(cnt[j]){
        ans+=(j+'0');
    }
}
}
for(ll j=1;j<=9;j++)
{
    cnt2[j]=cnt[j];
}
if(sum==0){
        for(ll j=s1;j>=1;j--)
        {
            if(cnt2[j]){
                ans+=(j+'0');
                cnt2[j]--;
                break;
            }
        }
}
while(cnt2[s1]>=1){
    for(ll j=1;j<=s1;j++)
    {
        if(cnt2[j]){
            cnt2[j]--;
            ans+=(j+'0');
            break;
        }
    }
    ans+=(s1+'0');
    cnt2[s1]--;
}
for(ll i=1;i<s1;i++)
{
    while(cnt2[i]){
        ans+=(i+'0');
        cnt2[i]--;
    }
}
reverse(ans.begin(),ans.end());
for(ll i=0;i<ans.size();i++)
{
    if(i+1<ans.size()){
        ll val=(ans[i]-'0')*10+(ans[i+1]-'0');
        if(val>nr){
            return 0;
        }
    }
}
return 1;
}
int32_t main(){
CODE_START;
cin>>t;
while(t--){
    cin>>k;
    for(ll i=1;i<=9;i++)
    {
        cin>>cnt[i];
    }
    ll res=99;
 for(ll i=9;i>=1;i--){
    if(cnt[i]){
        ll s1=check(i*10+9);
        if(s1==1){
            res=i*10+9;
            break;
        }
    }
 }
    check(res);
    cout<<ans<<endl;
}
}
/*
Subtask 2:
1
2
1 1 2 0 0 0 0 0 0
*/

Compilation message

devil.cpp: In function 'long long int check(long long int)':
devil.cpp:81:13: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 | for(ll i=0;i<ans.size();i++)
      |            ~^~~~~~~~~~~
devil.cpp:83:11: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |     if(i+1<ans.size()){
      |        ~~~^~~~~~~~~~~

Subtask #1
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 364 KB Output isn't correct

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 62 ms 1388 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 47 ms 1296 KB Token parameter [name=X] equals to "222222222222212121212121212", doesn't correspond to pattern "[0-9]{26}"
2 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 364 KB Output isn't correct