제출 #874679

#제출 시각아이디문제언어결과실행 시간메모리
874679serifefedartar순열 (APIO22_perm)C++17
0 / 100
0 ms348 KiB
#include <bits/stdc++.h> #include <perm.h> using namespace std; #define fast ios::sync_with_stdio(0);cin.tie(0); #define s second #define f first typedef long long ll; const ll MOD = 1e9+7; const ll LOGN = 20; const ll MAXN = 1e5 + 100; vector<int> construct_permutation(ll k) { deque<int> v; bool yes = false; int last = 1; for (int i = 60; i >= 0; i--) { if ((1<<i) & k) { if (!yes) { yes = true; v.push_back(1); } else { last++; v.push_front(last); last++; v.push_back(last); } } else if (yes) { last++; v.push_back(last); } } vector<int> P; for (auto u : v) P.push_back(u); return P; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...