Submission #964282

#TimeUsernameProblemLanguageResultExecution timeMemory
964282maxFedorchukGondola (IOI14_gondola)C++17
10 / 100
10 ms1116 KiB
#include <bits/stdc++.h> #include "gondola.h" int valid(int n, int inputSeq[]) { int p=0; for(int i=0;i<n;i++) { if(inputSeq[i]<=n) { p=(n+i-inputSeq[i])%n; } } for(int i=0;i<n;i++) { if(inputSeq[i]<=n) { if((n+i-inputSeq[i])%n!=p) { return 0; } } } return 1; } //---------------------- int replacement(int n, int gondolaSeq[], int replacementSeq[]) { return -2; } //---------------------- 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...