# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1135507 | Ludissey | Permutation (APIO22_perm) | C++20 | 0 ms | 0 KiB |
#include "game.h"
#include <bits/stdc++.h>
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using namespace std;
vector<vector<int>> edge;
vector<vector<int>> invedge;
vector<bool> r;
vector<bool> s;
int n,k;
void init(int _n, int _k) {
n=_n;
k=_k;
edge.resize(n);
invedge.resize(n);
r.resize(n);
s.resize(n);
for (int i = 0; i < k-1; i++)
{
edge[i].push_back(i+1);
invedge[i+1].push_back(i);
r[i+1]=true;
s[i]=true;
}
}