Submission #384806

#TimeUsernameProblemLanguageResultExecution timeMemory
384806angularAndSplintered곤돌라 (IOI14_gondola)C++14
0 / 100
2 ms384 KiB
#include "gondola.h"

int valid(int n, int inputSeq[])
{
    for (int i = 0; i < n; i += 1)
        if (inputSeq[i + 1] != (inputSeq[i] + 1) % n + 1)
          return false;
    return true;
}

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

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