Submission #153485

#TimeUsernameProblemLanguageResultExecution timeMemory
153485dennisstarGondola (IOI14_gondola)C++11
20 / 100
16 ms2424 KiB
#include "gondola.h" #include <bits/stdc++.h> using namespace std; int valid(int n, int inputSeq[]) { int i; int chk[250010]; memset(chk, 0, sizeof(chk)); for (i=0; i<n; i++) chk[inputSeq[i]]++; for (i=0; i<n; i++) if (chk[inputSeq[i]]!=1) return 0; for (i=0; i<n; i++) if (inputSeq[i]<=n) break; if (i>=n) return 1; int ar[100010]; for (int j=0; j<n; j++) ar[(inputSeq[i]-1+j)%n]=inputSeq[(i+j)%n]; for (i=0; i<n; i++) if (ar[i]<=n&&i+1!=ar[i]) 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...