제출 #782320

#제출 시각아이디문제언어결과실행 시간메모리
782320sofija6곤돌라 (IOI14_gondola)C++14
20 / 100
31 ms5188 KiB
#include <bits/stdc++.h> #include "gondola.h" using namespace std; int valid(int n, int inputSeq[]) { int pos=-1,cnt=n,cur; set<int> s; for (int i=0;i<n;i++) { if (s.count(inputSeq[i])) return 0; s.insert(inputSeq[i]); if (inputSeq[i]<=n) pos=i; } if (pos==-1) return 1; cur=inputSeq[pos]; while (cnt--) { if (inputSeq[pos]<=n && inputSeq[pos]!=cur) return 0; cur++; pos++; if (pos>=n) pos=0; if (cur>n) cur=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...