# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1011598 | 2024-06-30T19:55:05 Z | dimashhh | Permutation (APIO22_perm) | C++17 | 1 ms | 604 KB |
#include "perm.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; vector<int> ret,g; int hsb(ll x){ for(int i = 60;i >= 0;i--){ if((x >> i) & 1) return i; } } vector<int> construct_permutation(long long k) { ret.clear(); g.clear(); int f = hsb(k); for(int i = 0;i < f;i++){ g.push_back(i); } for(int i = f - 1;i >= 0;i--){ if((k >> i) & 1){ for(int j = i;j < (int)g.size();j++){ g[j]++; } for(int j = 0;j < (int)ret.size();j++){ if(ret[j] >= g[i] - 1){ ret[j]++; } } ret.push_back(g[i] - 1); } } for(int j:ret){ g.push_back(j); } // for(int j:g){ // cout << j << ' '; // } return g; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 1 ms | 348 KB | Output is correct |
4 | Correct | 1 ms | 348 KB | Output is correct |
5 | Partially correct | 1 ms | 344 KB | Partially correct |
6 | Correct | 1 ms | 348 KB | Output is correct |
7 | Correct | 1 ms | 348 KB | Output is correct |
8 | Partially correct | 1 ms | 348 KB | Partially correct |
9 | Correct | 1 ms | 348 KB | Output is correct |
10 | Partially correct | 1 ms | 348 KB | Partially correct |
11 | Partially correct | 1 ms | 604 KB | Partially correct |
12 | Partially correct | 1 ms | 604 KB | Partially correct |
13 | Partially correct | 1 ms | 348 KB | Partially correct |