Submission #516719

#TimeUsernameProblemLanguageResultExecution timeMemory
516719amukkalirGondola (IOI14_gondola)C++17
20 / 100
8 ms1064 KiB
#include "gondola.h" #include <bits/stdc++.h> using namespace std; int valid(int n, int inputSeq[]) { int s = -1; bitset<250001> ud; for(int i=0; i<n; i++) { if(inputSeq[i] <= n) { s = i; } if(ud[inputSeq[s]]) { return 0; } ud[inputSeq[s]] = 1; } if(s != -1) { int val = inputSeq[s]-1; s--; for(int i=0; i<n; i++) { s = (s+1)%n; val = ((val) % n) + 1; if(inputSeq[s] <= n && inputSeq[s] != 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...