【开源社区openEuler实践】Codeforces Round 975 (Div. 2)

题目

题解：

#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>

const int maxn = 1e6 + 5, inf = 2e18, maxm = 4e4 + 5, base = 37;
const int N = 1e6;
const int mod = 1e9 + 7;
// const int mod = 998244353;
// const __int128 mod = 212370440130137957LL;

int n, m;

//long long ? maxn ? n? m?
void solve(){
    ll res = 0;
    int k, q;
    cin >> n;