Submission #433646

#TimeUsernameProblemLanguageResultExecution timeMemory
433646medmdgGondola (IOI14_gondola)C++14
20 / 100
13 ms1124 KiB
#include<bits/stdc++.h>
#include "gondola.h"
#define ll  long long
using namespace std;
int valid(int n, int inputSeq[])
{
  int h=1;
  for(int i=1;i<n;i++){
    if(inputSeq[i]!=(inputSeq[i-1]%n+1))
        h=0;
  }
  return h;
}
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...