제출 #782318

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