Submission #588896

#TimeUsernameProblemLanguageResultExecution timeMemory
588896fuad27Gondola (IOI14_gondola)C++17
20 / 100
12 ms596 KiB
#include "gondola.h" #include<bits/stdc++.h> using namespace std; int valid(int n, int a[]) { int cnt = a[0]-1; for(int i = 1;i<n-cnt;i++) { if(a[i] != a[i-1]+1) { return 0; } } for(int i = n-cnt+1;i<n;i++) { if(a[i]!=a[i-1]+1)return 0; } if(cnt==0)return 1; if(a[0] != a[n-1]+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...