제출 #292732

#제출 시각아이디문제언어결과실행 시간메모리
292732TMJN곤돌라 (IOI14_gondola)C++17
10 / 100
22 ms1152 KiB
#include "gondola.h" int valid(int n, int inputSeq[]){ int t=1; for(int i=0;i<n;i++){ if(inputSeq[i]<=n){ for(int j=0;j<n;j++){ if(inputSeq[(i+j)%n]<=n){ if((inputSeq[i]+j)%n!=inputSeq[(i+j)%n]%n){ t=0; } } } break; } } return t; } //---------------------- 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...