제출 #593265

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
593265		CSQ31	Permutation (APIO22_perm)	C++17	91.33 / 100	2 ms	340 KiB

perm

#include "perm.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define INF (int)(1e9+1)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
vector<int> construct_permutation(ll k)
{
	deque<int>v;
	bool ok = 0;
	for(int i=60;i>=0;i--){
		if(ok)v.pb(sz(v));
		if(k&(1LL<<i)){
			if(ok)v.push_front(sz(v));
			ok = 1;
		}
	}
	vector<int>ans;
	for(int x:v)ans.pb(x);
	return ans;
}

• Subtask 1: 10 / 10
• Subtask 2: 81.333333333 / 90