Submission #422182

#	Time	Username	Problem	Language	Result	Execution time	Memory
422182		APROHACK	Gondola (IOI14_gondola)	C++14	20 / 100	12 ms	844 KiB

gondola

#include "gondola.h"

int valid(int n, int inputSeq[])
{
  bool ocurr[250001];
  for(int i = 0 ; i < 250001 ; i++){
    ocurr[i]=false;
  }
  //bool pst=false;
  int cur=-1;
  for(int i = 0 ; i < n ; i++){
    if(ocurr[inputSeq[i]]){
      return 0;
    }
    ocurr[inputSeq[i]]=true;
    if(inputSeq[i]<=n){
      if(cur==-1){
        cur=inputSeq[i];
      }else{
        if(inputSeq[i]!=cur)return 0;
      }
    }
    if(cur!=-1)cur++;
    if(cur==n+1)cur=1;
  }
  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