답안 #618075

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
618075 2022-08-01T21:11:54 Z Lobo 순열 (APIO22_perm) C++17
91.3333 / 100
113 ms 424 KB
#include "perm.h"
#include<iostream>
#include<vector>
#include<deque>
using namespace std;
#define int long long

vector<int32_t> construct_permutation(int k)
{
	int k1 = k;
	int k2 = 1;
	for(int i = min(k-1,(int) 1e5); i >= 1; i--) {
		if(k%i == 0) {
			k1 = i;
			k2 = k/i;
			break;
		}
	}
    vector<int32_t> vc;
    deque<int> ans;
    int lg = 0;
    for(int i = 0; i <= 60; i++) {
    	if(k1 >= (1LL<<i)) lg = i;
    }
    for(int i = lg-1; i >= 0; i--) {
        ans.push_back((int) ans.size());
        if(k1&(1LL<<i)) ans.push_front((int) ans.size());
    }
    // cout << "   " << k1 << endl;
    for(auto x : ans) {
    	// cout << " 1 " << x << endl;
    	vc.push_back(x);
    }

    deque<int> ans2;
    int lg2 = 0;
    for(int i = 0; i <= 60; i++) {
    	if(k2 >= (1LL<<i)) lg2 = i;
    }
    for(int i = lg2-1; i >= 0; i--) {
        ans2.push_back((int) ans2.size()+vc.size());
        if(k2&(1LL<<i)) ans2.push_front((int) ans2.size()+vc.size());
    }
    // cout << "   " << k2 << endl;
    for(auto x : ans2) {
    	// cout << " 2 " << x << endl;
    	vc.push_back(x);
    }

    return vc;

}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 17 ms 308 KB Output is correct
4 Correct 22 ms 304 KB Output is correct
5 Partially correct 44 ms 212 KB Partially correct
6 Correct 62 ms 308 KB Output is correct
7 Correct 68 ms 312 KB Output is correct
8 Partially correct 86 ms 304 KB Partially correct
9 Partially correct 80 ms 336 KB Partially correct
10 Partially correct 88 ms 372 KB Partially correct
11 Partially correct 113 ms 424 KB Partially correct
12 Partially correct 3 ms 340 KB Partially correct
13 Partially correct 37 ms 340 KB Partially correct