Submission #746129

#	Time	Username	Problem	Language	Result	Execution time	Memory
746129		Username4132	Gondola (IOI14_gondola)	C++14	20 / 100	13 ms	1236 KiB

gondola

#include "gondola.h"
#include<algorithm>
using namespace std;
#define forn(i, n) for(int i=0; i<(int)n; ++i)

const int MAXN=250010;
bool seen[MAXN];

int valid(int n, int inputSeq[])
{

  forn(i, n){
    if(seen[inputSeq[i]]) return 0;
    seen[inputSeq[i]]=true;
  }

  auto itr=min_element(inputSeq, inputSeq+n);
  if(*itr>=n) return 1;
  auto tmp=itr, last=itr;
  while(true){
    if(*tmp<=n){
      int d1=*tmp-*last, d2=tmp-last;
      if(d2<0) d2+=n;
      if(d1!=d2) return 0;
      last=tmp;
    }
    tmp++;
    if(tmp==inputSeq+n) tmp=inputSeq;
    if(tmp==itr) break;
  }
  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