제출 #307697

#제출 시각아이디문제언어결과실행 시간메모리
307697kylych03곤돌라 (IOI14_gondola)C++14
20 / 100
15 ms1536 KiB
#include "gondola.h" #include <bits/stdc++.h> using namespace std; int vis[1000001]; int valid(int n, int inputSeq[]) { int ind = 0; int num = 0; for(int i = 0 ; i< n ; i++){ if(inputSeq[i]>=1 && inputSeq[i] <=n ){ ind = i; num = inputSeq[i]; } if(inputSeq[i] <1) return 0; if(vis[inputSeq[i]] ==1) return 0; vis[inputSeq[i]]=1; } if(num==0) return 1; for(int i = 0 ; i < n; i++) if(inputSeq[i] <= n){ if( (ind + (inputSeq[i] - num) +n ) %n!=i ) 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...