oj.uz

Submission #919101

# Submission time Handle Problem Language Result Execution time Memory
919101 2024-01-31T09:24:01 Z Mher777 Permutation (APIO22_perm) C++17
64.6154 / 100
 12 ms 1624 KB 
#include "perm.h"
#include <iostream>
#include <iomanip>
#include <array>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <iterator>
#include <numeric>
#include <complex>
#include <utility>
#include <random>
#include <fstream>
using namespace std;

/* -------------------- Typedefs -------------------- */

typedef int itn;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef float fl;
typedef long double ld;

/* -------------------- Usings -------------------- */

using vi = vector<int>;
using vll = vector<ll>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

/* -------------------- Defines -------------------- */

#define ff first
#define ss second
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mpr make_pair
#define yes cout<<"Yes\n"
#define no cout<<"No\n"
#define all(x) (x).begin(), (x).end()

/* -------------------- Constants -------------------- */

const int MAX = int(2e9 + 5);
const ll MAXL = ll(1e18) + 5ll;
const ll MOD = ll(1e9 + 7);
const ll MOD2 = ll(998244353);

std::vector<int> construct_permutation(long long k) {
	vi ans;
	--k;
	bitset<66> bit = k;
	int beg = 0;
	for (int i = 0; i <= 64; ++i) {
		if (!bit[i]) continue;
		if (i == 0) {
			ans.pub(0);
			++beg;
			continue;
		}
		for (int j = beg + i - 1; j >= beg; --j) {
			ans.pub(j);
		}
		ans.pub(beg + i);
		beg += i + 1;
	}
	reverse(all(ans));
	return ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
54.615384612 / 90.0

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