제출 #494070

#제출 시각아이디문제언어결과실행 시간메모리
494070ahmeteren곤돌라 (IOI14_gondola)C++17
15 / 100
10 ms1496 KiB
#include <bits/stdc++.h> #include "gondola.h" using namespace std; int valid(int n, int inputSeq[]) { int mn = 1e7, start = 0, it = 0; vector<int> vec(n); for(int i = 0; i < n; i++) { if(inputSeq[i] < mn) { mn = inputSeq[i]; start = i; } } for(int i = start; i < start + n; i++) { vec[it] = inputSeq[i % n]; it++; } int cur = mn; for(int i = 0; i < n; i++, cur++) { if(vec[i] > n) continue; if(vec[i] != cur) { return 0; } } return 1; } int replacement(int n, int gondolaSeq[], int replacementSeq[]) { int mx = 0, it = 0; map<int, int> used; for(int i = 0; i < n; i++) { mx = max(mx, gondolaSeq[i]); used[gondolaSeq[i]] = true; } for(int i = 1; i <= mx; i++) { if(!used[i]) { replacementSeq[it] = i; it++; } } return it; } 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...