Submission #995400

#TimeUsernameProblemLanguageResultExecution timeMemory
995400thinknoexitGondola (IOI14_gondola)C++17
10 / 100
6 ms1244 KiB
#include "gondola.h" #include <bits/stdc++.h> using namespace std; using ll = long long; int valid(int n, int a[]) { int mn = n + 1; int idx = 0; for (int i = 0;i < n;i++) { if (a[i] <= n) { if (a[i] < mn) { mn = a[i]; idx = i; } } } if (mn == n + 1) return 1; idx = (idx - mn + 1 + n) % n; for (int i = 0;i < n;i++) { if (a[(i + idx) % n] <= n && a[(i + idx) % n] != i + 1) 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...