제출 #800964

#제출 시각아이디문제언어결과실행 시간메모리
800964jlallas384곤돌라 (IOI14_gondola)C++17
20 / 100
30 ms5068 KiB
#include <bits/stdc++.h> #include "gondola.h" using namespace std; int valid(int n, int inputSeq[]){ set<int> used; int idx = 0; for(int i = 0; i < n; i++){ if(used.count(inputSeq[i])) return 0; used.insert(inputSeq[i]); if(inputSeq[i] <= n){ idx = i; } } int nd = inputSeq[idx]; for(int i = 0; i < n; i++){ int j = (idx + i) % n; if(inputSeq[j] <= n && inputSeq[j] != nd) return 0; nd++; if(nd > n) nd = 1; } 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...