1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include <iostream>
#include <vector>
#include <cstring>
#include <queue>
using namespace std;
#define MAX_N 100001
vector<pair<int, int>> edges[MAX_N];
vector<vector<int>> group;
int parGroup[MAX_N];
int rScore[MAX_N];
bool visited[MAX_N];
void paint(int a) {
    queue<int> toVisit;
    group.push_back({});
    int gid = group.size();
    vector<int>& grp = group.back();
    toVisit.push(a);
    while(!toVisit.empty()) {
        int cur = toVisit.front();
        toVisit.pop();
        grp.push_back(cur);
        parGroup[cur] = gid;
        for(const auto& r : edges[cur]) {
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX