Submission #1064614

#	Time	Username	Problem	Language	Result	Execution time	Memory
1064614		NemanjaSo2005	Gondola (IOI14_gondola)	C++17	10 / 100	7 ms	1936 KiB

gondola

#include "gondola.h"
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn=1e5+5;
int N,niz[maxn],niz2[maxn];
void adjust(){
   int najm=1;
   for(int i=1;i<=N;i++)
      if(niz[i]<niz[najm])
         najm=i;
   for(int i=1;i<=N;i++){
      if(i+najm-1<=N)
         niz2[i]=niz[i+najm-1];
      else
         niz2[i]=niz[i+najm-N-1];
   }
   for(int i=1;i<=N;i++)
      niz[i]=niz2[i];
}
int valid(int n, int inputSeq[]){
   N=n;
   for(int i=1;i<=N;i++)
      niz[i]=inputSeq[i-1];
   adjust();/*
   for(int i=1;i<=N;i++)
      cout<<niz[i]<<" ";
   cout<<endl;*/
   if(niz[1]>=N)
      return 1;
   int treba=niz[1];
   for(int i=2;i<=N;i++){
      treba++;
      if(treba==N+1)
         treba=1;
      if(niz[i]>N)
         continue;
      if(niz[i]!=treba)
         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: 0 / 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