Submission #160669

#TimeUsernameProblemLanguageResultExecution timeMemory
160669GioChkhaidzeGondola (IOI14_gondola)C++14
0 / 100
2 ms376 KiB
#include <bits/stdc++.h> #include "gondola.h" using namespace std; int valid(int n, int inputSeq[]) { for (int i=0; i<n; i++) { inputSeq[i+n]=inputSeq[i]; } int idx=0; for (int i=0; i<n; i++) { if (inputSeq[i]<=n) { idx=i; break; } } int x=inputSeq[idx]; for (int i=idx+1; i<idx+n; i++) { x++; if (inputSeq[i]<=n && inputSeq[i]!=x) return 0; } 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...