Submission #1183417

#TimeUsernameProblemLanguageResultExecution timeMemory
1183417Albara_AbdulhafithGondola (IOI14_gondola)C++20
10 / 100
5 ms584 KiB
  #include "gondola.h"

  int valid(int n, int inputSeq[])
  {
    int mn = n + 1;
    int id = -1;

    for(int i = 0; i < n; i++){
      if(inputSeq[i] <= n and inputSeq[i] < mn){
        mn = inputSeq[i];
        id = i;
      }
    }

    if(id == -1){
      return 1;
    }

    for(int i = 0; i < n; i++){
      if(inputSeq[(i + id) % n] <= n and inputSeq[(i + id) % n] != mn){
        return 0;
      }
      mn++;
    }

    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...