제출 #705368

#제출 시각아이디문제언어결과실행 시간메모리
705368ToroTN곤돌라 (IOI14_gondola)C++14
10 / 100
11 ms2016 KiB
#include<bits/stdc++.h> using namespace std; #include "gondola.h" //#include "grader.cpp" int a[100005],b[100005]; int valid(int n, int inputSeq[]) { int type=1,pos[100005]; for(int i=0;i<n;i++) { a[i+1]=inputSeq[i]; } for(int i=1;i<=n;i++)pos[a[i]]=i; for(int i=1;i<n;i++) { if(!(pos[i]==n&&pos[i+1]==1)&&!(pos[i]+1==pos[i+1])) { type=0; } } return type; } //---------------------- int replacement(int n, int gondolaSeq[], int replacementSeq[]) { for(int i=0;i<n;i++) { a[i+1]=gondolaSeq[i]; } return 0; } //---------------------- int countReplacement(int n, int inputSeq[]) { for(int i=0;i<n;i++) { a[i+1]=inputSeq[i]; } return 0; }
#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...