# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
618090 | 2022-08-01T21:48:55 Z | Lobo | Permutation (APIO22_perm) | C++17 | 528 ms | 456 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; vector<int> ks; for(int i = 1; i <= min((int) 5e5,k); i++) { if(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; } 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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
# | 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 | 4 ms | 212 KB | Output is correct |
4 | Correct | 38 ms | 300 KB | Output is correct |
5 | Partially correct | 168 ms | 304 KB | Partially correct |
6 | Correct | 242 ms | 304 KB | Output is correct |
7 | Correct | 334 ms | 300 KB | Output is correct |
8 | Partially correct | 435 ms | 456 KB | Partially correct |
9 | Partially correct | 409 ms | 332 KB | Partially correct |
10 | Partially correct | 426 ms | 292 KB | Partially correct |
11 | Partially correct | 528 ms | 280 KB | Partially correct |
12 | Correct | 2 ms | 340 KB | Output is correct |
13 | Partially correct | 278 ms | 412 KB | Partially correct |