oj.uz

Submission #973451

# Submission time Handle Problem Language Result Execution time Memory
973451 2024-05-02T02:38:40 Z CDuong Permutation (APIO22_perm) C++17
100 / 100
 2 ms 432 KB 
#include "perm.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> construct_permutation(long long k)
{
	vector<int> binary;
	while (k) {
		binary.push_back(k & 1);
		k >>= 1;
	}
	reverse(binary.begin(), binary.end());

	deque<int> dq;
	int cnt = 0, sz = (int)binary.size(), cntt = 0;
	for (int i = 1; i < sz; ++i) {
		dq.emplace_back(cnt++);
		if (binary[i]) {
			if (i + 1 < sz and binary[i + 1] and cntt > 1) {
				dq.emplace_back(cnt++);
				dq.insert(dq.begin() + 2, cnt++);
				++i;
			}
			else dq.emplace_front(cnt++), cntt++;
		}
	}
	return {dq.begin(), dq.end()};
}

Subtask #1
10.0 / 10.0

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

Subtask #2
90.0 / 90.0

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