Submission #603986

#	Time	Username	Problem	Language	Result	Execution time	Memory
603986		daisy2	Gondola (IOI14_gondola)	C++14	20 / 100	9 ms	1132 KiB

gondola

#include "gondola.h"
#include <iostream>
using namespace std;
bool b[200005];
int valid(int n, int inputSeq[])
{
    bool is=1;
    int prin=-1;

    for(int i=0;i<n;i++)
    {
        if(b[inputSeq[i]])
        {
            is=0;break;
        }
        b[inputSeq[i]]=1;


        if(inputSeq[i]<=n)
        {
            if(prin!=-1 && ((inputSeq[i]+n-inputSeq[prin])%n!=(i-prin)%n))
            {
                is=0;break;
            }
            prin=i;
        }
    }
  return is;
}

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

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