Submission #66573

#TimeUsernameProblemLanguageResultExecution timeMemory
66573aquablitz11Gondola (IOI14_gondola)C++14
20 / 100
71 ms5500 KiB
#include <bits/stdc++.h> #include "gondola.h" using namespace std; int valid(int n, int A[]) { set<int> seen; int six = -1; for (int i = 0; i < n; ++i) { if (seen.count(A[i])) return 0; seen.insert(A[i]); if (A[i] <= n) six = (i-(A[i]-1)+n)%n; } if (six == -1) return 1; for (int i = 0; i < n; ++i) { int j = (six+i)%n; if (A[j] <= n && A[j] != i+1) return false; } 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...