Submission #285629

#TimeUsernameProblemLanguageResultExecution timeMemory
285629amoo_safarGondola (IOI14_gondola)C++17
20 / 100
24 ms1912 KiB
#include "gondola.h" #include <bits/stdc++.h> #define pb push_back using namespace std; int valid(int n, int a[]){ vector<int> A, S; for(int i = 0; i < n; i++) A.pb(a[i]); sort(A.begin(), A.end()); for(int i = 0; i + 1 < n; i++) if(A[i] == A[i + 1]) return 0; for(int i = 0; i < n; i++) if(a[i] <= n) S.pb((i - a[i] + n) % n); sort(S.begin(), S.end()); for(int i = 0; i + 1 < (int) S.size(); i++) if(S[i] != S[i + 1]) return 0; return 1; } //---------------------- int replacement(int n, int gondolaSeq[], int replacementSeq[]) { return -2; } //---------------------- int countReplacement(int n, int inputSeq[]) { return -3; } /* 1 30 16 26 18 19 20 13 22 21 24 25 17 27 28 29 30 1 2 3 11 5 6 8 7 9 10 12 4 23 14 15 */
#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...