A bug's life(带权并查集)

Description:
Background
Professor Hopper is researching the sexual behavior of a rare species of bugs. He assumes that they feature two different genders and that they only interact with bugs of the opposite gender. In his experiment, individual bugs and their interactions were easy to identify, because numbers were printed on their backs.
Problem
Given a list of bug interactions, decide whether the experiment supports his assumption of two genders with no homosexual bugs or if it contains some bug interactions that falsify it.
Input
The first line of the input contains the number of scenarios. Each scenario starts with one line giving the number of bugs (at least one, and up to 2000) and the number of interactions (up to 1000000) separated by a single space. In the following lines, each interaction is given in the form of two distinct bug numbers separated by a single space. Bugs are numbered consecutively starting from one.
Output
The output for every scenario is a line containing “Scenario #i:”, where i is the number of the scenario starting at 1, followed by one line saying either “No suspicious bugs found!” if the experiment is consistent with his assumption about the bugs’ sexual behavior, or “Suspicious bugs found!” if Professor Hopper’s assumption is definitely wrong.
Sample Input
2
3 3
1 2
2 3
1 3
4 2
1 2
**3 4
Sample Output**
Scenario #1:
Suspicious bugs found!

Scenario #2:
No suspicious bugs found!
Hint
Huge input,scanf is recommended.

code

#include <cstdio>#include <cstring>#include <iostream>using namespace std;const int SIZE = 2005;int bugs[SIZE];int relation[SIZE];bool flag;void init(){    for(int i = 0; i < SIZE; ++i){        bugs[i] = i;    }    memset(relation, 0, sizeof(relation));     flag = false;}int find(int x){    int p;    if(x != bugs[x]){        p = bugs[x];        bugs[x] = find(bugs[x]);        relation[x] = (relation[x] + relation[p])%2; //两种不同的状态与节点的关系 1表示同性 0表示异性 状态转化方程    }    return bugs[x];}void Union(int x, int y){    int a = find(x);    int b = find(y);    if(a != b){        bugs[a] = b;        relation[a] = (relation[x] - relation[y] +1) %2;    }    find(x);}int main(){    int n, b, a, i = 1;;    scanf("%d", &n);    while(n--){        scanf("%d%d", &b, &a);        init();        while(a--){            int x, y;            scanf("%d%d", &x, &y);            if(!flag) Union(x, y);            if(relation[x] == relation[y]) flag = true;        }        printf("Scenario #%d:\n", i++);        if(flag){            printf("Suspicious bugs found!\n");          }else{            printf("No suspicious bugs found!\n");        }        printf("\n");    }    return 0;}