Submission #285502

#TimeUsernameProblemLanguageResultExecution timeMemory
285502erd1Gondola (IOI14_gondola)C++14
10 / 100
39 ms4608 KiB
#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;

int valid(int n, int inputSeq[]) {
  set<int> uses, xs;
  for(int i = 0; i < n; i++)xs.insert(inputSeq[i]);
  if(*xs.begin() > n)return 1;
  rotate(inputSeq, find(inputSeq, inputSeq+n, *xs.begin()), inputSeq+n);
  assert(*xs.begin() == inputSeq[0]);
  if(*xs.begin() != 1) rotate(inputSeq, inputSeq+(n-*xs.begin()+1), inputSeq+n);
  for(int i = 0; i < n; i++)
    if(inputSeq[i] == i+1) continue;
    else if(inputSeq[i] <= n)return 0; else if(uses.count(inputSeq[i])) return 0; else uses.insert(inputSeq[i]);
  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...