Submission #598026

#TimeUsernameProblemLanguageResultExecution timeMemory
598026enerelt14Gondola (IOI14_gondola)C++14
20 / 100
11 ms1108 KiB
#include "gondola.h" #include<bits/stdc++.h> using namespace std; int valid(int n, int inputSeq[]){ int k=n+1, s; for (int i=0;i<n;i++){ if (i>n)continue; s=inputSeq[i]-i; if (k==n+1)k=s; if (k!=s && min(k, s)+n!=max(k, s))return 0; } return 1; } int replacement(int n, int gondolaSeq[], int replacementSeq[]){ return 0; } int countReplacement(int n, int inputSeq[]){ return 0; }
#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...