제출 #413744

#제출 시각아이디문제언어결과실행 시간메모리
413744Antekb곤돌라 (IOI14_gondola)C++14
10 / 100
12 ms1464 KiB
#include "gondola.h" #include<bits/stdc++.h> using namespace std; int valid(int n, int inputSeq[]) { bool b=0; vector<int > V(n); for(int i=0; i<n; i++){ if(inputSeq[i]<=n){ int t=inputSeq[i]-i-1; //cout<<inputSeq[i]<<"\n"; for(int j=0; j<n; j++)V[j]=inputSeq[(j-t+n)%n]; //for(int j=0; j<n; j++)cout<<V[j]<<" "; b=1; break; } } if(b==0)return 1; for(int i=0; i<n; i++)if(V[i]<=n && V[i]!=i+1)b=0; return b; } //---------------------- 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...