제출 #1032864

#제출 시각아이디문제언어결과실행 시간메모리
1032864vjudge1곤돌라 (IOI14_gondola)C++17
20 / 100
18 ms5784 KiB
#include "gondola.h" #include<bits/stdc++.h> using namespace std; int valid(int n, int inputSeq[]) { int ind[n+1]; for(int i=0;i<=n;i++)ind[i]=-1; unordered_set<int>seen; for(int i=0;i<n;i++){ if(seen.count(inputSeq[i]))return 0; seen.insert(inputSeq[i]); if(inputSeq[i]<=n){ ind[inputSeq[i]]=i; } } int val=-1,beg; for(int i=1;i<=n;i++){ if(ind[i]!=-1){ val=i; beg=ind[i]; break; } } if(val==-1)return 1; for(int j=beg+1;j!=beg;j=(j+1)%n){ val++; if(inputSeq[j]==val)continue; if(inputSeq[j]<=n)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...