Submission #31164

#	Time	Username	Problem	Language	Result	Execution time	Memory
31164		cscandkswon	Gondola (IOI14_gondola)	C++14	20 / 100	26 ms	3776 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
const int MAXN=100000;

int init[MAXN];

int valid(int n, int inputSeq[]){
    int i, x=-1;
    for(i=0; i<n; i++)if(inputSeq[i]<=n){
        x=(i-inputSeq[i]+1+n)%n;
        break;
    }
    if(x==-1) x=0;
    for(i=0; i<n; i++, x=(x+1)%n) init[x]=i+1;
    for(i=0; i<n; i++) if(inputSeq[i]<=n&&inputSeq[i]!=init[i]) return 0;
    sort(inputSeq, inputSeq+n);
    for(i=1; i<n; i++) if(inputSeq[i-1]==inputSeq[i]) return 0;
    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