uva1624knots

题意：给出一个橡皮筋，有两种操作，问是否可以将它还原

分析：将橡皮筋一步步还原，先删除没有覆盖的结点，然后删除满足条件的结点

#include<iostream>
#include<string.h>
#include<sstream>
#include<set>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
#include<math.h>
using namespace std;
const int maxn = 1000000 + 10;
struct node {
	int left, right, face;
}q[maxn];
int vis[maxn], layer[maxn];
void del(int id) {
	vis[id] = 1;
	q[q[id].left].right = q[id].right;
	q[q[id].right].left = q[id].left;
}
int main()
{
	int kase,t=0;
	cin >> kase;
	int n, m;
	while (kase--) {
		cin >> n >> m;
		memset(vis, 0, sizeof(vis));
		memset(layer, 0, sizeof(layer));
		for (int i = 0; i < n; i++) {
			q[i].left = i - 1;
			q[i].right = i + 1;
		}
		q[0].left = n - 1;
		q[n - 1].right = 0;
		for (int i = 0; i < m; i++) {
			int u, v;
			cin >> u >> v;
			q[u].face = v;
			q[v].face = u;
			layer[u] = 1;
			layer[v] = -1;
		}
		for (int i = 0; i < n; i++)if (layer[i] == 0)del(i);
		int k = 0,count=2*m,u,v;
		while (count) {
			int ok = 1;
			while (vis[k])k++;
			for (int i = q[k].right; ok&&i != k; i = q[i].right) {
				u = k; v = q[k].right;
				if (layer[u] == layer[v] && (q[q[u].face].right == q[v].face || q[q[v].face].right == q[u].face)) {
					//如果相邻两节点在同一平面，并且两节点的遮盖结点也是相邻，那么可以还原，想象一下每次都还原橡皮筋的末端，
					//注意这是一个循环，，末端删除之后会有下一个末端，因为每次都搜索整条线的。
					del(u); del(q[u].face); del(v); del(q[v].face);
					count -= 4;
					ok = 0;
				}
				else {
					if (q[u].face == v) {//相邻结点覆盖，直接删除
						del(u); del(v);
						count -= 2;
						ok = 0;
					}
				}
			}
			if (ok)break;
		}
		cout << "Case #" << ++t << ": " << (count ? "NO\n" : "YES\n");
	}
	return 0;
}