제출 #618124

#제출 시각아이디문제언어결과실행 시간메모리
618124as111곤돌라 (IOI14_gondola)C++14
10 / 100
13 ms1124 KiB
#include "gondola.h" using namespace std; int valid(int n, int inputSeq[]) { int curr = inputSeq[0]; for (int i = 1; i < n; i++) { if (inputSeq[i] <= n) { if (inputSeq[i] != curr + 1 && inputSeq[i] != 1) { return 0; } curr = inputSeq[i]; } } return 1; } int replacement(int n, int gondolaSeq[], int replacementSeq[]) { return 0; } int countReplacement(int n, int inputSeq[]) { return 0; }
#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...