제출 #563083

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