제출 #379821

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
379821		ponytail	곤돌라 (IOI14_gondola)	C++17	75 / 100	68 ms	4972 KiB

gondola

#include "bits/stdc++.h"
#include "gondola.h"
#define fi first
#define se second
#define pb push_back
using namespace std;
const int MOD = 1e9 + 9; // remember to long long
long long bigmod(int b,int p){
    if(p==0) return 1;
    long long r=bigmod(b,p/2);
    if(p&1) return (((r*r)%MOD)*b)%MOD;
    return (r*r)%MOD;
}
int valid(int n,int inputSeq[]){
    int cnt=0;
    set<int>s;
    for(int i=0;i<n;i++) s.insert(inputSeq[i]);
    for(int i=0;i<n;i++)cnt+=(inputSeq[i]>=1&&inputSeq[i]<=n);
    if(s.size()!=n) return 0;
    if(cnt==0) return 1;
    for(int i=0;i<n;i++){
        if(inputSeq[i]>=1 && inputSeq[i]<=n){
            int now=inputSeq[i];
            for(int j=i;j<i+n;j++){
                if(now!=inputSeq[j%n] && inputSeq[j%n]>=1 && inputSeq[j%n]<=n){
                    return 0;
                }
                now=now%n+1;
            }
            return 1;
        }
    }
}
int replacement(int n,int gondolaSeq[],int replacementSeq[]){
    int cnt=0, maxel=0;
    for(int i=0;i<n;i++){
        cnt+=(gondolaSeq[i]>=1 && gondolaSeq[i]<=n);
        maxel=max(maxel,gondolaSeq[i]);
    }
    int l=maxel-n;
    if(cnt==0){
        pair<int,int>gs[n];
        for(int i=0;i<n;i++) gs[i]={gondolaSeq[i],i};
        sort(gs,gs+n);
        int now=0, ok=n+1;
        int cur[n];
        for(int i=0;i<n;i++)cur[i]=i+1;
        for(int i=0;i<n;i++){
            for(;ok<=gs[i].fi;ok++){
                replacementSeq[now++]=cur[gs[i].se];
                cur[gs[i].se]=ok;
            }
        }
        return l;
    }
    vector<pair<int,int> >v;
    for(int i=0;i<n;i++){
        if(gondolaSeq[i]>n) v.pb({gondolaSeq[i],i});
    }
    sort(v.begin(),v.end());
    int V=v.size();
    int now=0, ok=n+1;
    int cur[n];
    for(int i=0;i<n;i++){
        if(gondolaSeq[i]>=1 && gondolaSeq[i]<=n){
            int now=gondolaSeq[i];
            for(int j=i;j<i+n;j++){
                cur[j%n]=now;
                now=now%n+1;
            }
            break;
        }
    }
    for(int i=0;i<V;i++){
        for(;ok<=v[i].fi;ok++){
            replacementSeq[now++]=cur[v[i].se];
            cur[v[i].se]=ok;
        }
    }
    return l;

}
int chk_special_case(int n,int inputSeq[]){
    set<int>all;
    for(int i=0;i<n;i++)all.insert(inputSeq[i]);
    int tar=1;
    if(all.size()!=n) return 0;
    for(int x:all){
        if(x!=tar) return 0;
        tar++;
    }
    return 1;
}
int countReplacement(int n,int inputSeq[]){
    if(!valid(n,inputSeq)){
        return 0;
    }
    if(chk_special_case(n,inputSeq)){
        return 1;
    }
    int cnt=0;
    for(int i=0;i<n;i++){
        cnt+=(inputSeq[i]>=1 && inputSeq[i]<=n);
    }
    if(cnt==0){
        long long ans=1;
        sort(inputSeq,inputSeq+n);
        int ok=n+1;
        for(int i=0;i<n;i++){
            ans*=bigmod(n-i,inputSeq[i]-ok);
            ans%=MOD;
            ok=inputSeq[i]+1;
        }
        return ans;
    }
    long long ans=1;
    int ok=n+1;
    vector<int>v;
    for(int i=0;i<n;i++){
        if(inputSeq[i]>n) v.pb(inputSeq[i]);
    }
    int V=v.size();
    sort(v.begin(), v.end());
    for(int i=0;i<V;i++){
        ans*=bigmod(V-i,v[i]-ok);
        ans%=MOD;
        ok=v[i]+1;
    }
    return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:19:16: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   19 |     if(s.size()!=n) return 0;
      |        ~~~~~~~~^~~
gondola.cpp: In function 'int chk_special_case(int, int*)':
gondola.cpp:87:18: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   87 |     if(all.size()!=n) return 0;
      |        ~~~~~~~~~~^~~
gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:16:13: warning: control reaches end of non-void function [-Wreturn-type]
   16 |     set<int>s;
      |             ^

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 5 / 5
• Subtask 5: 10 / 10
• Subtask 6: 20 / 20
• Subtask 7: 5 / 5
• Subtask 8: 15 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10