제출 #1004829

#제출 시각아이디문제언어결과실행 시간메모리
1004829u_suck_o곤돌라 (IOI14_gondola)C++17
20 / 100
6 ms1372 KiB
#include "bits/stdc++.h" #include "gondola.h" int valid(int n, int inputSeq[]) { bool seen[250001]; memset(seen, 0, sizeof seen); bool found = false; int diff = -1; for (int i = 0; i < n; i++) { if (seen[inputSeq[i]]) return 0; seen[inputSeq[i]] = true; if (inputSeq[i] > n) continue; if (!found) { found = true; diff = (inputSeq[i] - i + n) % n; } else { if ((inputSeq[i] - i + n) % n != diff) 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...