【开源社区openEuler实践】 E. Inverse Topological Sort

题目

题解：

#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define pb push_back
#define fi first
#define se second
#define lson p << 1
#define rson p << 1 | 1
#define ll long long
#define pii pair<int, int>
#define ld long double
const int maxn = 2e5 + 5, inf = 1e9, maxm = 4e4 + 5, base = 337;
const int N = 2e5;
// const int mod = 1e9 + 7;
const int mod = 998244353;
// const __int128 mod = 212370440130137957LL