제출 #842748

#제출 시각아이디문제언어결과실행 시간메모리
842748PacybwoahGondola (IOI14_gondola)C++17
10 / 100
9 ms1120 KiB
#include<algorithm> #include<vector> #include<iostream> #include"gondola.h" using namespace std; int valid(int n, int inp[]) { int first=-1; for(int i=0;i<n;i++){ if(inp[i]<=n){ first=i; break; } } if(first==-1) return 1; bool flag=1; for(int i=0;i<n;i++){ if(inp[i]!=(inp[first]+i-first-1+n)%n+1&&inp[i]<=n){ flag=0; break; } } return flag; } //---------------------- 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...