제출 #18691

#제출 시각아이디문제언어결과실행 시간메모리
18691suhgyuho_williamGondola (IOI14_gondola)C++98
20 / 100
13 ms2568 KiB
#include "gondola.h" int valid(int n, int inputSeq[]) { int i; int s,t; bool check[250010]; s = -1; for(i=0; i<n; i++){ if(check[inputSeq[i]]) return 0; check[inputSeq[i]] = true; if(inputSeq[i] <= n){ t = i+2-inputSeq[i]; if(t <= 0) t += n; if(s == -1){ s = t; }else if(s != t){ 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...