Submission #1303904

#	Time	Username	Problem	Language	Result	Execution time	Memory
1303904		mlecio	Gondola (IOI14_gondola)	C++20	5 / 100	2 ms	348 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
int N;
int valid(int n,int inputSeq[]){
N=n;
int ind=-1;
int mini=1e9;
for(int i=0;i<N;i++){
    if(mini>inputSeq[i]){
        ind=i;
        mini=inputSeq[i];
    }
}
if(mini>=n)
return 1;
for(int i=0;i<N;i++){
    if(i<ind){
        if(inputSeq[i]>n)
        continue;
        else if(inputSeq[i]==i+1+mini)
        continue;
        else
        return 0;
    }
    if(i>=ind){
        if(inputSeq[i]>n)
        continue;
        else if(inputSeq[i]==i-ind+mini)
        continue;
        else 
        return 0;
    }
}
    return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]){
    return 1;
}

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

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