oj.uz

답안 #638494

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
638494 2022-09-06T09:28:13 Z TranGiaHuy1508 순열 (APIO22_perm) C++17
100 / 100
 2 ms 340 KB 
#include <bits/stdc++.h>
using namespace std;
 
using ll = long long;
 
namespace {
	vector<int> primes = {2, 3, 5, 7};
 
	deque<int> q;
	int lim;
 
	void mult(int x){
		if (x == 7){
			q.push_back(lim + 3);
			q.push_back(lim + 1);
			q.push_back(lim);
			q.push_back(lim + 2);
			lim += 4;
			return;
		}
		else if (x == 5){
			q.push_back(lim + 2);
			q.push_back(lim);
			q.push_back(lim + 1);
			lim += 3;
			return;
		}
		for (int i = lim + x - 2; i >= lim; i--){
			q.push_back(i);
		}
		lim += x - 1;
	}
 
	void add1(){
		q.push_front(lim++);
	}
 
	void solve(ll k){
		if (k == 1) return;
		for (int i = 0; i < (int)primes.size(); i++){
			if (k % primes[i] == 0){
				solve(k / primes[i]);
				mult(primes[i]);
				return;
			}
		}
		solve(k - 1);
		add1();
		return;
	}
}
 
vector<int> construct_permutation(ll k){
	lim = 0;
	solve(k);
	vector<int> v;
	while (!q.empty()){
		v.push_back(q.front());
		q.pop_front();
	}
	return v;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 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 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 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 1 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 1 ms 340 KB Output is correct