oj.uz

Submission #957469

# Submission time Handle Problem Language Result Execution time Memory
957469 2024-04-03T20:31:15 Z emad234 Permutation (APIO22_perm) C++17
91.3333 / 100
 2 ms 436 KB 
#include "perm.h"
#include <bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define pii pair<int, int>
const int mod = 1e9 + 7;
const int mxN = 1e4 + 100;
using namespace std;

std::vector<int> construct_permutation(long long k)
{
	vector<int>ans;
	bool vis[64] = {};
	int n = -1;
	for(int i = 60;i >= 0;i--){
		if((k >> i) % 2){
			if(n == -1) n = i;
			else vis[i] = 1;
		}
	}
	vector<int>v;
	int id = 0;
	for(int i = 0;i < n;i++){
		if(vis[i]){
			v.push_back(id);
			id++;
		}
		ans.push_back(id);
		id++;
	}
	while(v.size()){
		ans.push_back(v.back());
		v.pop_back();
	}
	return ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
81.333333333 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 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 1 ms 348 KB Output is correct
8 Partially correct 1 ms 344 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 348 KB Partially correct
12 Partially correct 2 ms 436 KB Partially correct
13 Partially correct 1 ms 348 KB Partially correct