hdu2860 并查集模拟

判断条件有点坑

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<queue>
#include<algorithm>
#include<map>
#include<iomanip>
#include<climits>
#define INF 1e11
#define MAXN 100010
using namespace std;

#define _min(a,b) (((a)<(b))?((a):(b)))
//适用于正负整数
template <class T>
inline bool scan_d(T &ret) {
    char c; int sgn;
    if (c = getchar(), c == EOF) return 0; //EOF
    while (c != '-' && (c<'0' || c>'9')) c = getchar();
    sgn = (c == '-') ? -1 : 1;
    ret = (c == '-') ? 0 : (c - '0');
    while (c = getchar(), c >= '0'&&c <= '9') ret = ret * 10 + (c - '0');
    ret *= sgn;
    return 1;
}
typedef long long LL;

struct soldier{
    int rate, com;
}s[MAXN];
struct Com{
    LL low;
    int num;
    Com(){
        low = INF;
        num = 0; 
    }
}c[MAXN];
int fa[MAXN];
int n, m, k;
int x, y;
string o;


int find(int x)
{
    if (fa[x]  == x) return x;
    return fa[x] = find(fa[x]);
}

void init()
{
    for (int i = 0; i < MAXN; ++i)
        fa[i] = i,c[i].low = INF,c[i].num = 0;
}

bool merge(int a,int b)
{
    int x = find(a);
    int y = find(b);
    if (x == y) return true;
    else if (x != y) {
        if (c[x].low > c[y].low) c[x].low = c[y].low;
        c[x].num += c[y].num;
        fa[y] = x;
    }
    return false;
}
int main()
{
    //n companies, k soldiers  m orders
    while (cin >> n >> k >> m) {
        init();
        for (int i = 0; i < k; ++i) {
            scan_d(s[i].rate);
            scan_d(s[i].com);
            c[s[i].com].num++;
            if (c[s[i].com].low > s[i].rate)
            c[s[i].com].low = s[i].rate;
        }
        for (int i = 0; i < m; ++i) {
            cin >> o;
            if (o == "GT"){
                scan_d(x);
                if (find(x) == x && c[x].num != 0) printf("Lowest rate: %I64d.
",c[x].low);
                else if (find(x) == x && c[x].num == 0) printf("Company %d is empty.
", x);
                else printf("Company %d is a part of company %d.
",x,fa[x]);
            }
            else if (o == "MG") {
                scan_d(x);  scan_d(y);
                if (x != find(x) || y != find(y) || merge(x,y)) puts("Reject");
                else puts("Accept");
            }
            else if (o == "AP") {
                scan_d(x);  scan_d(y);
                if (y != find(y)) {
                    puts("Reject");
                    continue;
                }
                if (c[y].low > x) c[y].low = x;
                c[y].num++;
                puts("Accept");
            }
        }
        puts("");
    }
    return 0;
}