Submission #984118

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
984118	2024-05-16T10:20:25 Z	Izaz	Permutation (APIO22_perm)	C++17	71.2154 / 100	10 ms	1392 KB

perm

#include <bits/stdc++.h>
using namespace std;

#define f first
#define s second
#define mn(a,b) min(a,b)
#define mx(a,b) max(a,b)
#define ll long long
ll power[61];
vector<int> construct_permutation(long long  k)
{
	ll Num =  1;
	k -- ;
	power[0] = 1;
	for(int i = 1;i<=60;i++){
		Num*=2;
		power[i] = Num;
	}
	vector<vector<int>>Answer;
	vector<int>My_Answer;
	int Last =-1; 
	for(int i = 0 ; i < 10000;i ++) { 
		My_Answer.push_back(i);
		ll Num2 = (i - Last + 1);
		if(power[Num2]-1>k){
			k-=power[i-Last]-1;
			Answer.push_back(My_Answer);
			My_Answer.clear();
			Last = i; 
		}
		if(k == 0)
			break;
	}
	reverse(Answer.begin(),Answer.end());
	vector<int>Ans2;
	for(auto x:Answer){
		for(auto y: x)Ans2.push_back(y);
	}
   return Ans2;
}

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

61.215384618 / 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	Partially correct	1 ms	348 KB	Partially correct
4	Partially correct	1 ms	348 KB	Partially correct
5	Partially correct	4 ms	600 KB	Partially correct
6	Partially correct	4 ms	600 KB	Partially correct
7	Partially correct	6 ms	844 KB	Partially correct
8	Partially correct	9 ms	1112 KB	Partially correct
9	Correct	1 ms	348 KB	Output is correct
10	Partially correct	10 ms	1392 KB	Partially correct
11	Partially correct	8 ms	1152 KB	Partially correct
12	Partially correct	7 ms	860 KB	Partially correct
13	Partially correct	8 ms	1116 KB	Partially correct