Submission #27745

#TimeUsernameProblemLanguageResultExecution timeMemory
27745zoomswkGondola (IOI14_gondola)C++14
20 / 100
59 ms7484 KiB
#include "gondola.h" #include <bits/stdc++.h> using namespace std; map<int, int> occ; int valid(int n, int inputSeq[]){ for(int i=0; i<n; i++){ inputSeq[i]--; if(occ[inputSeq[i]]) return 0; occ[inputSeq[i]] = 1; } int must = -1; for(int i=0; i<n; i++) if(inputSeq[i] < n) must = i; if(must == -1) return 1; for(int i=0; i<n; i++) if(inputSeq[i] < n && (inputSeq[i]+n+must-i)%n != inputSeq[must]) 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...