Submission #737670

# Submission time Handle Problem Language Result Execution time Memory
737670 2023-05-07T13:52:04 Z tegid Permutation (APIO22_perm) C++17
100 / 100
2 ms 340 KB
#include "perm.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define pb emplace_back

vector<int> construct_permutation(ll k){
	if(k<=4){
		if(k==2)return {0};
		if(k==3)return {1, 0};
		if(k==4)return {0, 1};
		return {};
	}else{
		if(k%2==0){
			vector<int> v=construct_permutation(k/2);
			vector<int> ans;
			ans.pb(0);
			for(int i=0;i<(int)v.size();i++)ans.pb(v[i]+1);
			return ans;
		}else if(k%3==0){
			vector<int> v=construct_permutation(k/3);
			vector<int> ans;
			ans.pb(1);
			ans.pb(0);
			for(int i=0;i<(int)v.size();i++)ans.pb(v[i]+2);
			return ans;
		}else if (k%5==0){
			vector<int> v=construct_permutation(k/5);
			vector<int> ans;
			ans.pb(1);
			ans.pb(2);
			ans.pb(0);
			for(int i=0;i<(int)v.size();i++)ans.pb(v[i]+3);
			return ans;
		}else if (k%7==0){
			vector<int> v=construct_permutation(k/7);
			vector<int> ans;
			ans.pb(2);
			ans.pb(3);
			ans.pb(0);
			ans.pb(1);
			for(int i=0;i<(int)v.size();i++)ans.pb(v[i]+4);
			return ans;
		}else{
			vector<int> v=construct_permutation(k-1);
			for(int i=0;i<(int)v.size();i++)v[i]++;
			v.pb(0);
			return v;
		}
	}
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
# 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 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct