UVALive 5906 Smoking gun（差分约束 + toposort）

题目链接：https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3917

 

题意：给出N个人坐标及M个人听到枪声的顺序，问是否存在一个开枪顺序能够满足这M个关系，如果存在是否多解，如果唯一解输出开枪顺序

 

思路：设每个人开枪时间为ti，假如A先听到B的枪声后听到C的枪声，则有不等式：tb + dis(a, b) <= tc + dis(a, c)，然后根据这些不等式组就可以跑spfa了，枚举每个点作为spfa的起点判断该差分约束系统是否存在，每次spfa时只将dis[i] < 0的点加入到toposort的点集中，因为对于那些dis[i] > 0的点由于距离的限制是不知道和起点s的时间拓扑序大小的，最后跑toposort

 

 

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <climits>
#include <functional>
#include <deque>
#include <ctime>
#include <string>

#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
#pragma comment(linker, "/STACK:102400000,102400000")

using namespace std;

const int maxn = 200;
const double inf = 1e16;
const double eps = 1e-7;

int head[maxn], cnt;
int vis[maxn], num[maxn];
double dis[maxn];
int in[maxn];

struct node
{
	double x, y;
	node(double x = 0, double y = 0) : x(x), y(y) {}
} p[maxn];

char s[1200][50];
map <string, int> mp;
bool is[maxn];

double dist(int i, int j)
{
	return sqrt((p[i].x - p[j].x) * (p[i].x - p[j].x) + (p[i].y - p[j].y) * (p[i].y - p[j].y));
}

struct edge
{
	int u, v, nxt;
	double w;
} e[200010];

void init()
{
	cnt = 0;
	memset(head, -1, sizeof(head));
}

void addedge(int u, int v, double w)
{
	e[cnt].u = u;
	e[cnt].v = v;
	e[cnt].w = w;
	e[cnt].nxt = head[u];
	head[u] = cnt++;
}

vector <int> g[maxn];

bool spfa(int s, int n)
{
	memset(vis, 0, sizeof(vis));
	memset(num, 0, sizeof(num));
	for (int i = 0; i <= n; i++) dis[i] = inf;
	queue <int> que;

	que.push(s);
	vis[s] = 1, dis[s] = 0;
	while (!que.empty())
	{
		int u = que.front();
		que.pop();
		vis[u] = 0;
		for (int i = head[u]; ~i; i = e[i].nxt)
		{
			int v = e[i].v;
			if (dis[v] > dis[u] + e[i].w + eps)
			{
				dis[v] = dis[u] + e[i].w;
				num[v]++;
				if (num[v] > n) return false;

				if (!vis[v])
				{
					vis[v] = 1;
					que.push(v);
				}
			}
		}
	}

	for (int i = 0; i < n; i++)
	{
		if (!is[i] || !is[s]) continue;
		if (dis[i] < -eps)
		{
			in[s]++;
			g[i].push_back(s);
		}
	}

	return true;
}

void toposort(int n)
{
	int tot = 0;
	queue <int> que;
	for (int i = 0; i < n; i++)
		if (in[i] == 0 && is[i])
		{
			que.push(i);
			tot++;
		}

	vector <int> ans;
	while (!que.empty())
	{
		if (que.size() > 1)
		{
			puts("UNKNOWN");
			return ;
		}
		int u = que.front();
		que.pop();

		ans.push_back(u);
		for (int i = 0; i < g[u].size(); i++)
		{
			int v = g[u][i];
			--in[v];

			if (!in[v])
			{
				tot++;
				que.push(v);
			}
		}
	}

	printf("%s", s[ans[0]]);
	for (int i = 1; i < ans.size(); i++)
		printf(" %s", s[ans[i]]);
	printf("\n");
}

int main()
{
	int t;
	cin >> t;
	while (t--)
	{
		init();
		mp.clear();
		memset(in, 0, sizeof(in));
		memset(is, 0, sizeof(is));
		for (int i = 0; i < maxn; i++) g[i].clear();

		int n, m;
		cin >> n >> m;

		for (int i = 0; i < n; i++)
		{
			scanf("%s", s[i]);
			scanf("%lf%lf", &p[i].x, &p[i].y);

			string st = s[i];
			mp.insert(make_pair(st, i));
		}

		string st;
		int x, y, z;
		for (int i = n; i < n + m; i++)
		{
			scanf("%s", s[i]);
			st = s[i], x = mp[st];

			scanf("%*s%s", s[i]);
			st = s[i], y = mp[st];

			scanf("%*s%*s%s", s[i]);
			st = s[i], z = mp[st];

			is[y] = is[z] = 1;
			double xy = dist(x, y);
			double xz = dist(x, z);
			double w = xz - xy;
			//if (w < 0)
			addedge(z, y, w);
		}

		bool flag = true;
		for (int i = 0; i < n; i++)
		{
			if (!spfa(i, n))
			{
				flag = false;
				break;
			}
		}

		if (!flag) {puts("IMPOSSIBLE"); continue;}

		// for (int i = 0; i < n; i++)
		// {
		// 	if (!is[i]) continue;
		// 	for (int j = 0; j < g[i].size(); j++)
		// 		printf("%d %d", i, g[i][j]);
		// 	printf("\n");
		// }

		toposort(n);
	}
	return 0;
}