제출 #931294

#제출 시각아이디문제언어결과실행 시간메모리
931294djs100201순열 (APIO22_perm)C++17
0 / 100
0 ms344 KiB
#include<bits/stdc++.h> #include "perm.h" #pragma GCC optimize("O3") #pragma GCC optimize("Ofast") #pragma GCC optimize("unroll-loops") #pragma GCC target("avx2") #define all(v) v.begin(),v.end() using namespace std; using ll = long long; using P = pair<ll, ll>; using PP = pair<ll, P>; const ll n_ =4e5+100, inf = (ll)2e9 * (ll)1e9 + 7, mod = 998244353; ll n, m, tc = 1, a, b, c, d, sum, x, y, z, base, ans, k; ll gcd(ll x,ll y){ if(!y)return x; return gcd(y,x%y); } vector<int> construct_permutation(long long k){ vector<int>res,A; sum=0; x=k-1; for(int i=59;i>=0;i--){ a=(1ll<<i); if(x&a){ y++; A.push_back(i); sum+=i; } } x=y; while(x){ for(int i=59;i>=1;i--){ a=(1ll<<i); if(x>=a-1){ x-=a-1; A.push_back(i); sum+=i; break; } } } for(auto nxt:A){ sum-=nxt; for(int i=0;i<nxt;i++)res.push_back(sum+i); } return res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...