Submission #397841

#	Time	Username	Problem	Language	Result	Execution time	Memory
397841		teehandsome	Gondola (IOI14_gondola)	C++11	60 / 100	33 ms	2336 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define INF 1e9+7
#define all(x) x.begin(),x.end()
using namespace std;
using namespace __gnu_pbds;
using ll=long long;
using pii=pair<int,int>;
using ppi=pair<int,pii>;
using oset=tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>;

template<typename T>
void _print(vector<T> x) {cerr<<"{"; for(auto e:x) cerr<<e<<","; cerr<<"}";}
void _print(pii x) {cerr<<"{"<<x.first<<","<<x.second<<"}";}
template<typename T>
void _print(T x) {cerr<<x;}

void dbg() {cerr<<endl;}
template<typename Head,typename... Tail>
void dbg(Head H,Tail... T) {
    _print(H);
    if(sizeof...(T)) cerr<<",";
    else cerr<<"\"]";
    dbg(T...);
}
#define debug(...) cerr<<"["<<#__VA_ARGS__<<"]:[\"",dbg(__VA_ARGS__)

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int valid(int n, int a[])
{
    vector<int> ar;
    vector<int> pos(n+1,-1);
    for(int i=0;i<n;i++) {
        if(a[i]<=n) pos[a[i]]=i;
        ar.push_back(a[i]);
    }
    sort(all(ar));
    ar.erase(unique(all(ar)),end(ar));
    if(ar.size()!=n) return 0;
    int start=-1;
    for(int i=1;i<=n;i++) {
        if(pos[i]!=-1) {
            start=i; break;
        }
    }
    if(start==-1) return 1;
    for(int i=start+1;i<=n;i++) {
        if(pos[i]==-1) continue;
        if((pos[i]+n-pos[start])%n!=i-start) return 0;
    }
    return 1;
}

//----------------------

int replacement(int n, int a[], int res[])
{

    vector<pii> ar;
    vector<int> org(n);
    vector<int> pos(n+1,-1);
    int startidx=-1,startval=1;
    for(int i=0;i<n;i++) {
        if(a[i]<=n) {
            pos[a[i]]=i;
        }
        else {
            ar.push_back({a[i],i});
        }
    }
    for(int i=1;i<=n;i++) {
        if(pos[i]!=-1) {
            startidx=pos[i],startval=i; break;
        }
    }
    if(startidx==-1) startidx=0;
    for(int i=startidx;i<startidx+n;i++) {

        org[i%n]=startval;
        startval++;
        if(startval>n) startval=1;
    }
//    debug(org);
//    return 0;
    sort(all(ar));
    int cur=n;
    int len=ar.size();
    int sz=0;
    for(int i=0;i<len;i++) {
        while(cur<ar[i].first) {
            res[sz++]=org[ar[i].second];
            org[ar[i].second]=++cur;
        }
    }
    return sz;
}

//----------------------

const int md=1e9+9;
const int mxn=250100;

ll f[mxn];

int countReplacement(int n, int a[])
{
    f[0]=f[1]=1;
    for(int i=2;i<mxn;i++) {
        f[i]=(i*f[i-1])%md;
    }
    vector<int> ar;
    for(int i=0;i<n;i++) {
        if(a[i]<=n) continue;
        ar.push_back(a[i]);
    }
    ar.push_back(n);
    sort(all(ar));
    int len=ar.size();
    ll ans=1;
    for(int i=1;i<len;i++) {
        ans=(ans*f[ar[i]-ar[i-1]-1])%md;
    }
    return int(ans);
}

Compilation message (stderr)

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:43:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   43 |     if(ar.size()!=n) return 0;
      |        ~~~~~~~~~^~~

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