Submission #962648

#	Time	Username	Problem	Language	Result	Execution time	Memory
962648		hirayuu_oj	Gondola (IOI14_gondola)	C++17	20 / 100	9 ms	1224 KiB

gondola

#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(x) x.begin(),x.end()
using ll=long long;
const ll MOD=1000000009;

ll safe_mod(ll n,ll p){
    n%=p;
    if(n<0)n+=p;
    return n;
}
int valid(int n, int inputSeq[]){
    int fix=MOD;
    rep(i,n){
        if(inputSeq[i]<=n){
            if(fix==MOD)fix=safe_mod(i-inputSeq[i],n);
            else{
                if(fix!=safe_mod(i-inputSeq[i],n)){
                    return 0;
                }
            }
        }
    }
    vector<bool> cnt(300000);
    rep(i,n){
        if(cnt[inputSeq[i]])return 0;
        cnt[inputSeq[i]]=1;
    }
    return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[]){
    return -2;
}

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

int countReplacement(int n, int inputSeq[]){
    return -3;
}

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