Submission #373460

#TimeUsernameProblemLanguageResultExecution timeMemory
373460idk321Gondola (IOI14_gondola)C++11
20 / 100
14 ms2156 KiB
#include "gondola.h" #include <bits/stdc++.h> using namespace std; const int M = 250005; int valid(int n, int seq[]) { vector<int> vis(M); for (int i = 0; i < n; i++) vis[seq[i]] = true; bool imp = false; for (int i = n; i < M; i++) { if (!vis[i]) { imp = 1; } else { if (imp) return 0; } } int cur = -1; for (int i = 0; i < n; i++) seq[i]--; for (int i = 0; i < n; i++) { if (seq[i] < n) { cur = i; break; } } if (cur == -1) return 1; int val = seq[cur]; for (int i = cur + 1; i < n; i++) { val++; val %= n; if (seq[i] < n && seq[i] != val) 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...