oj.uz

Submission #593254

# Submission time Handle Problem Language Result Execution time Memory
593254 2022-07-10T16:39:34 Z CSQ31 Permutation (APIO22_perm) C++17
91.3333 / 100
 2 ms 368 KB 
#include "perm.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define INF (int)(1e9+1)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
vector<int> construct_permutation(ll k)
{
	vector<int>v;
	for(int i=0;i<=60;i++){
		if(k&(1LL<<i))v.pb(i);	
	}
//cout<<"V:"<<'\n';
	//for(int x:v)cout<<x<<" ";
	//cout<<'\n';
	
	vector<int>ans;
	int n = sz(v);
	vector<bool>used(150,0);
	for(int i=0;i<n-1;i++)ans.pb(v[i]+i);
	reverse(all(ans));
	for(int x:ans)used[x] = 1;
	int cnt = 0;
	vector<int>a;
	for(int i=0;i<=150;i++){
		if(cnt == v.back())break;
		if(!used[i]){
			cnt++;
			a.pb(i);
		}
	}
	for(int x:ans)a.pb(x);
	return a;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
81.333333333 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Partially correct 1 ms 340 KB Partially correct
6 Correct 1 ms 296 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Partially correct 2 ms 340 KB Partially correct
9 Correct 1 ms 296 KB Output is correct
10 Partially correct 2 ms 340 KB Partially correct
11 Partially correct 1 ms 340 KB Partially correct
12 Partially correct 2 ms 368 KB Partially correct
13 Partially correct 1 ms 340 KB Partially correct