Submission #1019502

#TimeUsernameProblemLanguageResultExecution timeMemory
1019502pccGondola (IOI14_gondola)C++17
20 / 100
28 ms5236 KiB
#include "gondola.h" #include <bits/stdc++.h> using namespace std; int valid(int n, int arr[]){ int cen = -1; set<int> st; for(int i = 0;i<n;i++){ if(arr[i]<=n)cen = i; if(st.find(arr[i]) != st.end())return false; st.insert(arr[i]); } if(cen == -1)return true; int c = arr[cen]; while(cen<n){ if(arr[cen] != c&&arr[cen]<=n)return false; c++; if(c>n)c -= n; cen++; } cen = 0; while(cen<n){ if(arr[cen] != c&&arr[cen]<=n)return false; c++; if(c>n)c -= n; cen++; } return true; } //---------------------- 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...