제출 #1270586

#제출 시각아이디문제언어결과실행 시간메모리
1270586ezzzay곤돌라 (IOI14_gondola)C++20
0 / 100
0 ms328 KiB
#include "gondola.h" int valid(int n, int inputSeq[]) { int a=0; for(int i=1;i<n;i++){ if(inputSeq[i-1]+1==inputSeq[i]){ a++; } else if(inputSeq[i-1]==n and inputSeq[i]==1){ a++; } } return (a==n); } //---------------------- 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...