# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
975655 | 2024-05-05T16:18:36 Z | ShaShi | Permutation (APIO22_perm) | C++17 | 2 ms | 596 KB |
#include "perm.h" #include <bits/stdc++.h> #define F first #define S second #define all(x) x.begin(), x.end() #define pb push_back #define mp make_pair #define pii pair<int, int> using namespace std; typedef long long ll; const int MAXN = (int)1e6 + 7; const int LG = 60; vector<int> construct_permutation(ll k) { vector<int> res; bool flag = 0; for (int i=LG-1; i>=0; i--) { if (!(k&(1ll<<i))) continue; // for (int j:res) cout << j << " "; // cout << endl; // cout << "!" << i << endl; if (!flag) { for (int j=1; j<=i; j++) res.pb(j); flag = 1; continue; } for (int j=0; j<res.size(); j++) if (res[j] >= i+1) res[j]++; res.pb(i+1); } for (int i=0; i<res.size(); i++) res[i]--; return res; } // int main() { // vector<int> res = construct_permutation(42); // for (int i:res) cout << i << " "; // return 0; // }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 436 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 436 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 | 348 KB | Partially correct |
6 | Correct | 2 ms | 348 KB | Output is correct |
7 | Correct | 1 ms | 348 KB | Output is correct |
8 | Partially correct | 2 ms | 348 KB | Partially correct |
9 | Correct | 1 ms | 344 KB | Output is correct |
10 | Partially correct | 2 ms | 344 KB | Partially correct |
11 | Partially correct | 2 ms | 348 KB | Partially correct |
12 | Partially correct | 1 ms | 596 KB | Partially correct |
13 | Partially correct | 2 ms | 500 KB | Partially correct |