Submission #230296

#TimeUsernameProblemLanguageResultExecution timeMemory
230296chubyxdxdGondola (IOI14_gondola)C++17
10 / 100
20 ms1792 KiB
#include "gondola.h"
#include <bits/stdc++.h>

using namespace std;
int valid(int n, int inputSeq[])
{
  int vis[300000];
  memset(vis,0,sizeof vis);
  int mini=300000;
  int pos=0;
  for(int i=0;i<n;i++){
    if(inputSeq[i]<mini){
      mini=inputSeq[i];
      pos=i;
    }
  }
  int i=0;
  int j=pos;
  int sw=0;
  while(i<n){
    
    if(j==n)j=0;
    if(inputSeq[j]<i+1 or vis[inputSeq[j]]==1)sw=1;
    vis[inputSeq[j]]=1;
    j++;
    i++;
  }
  if(sw)return 0;
  else return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
  return -2;
}

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

int countReplacement(int n, int inputSeq[])
{
  return -3;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...