# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
983996 | 2024-05-16T09:02:09 Z | vjudge1 | Permutation (APIO22_perm) | C++17 | 2 ms | 348 KB |
#include <time.h> #include <cstdlib> #include <stack> #include <numeric> #include <unordered_map> #include <unordered_set> #include <iomanip> #include <map> #include <set> #include <iterator> #include <deque> #include <queue> #include <sstream> #include <array> #include <string> #include <tuple> #include <chrono> #include <cassert> #include <cstdio> #include <cstring> #include <list> #include <iostream> #include <vector> #include <cmath> #include <algorithm> #include <bitset> #include "perm.h" #define ll long long using namespace std; std::vector<int> construct_permutation(long long k){ vector<int> ans, v; deque<vector<int>> d; for(ll i = 62; i >= 0; i--){ if(k >= (1ll << i)){ k -= (1ll << i); v.push_back(i); } } for(int i = 0; i < v[0]; i++) ans.push_back(i); v.erase(v.begin()); reverse(v.begin(), v.end()); while(!v.empty()){ int num = v.back(); vector<int> dop = ans, neww; while(num > 0){ num--; neww.push_back(dop.back() + 1); dop.pop_back(); } reverse(neww.begin(), neww.end()); for(int i = 0; i < dop.size(); i++) dop[i]++; ans = dop; ans.push_back(0); for(int to : neww) ans.push_back(to); v.pop_back(); } return ans; } // int main(){ // ll n; // cin >> n; // vector<int> res = construct_permutation(n); // for(int to : res) // cout << to << " "; // }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 1 ms | 344 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 1 ms | 344 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 | 2 ms | 348 KB | Output is correct |
8 | Partially correct | 2 ms | 348 KB | Partially correct |
9 | Correct | 1 ms | 348 KB | Output is correct |
10 | Partially correct | 2 ms | 348 KB | Partially correct |
11 | Partially correct | 2 ms | 348 KB | Partially correct |
12 | Partially correct | 2 ms | 348 KB | Partially correct |
13 | Partially correct | 2 ms | 348 KB | Partially correct |