제출 #1086883

#제출 시각아이디문제언어결과실행 시간메모리
1086883TimoshPermutation (APIO22_perm)C++17
91.33 / 100
1 ms436 KiB
#include "bits/stdc++.h" #include "perm.h" using namespace std; std::vector<int> construct_permutation(long long k) { int mx = 10000; int mn = 0; vector<int> cur; long long x = k; while (x > 1) { if (x % 2) { x--; cur.push_back(mn++); } else x /= 2, cur.push_back(mx--); } reverse(cur.begin(), cur.end()); for (auto &i : cur) { if (i > 1000) i -= 10000 - (int)cur.size() + 1; } return cur; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...