제출 #780013

#제출 시각아이디문제언어결과실행 시간메모리
780013NothingXDGondola (IOI14_gondola)C++17
10 / 100
7 ms1152 KiB
#include "gondola.h" int valid(int n, int a[]){ int idx = 0; for (int i = 0; i < n; i++){ if (a[i] < a[idx]) idx = i; } if (a[idx] > n) return 1; int ptr = idx; for (int i = a[idx]; i <= n; i++){ if (a[ptr] <= n && a[ptr] != i) return 0; ptr++; if (ptr >= n) ptr -= n; } 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...