제출 #578418

#제출 시각아이디문제언어결과실행 시간메모리
5784181zaid1Permutation (APIO22_perm)C++17
91.33 / 100
4 ms456 KiB
#include "perm.h" #include "bits/stdc++.h" using namespace std; std::vector<int> construct_permutation(long long k) { int p = 1; vector<int> ans; int mx = 1, mn = -1; vector<int> steps; while (k) { if (k%2) steps.push_back(1); steps.push_back(0); k /= 2; } steps.pop_back(); steps.pop_back(); reverse(steps.begin(), steps.end()); for (int i:steps) { if (i) ans.push_back(mn--); else ans.push_back(mx++); } map<int, int> fr; vector<int> tmp = ans; int ind = 0; sort(tmp.begin(), tmp.end()); for (int i:tmp) { fr[i] = ind++; } for (int&i:ans) i = fr[i]; return ans; } /* 1 2 4 5 10 11 22 23 {} {0 1 -1 2 -2 3 -3} {3 4 2 5 1 6 0} {} */

컴파일 시 표준 에러 (stderr) 메시지

perm.cpp: In function 'std::vector<int> construct_permutation(long long int)':
perm.cpp:7:6: warning: unused variable 'p' [-Wunused-variable]
    7 |  int p = 1;
      |      ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...