제출 #588835

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