제출 #376694

#제출 시각아이디문제언어결과실행 시간메모리
376694lakshith_곤돌라 (IOI14_gondola)C++14
20 / 100
15 ms1260 KiB
#include "gondola.h" #include <bits/stdc++.h> using namespace std; bool b[2500010]; int checkOnce(int n,int vec[]){ for(int i=0;i<n;i++) if(b[vec[i]])return 0; else b[vec[i]]=true; return 1; } int valid(int n, int vec[]) { if(!checkOnce(n,vec))return 0; int MIN=INT_MAX,minI=0; for(int i=0;i<n;i++)if(MIN>vec[i])MIN=vec[i],minI=i; int p = MIN; int pos = minI; if(MIN>n)return 1; for(int k=0;k<n;k++){ if(vec[pos]<=n && vec[pos]!=p)return 0; pos++; p++; pos%=n; } 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...