oj.uz

Submission #912429

# Submission time Handle Problem Language Result Execution time Memory
912429 2024-01-19T12:53:23 Z XXBabaProBerkay Permutation (APIO22_perm) C++17
91.3333 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;

#define F first
#define S second

using ll = long long;

const int INF = 1e9 + 7;
const int MOD = 998244353;

vector<int> construct_permutation(ll k)
{		
	vector<int> ans;
	int a = 0, b = -1;

	bool o = 0;
	for (int i = 63; i >= 0; i--)
	{
		if ((k & (1ll << i)) && !o)
		{
			o = 1;
			continue;
		}

		if (!o)
			continue;

		ans.push_back(a);
		a++;

		if (k & (1ll << i))
		{
			ans.push_back(b);
			b--;
		}
	}

	for (int &i : ans)
		i += -b - 1;

	return ans;
}

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
81.333333333 / 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 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 344 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 348 KB Partially correct
12 Partially correct 1 ms 348 KB Partially correct
13 Partially correct 1 ms 344 KB Partially correct