Submission #387830

#TimeUsernameProblemLanguageResultExecution timeMemory
387830MilosMilutinovicGondola (IOI14_gondola)C++14
15 / 100
32 ms4500 KiB
/** * author: milos * created: 09.04.2021 10:49:32 **/ #include <bits/stdc++.h> #include "gondola.h" using namespace std; int valid(int n, int* a) { set<int> s; for (int i = 0; i < n; i++) { if (a[i] > 2 * n) { return 0; } a[i] %= n; if (a[i] == 0) { a[i] = n; } s.insert(a[i]); } if ((int) s.size() != n) { return 0; } int cnt = 0; for (int i = 1; i < n; i++) { if (a[i] < a[i - 1]) { cnt++; } } return (cnt <= 1 ? 1 : 0); } int replacement(int n, int* a, int* ans) { return 0; } int countReplacement(int n, int* a) { return 1; }
#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...