제출 #276301

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