제출 #931010

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
931010		Evirir	순열 (APIO22_perm)	C++17	91.33 / 100	2 ms	436 KiB

perm

#include "perm.h"
#include <bits/stdc++.h>
using namespace std;

#define watch(x) cout<<(#x)<<"="<<(x)<<'\n'
#define mset(d,val) memset(d,val,sizeof(d))
#define cbug if(DEBUG) cout
#define setp(x) cout<<fixed<<setprecision(x)
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define forn(i,a,b) for(int i=(a);i<(b);i++)
#define fore(i,a,b) for(int i=(a);i<=(b);i++)
#define pb push_back
#define F first
#define S second
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> ii;
typedef vector<int> vi;
typedef vector<pair<int, int>> vii;

vi makePerm(vi a)
{
	int n = sz(a);
	vi dis(all(a));
	sort(all(dis));
	forn(i,0,n)
	{
		a[i] = lower_bound(all(dis), a[i]) - dis.begin();
	}
	return a;
}

std::vector<int> construct_permutation(long long n)
{
	ll L=0, R=0;
	vi ans{0};

	int i = 62;
	while(!((1LL << i) & n)) i--;
	i--;
	while (i >= 0)
	{
		if ((1LL << i) & n)
		{
			L--;
			ans.pb(L);
		}
		if (i != 0)
		{
			R++;
			ans.pb(R);
		}
		i--;
	}
	return makePerm(ans);
}

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