Submission #96275

#TimeUsernameProblemLanguageResultExecution timeMemory
96275figter001Gondola (IOI14_gondola)C++14
10 / 100
18 ms1164 KiB
#include "gondola.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; int valid(int n, int s[]){ int st = -1,mn = n+1; for(int i=0;i<n;i++){ if(s[i] < mn){ st = i; mn = s[i]; } } if(st == -1)return 1; for(int i=st;i<n;i++){ if(s[i] <= n && s[i] != mn)return 0; mn++; } for(int i=0;i<st;i++){ if(s[i] <= n && s[i] != mn)return 0; mn++; } 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...