| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 724093 | AlfaGenus | Permutation (APIO22_perm) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include <perm.h>
// #include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;
// typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define ll long long
#define str string
#define fastio ios::sync_with_stdio(0), cin.tie(0);
#define fs first
#define ss second
#define endl '\n'
#define all(x) (x).begin(), (x).end()
#define len(x) x.size()
#define ran(value, start, stop, step) for (int value = start; value < stop; value += step)
#define ran1(value, start, stop) ran(value, start, stop, 1)
#define ran2(value, stop) ran(value, 0, stop, 1)
#define print(a) \
for (auto &x : a) \
cout << x << " "; \
cout << endl;
#define printmp(a) \
for (auto &x : a) \
cout << x.fs << " " << x.ss << endl;
const ll mod = 1e9 + 7;
const ll INF = LLONG_MAX;
const ll NEG_INF = LLONG_MIN;
vector<int> construct_permutation(int n){
vector<int> ans(n);
for(int i = 0; i < n; i ++)
ans[i] = n - i - 1;
return ans;
}