oj.uz

Submission #932789

# Submission time Handle Problem Language Result Execution time Memory
932789 2024-02-24T08:25:55 Z 8pete8 Permutation (APIO22_perm) C++17
91.3333 / 100
 2 ms 348 KB 
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include "perm.h"
#include<cstring>
#include<cassert>
#include<limits.h>
#include<cmath>
#include<set>
#include<numeric> //gcd(a,b)
#include<algorithm>
#include<bitset> 
#include<stack>
using namespace std;
#define ll long long
#define f first
#define endl "\n"
#define s second
#define pii pair<int,int>
#define pppiiii pair<pii,pii>
#define ppii pair<int,pii>
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
//#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
//#pragma GCC optimize ("03,unroll-loops")
//#define int long long
//const int mod=1e9+7,mxn=2e5,lg=30,inf=1e18,minf=-1e18,Mxn=2e6,root=700;
bool cmp(pii a,pii b){
	if(a.f!=b.f)return a.f<b.f;
	return a.s>b.s;
}
vector<int> construct_permutation(ll k){
	vector<pii>ans;
	vector<int>ra;
	int g=0;
	for(int i=62;i>=0;i--)if(k&(1ll<<i)){
		g=i;
		break;
	}
	int cnt=g-1;
	for(int i=0;i<g;i++)ans.pb({i,i});
	for(int i=g-1;i>=0;i--){
		if(k&(1ll<<i))ans.pb({i,++cnt});
	}
	sort(all(ans),cmp);
	for(auto i:ans)ra.pb(i.s);
	return ra;
}

Subtask #1
10.0 / 10.0

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