LightOJ1009---Back to Underworld (bfs染色)

关注

原创最新推荐文章于 2018-01-28 12:51:38 发布 1.4k 阅读 AI 写同款· GEO 优化 ›

[kuangbin带你飞]专题九连通图题解报告专题链接关于tarjan A - Network of Schools 原题地址本题有2个问题，第一个是要算最少要给多少个点软件，才能使所有点都可以收到副本第二个是要算最少加多少条边，使得图变成强连通 1：tarjan求强连通，然后缩点，计算入度为0的强连通分量 2：设现在有a个入度为0的点，b个出度为0的点（缩完点后的点），最合理的加边方法肯定是从出度为0的点阅读详情

The Vampires and Lykans are fighting each other to death. The war has become so fierce that, none knows who will win. The humans want to know who will survive finally. But humans are afraid of going to the battlefield.

So, they made a plan. They collected the information from the newspapers of Vampires and Lykans. They found the information about all the dual fights. Dual fight means a fight between a Lykan and a Vampire. They know the name of the dual fighters, but don’t know which one of them is a Vampire or a Lykan.

So, the humans listed all the rivals. They want to find the maximum possible number of Vampires or Lykans.
Input

Input starts with an integer T (≤ 10), denoting the number of test cases.

Each case contains an integer n (1 ≤ n ≤ 105), denoting the number of dual fights. Each of the next n lines will contain two different integers u v (1 ≤ u, v ≤ 20000) denoting there was a fight between u and v. No rival will be reported more than once.
Output

For each case, print the case number and the maximum possible members of any race.
Sample Input

Output for Sample Input

1 2

2 3

1 2

2 3

4 2

Case 1: 2

Case 2: 3
Note

Dataset is huge, use faster I/O methods.

只要对点染色就行,注意最后要取每个连通块里面的出现次数最多的那个颜色

/*************************************************************************
    > File Name: LightOJ1009.cpp
    > Author: ALex
    > Mail: zchao1995@gmail.com 
    > Created Time: 2015年06月05日 星期五 12时33分33秒
 ************************************************************************/

#include <functional>
#include <algorithm>
#include <iostream>
#include <fstream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <stack>
#include <map>
#include <bitset>
#include <set>
#include <vector>

using namespace std;

const double pi = acos(-1.0);
const int inf = 0x3f3f3f3f;
const double eps = 1e-15;
typedef long long LL;
typedef pair <int, int> PLL;

static const int N = 30000;
vector <int> edge[N];
int col[N];
int Num[N][2];
int xis[N * 10];
int cnt;

struct node {
    int u, v;
}Temp[100010];

void bfs(int u, int tot) {
    col[u] = 1;
    queue <int> qu;
    qu.push(u);
    while (!qu.empty()) {
        int now = qu.front();
        ++Num[tot][col[now]];
        qu.pop();
        int size = edge[now].size();
        for (int i = 0; i < size; ++i) {
            int nxt = edge[now][i];
            if (col[nxt] == -1) {
                col[nxt] = (col[now] ^ 1);
                qu.push(nxt);   
            }
        }
    }
}

int Search(int val) {
    int l = 1, r = cnt, mid;
    while (l <= r) {
        mid = (l + r) >> 1;
        if (xis[mid] == val) {
            break;
        }
        else if (xis[mid] > val) {
            r = mid - 1;
        }
        else {
            l = mid + 1;
        }
    }
    return mid;
}

int main() {
    int t, icase = 1;
    scanf("%d", &t);
    while (t--) {
        int n, u, v;
        cnt = 0;
        scanf("%d", &n);
        for (int i = 1; i <= n; ++i) {
            scanf("%d%d", &u, &v);
            Temp[i].u = u;
            Temp[i].v = v;
            xis[++cnt] = u;
            xis[++cnt] = v;
        }
        sort(xis + 1, xis + 1 + cnt);
        cnt = unique(xis + 1, xis + 1 + cnt) - xis - 1;
        for (int i = 1; i <= cnt; ++i) {
            edge[i].clear();
            col[i] = -1;
            Num[i][0] = Num[i][1] = 0;
        }
        int tot = 0;
        for (int i = 1; i <= n; ++i) {
            u = Search(Temp[i].u);
            v = Search(Temp[i].v);
            edge[u].push_back(v);
            edge[v].push_back(u);
        }
        for (int i = 1; i <= cnt; ++i) {
            if (col[i] == -1) {
                bfs(i, ++tot);
            }
        }
        int ans = 0;
        for (int i = 1; i <= tot; ++i) {
            ans += max(Num[i][0], Num[i][1]);
        }
        printf("Case %d: %d\n", icase++, ans);
    }
    return 0;
}