# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1178016 | JelalTkm | Permutation (APIO22_perm) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#include "perm.h"
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
using namespace std;
#define ll long long int
// const int N = 1000 + 10;
// const int md = 1e9 + 7;
// const int INF = 5e6;
vector<int> construct_permutation(int k) {
vector<int> ans;
for (int i = k - 1; i >= 0; i--)
ans.push_back(i);
return ans;
}
// int32_t main(int32_t argc, char *argv[]) {
// ios::sync_with_stdio(false);
// cin.tie(nullptr);
// int T = 1;
// // cin >> T;
// while (T--) {
// vector<int> u = {0, 0, 0}, v = {1, 2, 3}, w = {5, 10, 5};
// vector<ll> ans = minimum_closure_costs(4, u, v, w);
// for (auto i: ans)
// cout << i << " ";
// }
// return 0;
// }