Submission #619532

# Submission time Handle Problem Language Result Execution time Memory
619532 2022-08-02T12:47:11 Z Lobo Permutation (APIO22_perm) C++17
96.3333 / 100
861 ms 552 KB
#include "perm.h"
#include<iostream>
#include<vector>
#include<deque>
#include<math.h>
using namespace std;
#define int long long

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

Compilation message

perm.cpp: In function 'std::vector<int> construct_permutation(long long int)':
perm.cpp:11:6: warning: unused variable 'k1' [-Wunused-variable]
   11 |  int k1 = k;
      |      ^~
perm.cpp:12:6: warning: unused variable 'k2' [-Wunused-variable]
   12 |  int k2 = 1;
      |      ^~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 4 ms 212 KB Output is correct
4 Correct 50 ms 296 KB Output is correct
5 Partially correct 250 ms 304 KB Partially correct
6 Correct 362 ms 424 KB Output is correct
7 Correct 525 ms 320 KB Output is correct
8 Partially correct 691 ms 552 KB Partially correct
9 Partially correct 659 ms 552 KB Partially correct
10 Partially correct 669 ms 444 KB Partially correct
11 Partially correct 861 ms 416 KB Partially correct
12 Correct 1 ms 340 KB Output is correct
13 Partially correct 412 ms 324 KB Partially correct