oj.uz

Submission #986307

# Submission time Handle Problem Language Result Execution time Memory
986307 2024-05-20T09:39:40 Z siewjh Permutation (APIO22_perm) C++17
100 / 100
 2 ms 600 KB 
#include "perm.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

vector<int> construct_permutation(ll k){
	vector<ll> b4;
	while (k){
		b4.push_back(k & 3); k >>= 2;
	}
	int sz = b4.size();
	vector<int> vec;
	if (b4[sz - 1] == 2) vec = {0};
	else if (b4[sz - 1] == 3) vec = {1, 0};
	for (int i = sz - 2; i >= 0; i--){
		int amt = vec.size();
		if (b4[i] == 0){
			vec.push_back(amt); vec.push_back(amt + 1);
		}
		else if (b4[i] == 1){
			vec.push_back(amt); vec.push_back(amt + 1); vec.insert(vec.begin(), amt + 2);
		}
		else if (b4[i] == 2){
			vec.push_back(amt); vec.push_back(amt + 2); vec.insert(vec.begin(), amt + 1);
		}
		else{
			if (vec.size() >= 2 && vec[0] > vec[1]){
				vec.push_back(amt); vec.push_back(amt + 1); vec.insert(vec.begin() + 2, amt + 2);
			}
			else{
				vec.push_back(amt); vec.push_back(amt + 2); vec.insert(vec.begin(), amt + 1); vec.insert(vec.begin(), amt + 3);
			}
		}
	}
	return vec;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
90.0 / 90.0

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