제출 #589269

#제출 시각아이디문제언어결과실행 시간메모리
589269yutabi곤돌라 (IOI14_gondola)C++14
10 / 100
11 ms596 KiB
#include "gondola.h" int valid(int n, int s[]) { int diff=-1; bool flag=0; for(int i=0;i<n;i++) { if(s[i]<=n) { int num=(s[i]+n-i)%n; if(diff!=-1 && diff!=num) { flag=1; } diff=num; } } if(flag) { 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...