题目链接:SGU 174
分析:每个点为并查集的一个元素,两点形成边时,把两点归并成同一个集合。当添加一条新边,该边的两点已在同一集合时,封闭区域形成。
代码如下:
#include <cstdio>
#include <map>
#include <utility>
using namespace std;
typedef pair<int, int> pii;
map<pii, int> mp;
const int N = 444444;
int p[N], m;
void init() { for(int i = 0; i < 2 * m; i++) p[i] = i; }
int find(int i) { return p[i] == i ? i : (p[i] = find(p[i])); }
void merge(int a, int b) { p[find(b)] = find(a); }
int main()
{
// freopen("in", "r", stdin);
int a, b, x, y;
while(~scanf("%d", &m)) {
init();
int ok = 0, ans = 0;
for(int i = 0; i < m; i++) {
scanf("%d%d%d%d", &a, &b, &x, &y);
if(ok) continue;
if(mp[pii(a, b)] == 0) mp[pii(a, b)] = mp.size();
if(mp[pii(x, y)] == 0) mp[pii(x, y)] = mp.size();
if(find(mp[pii(a, b)]) == find(mp[pii(x, y)])) { ans = i + 1; ok = 1; }
merge(mp[pii(a, b)], mp[pii(x, y)]);
}
printf("%d\n", ans);
}
return 0;
}