Submission #981563

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
981563	2024-05-13T10:40:21 Z	c2zi6	Permutation (APIO22_perm)	C++17	64.6308 / 100	13 ms	1116 KB

perm

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "perm.h"

VI construct_permutation(ll k) {
	int n = 0;
	VI seg;
	reprl(i, 62, 0) if (k & (1ll<<i)) {
		seg.pb(i);
		n += i;
	}
	n += seg.size()-1;

	VI ret(n);
	rep(i, n) ret[i] = n-i-1;

	int l = 0;
	for (int x : seg) {
		int r = l + x;
		reverse(ret.begin() + l, ret.begin() + r);
		l = r;
	}

	return ret;
}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct

Subtask #2

54.63076923 / 90.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Partially correct	1 ms	348 KB	Partially correct
4	Partially correct	2 ms	348 KB	Partially correct
5	Partially correct	6 ms	856 KB	Partially correct
6	Partially correct	4 ms	600 KB	Partially correct
7	Partially correct	9 ms	860 KB	Partially correct
8	Partially correct	13 ms	1116 KB	Partially correct
9	Correct	1 ms	344 KB	Output is correct
10	Partially correct	12 ms	1116 KB	Partially correct
11	Partially correct	8 ms	860 KB	Partially correct
12	Partially correct	7 ms	860 KB	Partially correct
13	Partially correct	10 ms	1112 KB	Partially correct