제출 #1144862

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