제출 #373457

#제출 시각아이디문제언어결과실행 시간메모리
373457idk321곤돌라 (IOI14_gondola)C++11
10 / 100
13 ms1132 KiB
#include "gondola.h" #include <bits/stdc++.h> using namespace std; int valid(int n, int seq[]) { int cur = -1; for (int i = 0; i < n; i++) seq[i]--; for (int i = 0; i < n; i++) { if (seq[i] < n) { cur = i; break; } } if (cur == -1) return 1; int val = seq[cur]; for (int i = cur + 1; i < n; i++) { val++; val %= n; if (seq[i] < n && seq[i] != val) 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...