제출 #851302

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

perm

#include "perm.h"
#include <bits/stdc++.h>
#include <fstream>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template<class A, class B>
ostream& operator<<(ostream& o, const pair<A, B>& p) {return o << '(' << p.first << ", " << p.second << ')';}
template<size_t Index = 0, typename... Types>
ostream& printTupleElements(ostream& o, const tuple<Types...>& t) {if constexpr (Index < sizeof...(Types)){if(Index > 0){o << ", ";}o << get<Index>(t);printTupleElements<Index + 1>(o, t);}return o;}
template<typename... Types>
ostream& operator<<(ostream& o, const tuple<Types...>& t){o << "(";printTupleElements(o, t);return o << ")";}
template<class T>
auto operator<<(ostream& o, const T& x) -> decltype(x.end(), o){o << '{';bool first = true;for (const auto& e : x){if (!first){o << ", ";}o << e;first = false;} return o << '}';}
#define DEBUG
#ifdef DEBUG
#define fastio()
#define debug(x...) cerr << "[" #x "]: ", [](auto... $) {((cerr << $ << "; "), ...); }(x), cerr << '\n'
#define check(x) if (!(x)) { cerr << "Check failed: " << #x << " in line " << __LINE__ << endl; exit(1); }
#else
#define fastio() ios_base::sync_with_stdio(0); cin.tie(0);
#define debug(...)
#define check(x) 
#endif
typedef long long ll;
#define pi pair<int, int>
#define pl pair<ll, ll>
#define st first
#define nd second
#define vi vector<int>
#define vll vector<ll>
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
vi construct_permutation(ll k) {
	vi res;
	ll pot = 1;
	int i = 0;
	while(pot * 2 <= k) {
		res.eb(i++);
		pot *= 2;
	}
	i--;
	vi dod;
	for(ll j = i; j >= 0; j--) {
		if(k & (1ll << j)) {
			int kt = res[i - j];
			for(auto &x : dod) {
				if(x >= kt + 1) {
					x++;
				}
			}
			for(auto &x : res) {
				if(x >= kt + 1) {
					x++;
				}
			}
			dod.eb(kt + 1);
		}
	}
	reverse(all(dod));
	dod.insert(dod.end(), all(res));
	return dod;
}

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