oj.uz

Submission #954941

# Submission time Handle Problem Language Result Execution time Memory
954941 2024-03-28T23:08:32 Z horiseun Permutation (APIO22_perm) C++17
91.3333 / 100
 2 ms 348 KB 
#include <iostream>
#include <vector>
#include <numeric>
#include <algorithm>
#include "perm.h"
using namespace std;

#define ll long long

vector<int> construct_permutation(ll k) {
	int curr = 0;
	for (int i = 59; i >= 0; i--) {
		if (k & (1ll << i)) {
			curr = i;
			break;
		}
	}
	vector<int> ret(curr);
	iota(ret.begin(), ret.end(), 0);
	for (int i = curr - 1; i >= 0; i--) {
		if (k & (1ll << i)) {
			ret.insert(ret.begin() + i, curr);
			curr++;
		}
	}
	return ret;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
81.333333333 / 90.0

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