Submission #316167

#TimeUsernameProblemLanguageResultExecution timeMemory
316167qpwoeirutGondola (IOI14_gondola)C++17
20 / 100
396 ms1912 KiB
#include <bits/stdc++.h> #include "gondola.h" using namespace std; const int MN = 250001; bool seen[MN]; int valid(int n, int inputSeq[]) { for (int i=0; i<n; ++i) { if (inputSeq[i] <= n) { int val = inputSeq[i]; int idx = (n + i - val + 1) % n; rotate(inputSeq, inputSeq+idx, inputSeq+n); break; } } for (int i=0; i<n; ++i) { cerr << inputSeq[i] << ' '; } cerr << endl; for (int i=0; i<n; ++i) { if (inputSeq[i] != i+1 && inputSeq[i] <= n) { return 0; } if (seen[inputSeq[i]]) { return 0; } seen[inputSeq[i]] = true; } 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...