Submission #307735

#	Time	Username	Problem	Language	Result	Execution time	Memory
307735		juggernaut	곤돌라 (IOI14_gondola)	C++14	20 / 100	13 ms	768 KiB

gondola

#include"gondola.h"
#include<bits/stdc++.h>
//#include"grader.cpp"
using namespace std;
bool vis[250005];
int valid(int n,int a[]){
    int i=0,need;
    while(i<n&&a[i]>n){
        if(vis[a[i]])return 0;
        vis[a[i]]=1;
        i++;
    }
    if(i==n)return 1;
    need=a[i];
    while(i<n){
        if(vis[a[i]])return 0;
        vis[a[i]]=1;
        if(a[i]<=n&&a[i]!=need)return 0;
        if(need==n)need=1;
        else need++;
        i++;
    }
    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