Submission #316985

#	Time	Username	Problem	Language	Result	Execution time	Memory
316985		neki	Gondola (IOI14_gondola)	C++14	100 / 100	81 ms	8556 KiB

gondola

#include <bits/stdc++.h>
#include <gondola.h>
#define loop(i, a, b) for(long long i=a;i<b;i++)
#define pool(i, a, b) for(long long i=a-1;i>=b;i--)
#define fore(i, a) for(auto&& i:a)
#define fi first
#define se second
#define ps(a) push_back(a)
#define pb(a) pop_back(a)
#define sc scanf
#define vc vector
#define pa pair<ll, ll>
#define ll long long
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define llmax LLONG_MAX/2
#define llmin -LLONG_MAX/2
using namespace std;
#define mn 200100
#define pa pair<ll, ll>
#define ld long double 
#define k 450

int valid(int n, int inputSeq[]){
    vc<pa> tes;
    map<ll, ll> cnt;loop(i, 0, n) cnt[inputSeq[i]]++;
    fore(v, cnt) if(v.se>1) return 0;
    loop(i, 0, n) if(inputSeq[i]<=n)tes.ps(make_pair(i, inputSeq[i]));
    if(tes.size()==0) return 1;
    ll siz=tes.size();
    loop(i, 0, tes.size()) if((tes[(i+1)%siz].fi-tes[i].fi+n)%n!=(tes[(i+1)%siz].se-tes[i%siz].se+n)%n){
        return 0;
    }
    
    return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]){
    ll zac=1, cnt=0;
    map<ll, ll> poi;
    loop(i, 0, n){ 
        if(gondolaSeq[i]<=n) zac=(gondolaSeq[i]-i+n)%n;
        else poi[gondolaSeq[i]]=i;
    }
    if(poi.size()==0) return 0;
    vc<ll> cur(n, 0);
    loop(i, 0, n){
        cur[i]=(zac+i)%n;
        if(cur[i]==0) cur[i]=n;
    }
    loop(j, n+1, poi.begin()->fi+1) replacementSeq[cnt++]=cur[poi.begin()->se], cur[poi.begin()->se]=j;
    for(auto v=poi.begin();v!=poi.end();++v){
        auto ne=v; ++ne;
        if(ne==poi.end()) break;
        loop(j, v->fi+1, ne->fi+1) replacementSeq[cnt++]=cur[ne->se], cur[ne->se]=j;
    }
    auto bac=poi.end();bac--;
    return cnt;
}
ll mod=1000000009;
ll pot(ll ba, ll ex){
    ba%=mod;
    ll ret=1;
    while(ex){
        if(ex&1) ret*=ba;
        ba*=ba;
        ex/=2;
        ret%=mod;
        ba%=mod;
    }
    return ret;
}
int countReplacement(int n, int inputSeq[]){
    if(!valid(n, inputSeq)) return 0;
    ll ans=1;
    vc<ll> srt;
    loop(i, 0, n) if(inputSeq[i]>n) srt.ps(inputSeq[i]);
    if(srt.size()==0) return 1;
    srt.ps(n);
    sort(all(srt));
    loop(i, 0, srt.size())srt[i]-=n+i;
    ll siz=(ll)srt.size();
    loop(i, 1, (ll)srt.size()){
        if(srt[i]-srt[i-1]) ans*=pot(siz-i, srt[i]-srt[i-1]);
        ans%=mod;
    }
    if(srt.size()==n+1) ans*=n;
    return ans%mod;
}

Compilation message (stderr)

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:3:42: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    3 | #define loop(i, a, b) for(long long i=a;i<b;i++)
......
   32 |     loop(i, 0, tes.size()) if((tes[(i+1)%siz].fi-tes[i].fi+n)%n!=(tes[(i+1)%siz].se-tes[i%siz].se+n)%n){
      |          ~~~~~~~~~~~~~~~~                 
gondola.cpp:32:5: note: in expansion of macro 'loop'
   32 |     loop(i, 0, tes.size()) if((tes[(i+1)%siz].fi-tes[i].fi+n)%n!=(tes[(i+1)%siz].se-tes[i%siz].se+n)%n){
      |     ^~~~
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:3:42: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    3 | #define loop(i, a, b) for(long long i=a;i<b;i++)
......
   81 |     loop(i, 0, srt.size())srt[i]-=n+i;
      |          ~~~~~~~~~~~~~~~~                 
gondola.cpp:81:5: note: in expansion of macro 'loop'
   81 |     loop(i, 0, srt.size())srt[i]-=n+i;
      |     ^~~~
gondola.cpp:87:18: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   87 |     if(srt.size()==n+1) ans*=n;
      |        ~~~~~~~~~~^~~~~

• 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: 15 / 15
• Subtask 10: 10 / 10