#109. 并查集
又是一道并查集基础基础题~
ps:不用快读也可过
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int mod=998244353;
int u[4000010], n, m;
ll ans=0;
void read(int &n)
{
char c='+';
n=0
又是一道并查集基础基础题~
ps:不用快读也可过
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int mod=998244353;
int u[4000010], n, m;
ll ans=0;
void read(int &n)
{
char c='+';
n=0