hiho week 268 register

Ended

Participants:66

Verdict:Accepted
Score:100 / 100
Submitted:2019-08-20 17:33:35

Lang:G++

Edit
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>
#define Max 100007
int parent[Max];
int score[Max];
int find(int x){
    if(x != parent[x]){
        int t = parent[x];
        parent[x] = find(parent[x]);
        score[x] += score[t];
        
    }
    return parent[x];
}
int main(){
    int N,M,Q;
    scanf("%d%d%d",&N,&M,&Q);
    for(int i=1;i<=N;i++){
        parent[i] = i;
    }
    for(int i=0;i<M;i++){
        int x,y,s;
        scanf("%d%d%d",&x,&y,&s);
        int px,py;
        px=find(x);
        py=find(y);
        if(px != py){
            parent[px] = py;
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX