#include<bits/stdc++.h>
using namespace std;
const int maxn = 1000001;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x*f;
}
int n, m, next[maxn], c[maxn][2], fa[maxn], size[maxn], st[maxn];
bool rev[maxn];
inline bool isroot(int k) {
r......
阅读全文