제출 #253302

#제출 시각아이디문제언어결과실행 시간메모리
253302eohomegrownapps곤돌라 (IOI14_gondola)C++14
20 / 100
13 ms1152 KiB
#include "gondola.h" #include <bits/stdc++.h> using namespace std; int valid(int n, int inputSeq[]){ vector<bool> seen(250002,false); int mnv = 250002; int mnind = -1; for (int i = 0; i<n; i++){ if (seen[inputSeq[i]]){ return 0; } seen[inputSeq[i]]=true; if (mnv>inputSeq[i]){ mnv=inputSeq[i]; mnind=i; } } if (mnv>n){ return 1; } mnv++; for (int i = (mnind+1)%n; i!=mnind; i=(i+1)%n){ if (1<=inputSeq[i]&&inputSeq[i]<=n){ if (mnv!=inputSeq[i]){ return 0; } } mnv++; } 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...