Submission #1154961

#	Time	Username	Problem	Language	Result	Execution time	Memory
1154961		AlgorithmWarrior	Gondola (IOI14_gondola)	C++20	20 / 100	9 ms	584 KiB

gondola

#include <bits/stdc++.h>
#include "gondola.h"

using namespace std;

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