HDU 1829 - A Bug's Life 发表于 2019-05-01 | 更新于 2019-05-20 | 分类于 ACM题解 | 阅读次数: 题目链接: A Bug’s Life 题意输入A B 代表A 喜欢 B,现在问你输入的数据里是否会出现同性恋。 思路种类并查集,依旧是用带权的思想,类似食物链中的偏移量。 1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950#include <bits/stdc++.h>using namespace std;int val[10001],f[10001];int Find(int x){ if(x != f[x]) { int t = f[x]; f[x] = Find(f[x]); val[x] = (val[x] + val[t]) % 2; } return f[x];}int main(){ int N, M, t, a, b, caser = 1; cin >> t; while(t--) { printf("Scenario #%d:\n",caser++); cin >> N >> M; for(int i = 1; i <= N; ++i) { f[i] = i; val[i] = 0; } int flag = 0; for(int i = 1; i <= M; ++i) { cin >> a >> b; int fa = Find(a); int fb = Find(b); if(fa != fb) { f[fa] = fb; val[fa] = (1 + val[b] - val[a]) % 2; } else { if(val[a] == val[b]) flag = 1; } } if(flag) printf("Suspicious bugs found!\n"); else printf("No suspicious bugs found!\n"); cout << '\n'; }} 打赏