oj.uz

Submission #602591

# Submission time Handle Problem Language Result Execution time Memory
602591 2022-07-23T09:05:33 Z patrikpavic2 Permutation (APIO22_perm) C++17
100 / 100
 1 ms 340 KB 
#include "perm.h"
#include <vector>
#include <algorithm>
 
#define PB push_back
 
using namespace std;
 
typedef vector < int > vi;
typedef long long ll;
 
vi construct_permutation(long long k){
	k--;
	if(k == 0) return {};
	if(k == 1) return {0};
	if(k == 2) return {1, 0};
	if(k > 7 && k % 7 == 6){
		vi st = construct_permutation((k - 6) / 7 + 1);
		st.PB((int)st.size() + 2);
		st.PB((int)st.size());
		st.PB((int)st.size() + 1);
		st.PB((int)st.size() - 3);
		return st;
	}
	if(k > 5 && k % 5 == 4){
		vi st = construct_permutation((k - 4) / 5 + 1);
		st.PB((int)st.size() + 1);
		st.PB((int)st.size() + 1);
		st.PB((int)st.size() - 2);
		return st;
	}
	if(k % 4 == 3){
		vi st = construct_permutation((k - 3) / 4 + 1);
		st.PB((int)st.size());
		st.PB((int)st.size());
		return st;
	}
	if(k % 3 == 2){
		vi st = construct_permutation((k - 2) / 3 + 1);
		st.PB((int)st.size() + 1);
		st.PB((int)st.size() - 1);
		return st;
	}
	vi st = construct_permutation((k - 1) / 2 + 1);
	st.PB((int)st.size());
	if(!(k & 1)){
		for(int& x : st) x++;
		st.PB(0);
	}
	return st;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
90.0 / 90.0

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