제출 #955087

#제출 시각아이디문제언어결과실행 시간메모리
9550874QT0R곤돌라 (IOI14_gondola)C++17
20 / 100
24 ms5204 KiB
#include <bits/stdc++.h> #include "gondola.h" using namespace std; #define pii pair<int,int> int valid(int n, int inputSeq[]){ set<int> s(inputSeq,inputSeq+n); if ((int)s.size()<n)return 0; pii mn={n+1,-1}; for (int i = 0; i<n; i++){ if (inputSeq[i]<mn.first)mn={inputSeq[i],i}; } int cur=mn.first; for (int i = mn.second+1; i<n; i++){ if (inputSeq[i]<=n && inputSeq[i]!=++cur)return 0; } for (int i = 0; ++cur<=n; i++){ if (inputSeq[i]<=n && inputSeq[i]!=cur)return 0; } return 1; } int replacement(int n, int gondolaSeq[], int replacementSeq[]){ return 1; } int countReplacement(int n, int inputSeq[]){ if (!valid(n,inputSeq))return 0; return 1; }
#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...