제출 #1015154

#제출 시각아이디문제언어결과실행 시간메모리
1015154amirhoseinfar1385Gondola (IOI14_gondola)C++17
10 / 100
6 ms1204 KiB
#include "gondola.h" #include<bits/stdc++.h> using namespace std; int inf=1e9+5; int valid(int n, int inputSeq[]) { int wh=-1,mn=inf; for(int i=0;i<n;i++){ if(inputSeq[i]<mn){ wh=i; mn=inputSeq[i]; } } int last=mn; for(int i=0;i<n;i++){ if(inputSeq[(i+wh)%n]<=n){ if(inputSeq[(i+wh)%n]<last){ return 0; } last=inputSeq[(i+wh)%n]; } } 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...