【开源社区openEuler实践】 G. Natlan Exploring

原创

已于 2025-01-02 13:44:45 修改 · 322 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#算法

于 2024-11-19 20:51:12 首次发布

题目

#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 = 1e6 + 5, inf = 1e9, maxm = 4e4 + 5, base = 337;
const int N = 1e6;
// const int mod = 1e9 + 7;
const int mod = 998244353;
// const __int128 mod = 212370440130137957LL;
int n, m;
int a[maxn], b[maxn];

void solve(){
    ll res = 0;
    int k, q;
    cin >> n;
    vector<int> a(n + 1);
    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }
    vector<int> c(N + 1, 1);
    c[1] = 0;
    vector<vector<i