oj.uz

Submission #931010

# Submission time Handle Problem Language Result Execution time Memory
931010 2024-02-21T04:51:08 Z Evirir Permutation (APIO22_perm) C++17
91.3333 / 100
 2 ms 436 KB 
#include "perm.h"
#include <bits/stdc++.h>
using namespace std;

#define watch(x) cout<<(#x)<<"="<<(x)<<'\n'
#define mset(d,val) memset(d,val,sizeof(d))
#define cbug if(DEBUG) cout
#define setp(x) cout<<fixed<<setprecision(x)
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define forn(i,a,b) for(int i=(a);i<(b);i++)
#define fore(i,a,b) for(int i=(a);i<=(b);i++)
#define pb push_back
#define F first
#define S second
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> ii;
typedef vector<int> vi;
typedef vector<pair<int, int>> vii;

vi makePerm(vi a)
{
	int n = sz(a);
	vi dis(all(a));
	sort(all(dis));
	forn(i,0,n)
	{
		a[i] = lower_bound(all(dis), a[i]) - dis.begin();
	}
	return a;
}

std::vector<int> construct_permutation(long long n)
{
	ll L=0, R=0;
	vi ans{0};

	int i = 62;
	while(!((1LL << i) & n)) i--;
	i--;
	while (i >= 0)
	{
		if ((1LL << i) & n)
		{
			L--;
			ans.pb(L);
		}
		if (i != 0)
		{
			R++;
			ans.pb(R);
		}
		i--;
	}
	return makePerm(ans);
}

Subtask #1
10.0 / 10.0

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