제출 #194165

#제출 시각아이디문제언어결과실행 시간메모리
194165juanmartinez111곤돌라 (IOI14_gondola)C++14
0 / 100
3 ms376 KiB
#include<bits/stdc++.h> #include "gondola.h" int valid(int n, int inputSeq[]) { int ini=0,fin=0; bool si=true; for(int i=0;i<n;i++){ if(inputSeq[i]==n)fin=i; if(inputSeq[i]==1)ini=i; int cnt=1; while(ini!=fin){ if(inputSeq[ini]!=cnt){ si=false; break; } ini=(ini+1)%n; cnt++; } if(inputSeq[ini]!=cnt){ si=false; } } return !si; } //---------------------- 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...