uva 1516 Smoking gun（差分约束系统）

uva 1516 Smoking gun

Description
Smoking gun

Andy: ”Billy the Kid fired first!”

Larry: ”No, I’m sure I heard the first shot coming from John!”

The arguments went back and forth during the trial after the big shoot-down, somewhere in the old wild west. Miraculously, everybody had survived (although there were serious injuries), but nobody could agree about the exact sequence of shots that had been fired. It was known that everybody had fired at most one shot, but everything had happened very fast. Determining the precise order of the shots was important for assigning guilt and penalties.

But then the sheriff, Willy the Wise, interrupted: ”Look, I’ve got a satellite image from the time of the shooting, showing exactly where everybody was located. As it turns out, Larry was located much closer to John than to Billy the Kid, while Andy was located just slightly closer to John than to Billy the Kid. Thus, because sound travels with a finite speed of 340 meters per second, Larry may have heard John’s shot first, even if Billy the Kid fired first. But, although Andy was closer to John than to Billy the Kid, he heard Billy the Kid’s shot first – so we know for a fact that Billy the Kid was the one who fired first!

Your task is to write a program to deduce the exact sequence of shots fired in situations like the above.

Input

On the first line a positive integer: the number of test cases, at most 100. After that per test case:

one line with two integers n (2 ≤ n ≤ 100) and m (1 ≤ m ≤ 1 000): the number of people involved and the number of observations.
n lines with a string S, consisting of up to 20 lower and upper case letters, and two integers x and y (0 ≤ x,y ≤ 1 000 000): the unique identifier for a person and his/her position in Cartesian coordinates, in metres from the origin.
m lines of the form “S1 heard S2 firing before S3”, where S1, S2 and S3 are identifiers among the people involved, and S2≠S3.

If a person was never mentioned as S2 or S3, then it can be assumed that this person never fired, and only acted as a witness. No two persons are located in the same position.

The test cases are constructed so that an error of less than 10-7 in one distance calculation will not affect the output.

Output

Per test case:

one line with the ordering of the shooters that is compatible with all of the observations, formatted as the identifiers separated by single spaces.

If multiple distinct orderings are possible, output “UNKNOWN” instead. If no ordering is compatible with the observations, output “IMPOSSIBLE” instead.

Sample in- and output

Input

3
4 2
BillyTheKid 0 0
Andy 10 0
John 19 0
Larry 20 0
Andy heard BillyTheKid firing before John
Larry heard John firing before BillyTheKid
2 2
Andy 0 0
Beate 0 1
Andy heard Beate firing before Andy
Beate heard Andy firing before Beate
3 1
Andy 0 0
Beate 0 1
Charles 1 3
Beate heard Andy firing before Charles

Output

BillyTheKid John
IMPOSSIBLE
UNKNOWN

题目大意：一群人去打猎，一起开完枪以后，他们想知道他们的开枪顺序。给出每个人的坐标，以及其中一些人的线索：A听到B在C之前开枪。每个人最多开一枪，可以不开枪。求开枪顺序。如果不可能，输出IMPOSSIBLE，如果不确定输出UNKNOW。

解题思路：差分约束系统。假如A听到B在C之前开枪，且B到A的距离大于C到A的距离，则B一定在C之前开枪。

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <map>
#include <iostream>
using namespace std;

typedef long long ll;
const ll INF = 1e17;
const int N = 105;
map<string, int> mp;
int n, m, tot;
ll X[N], Y[N];
string name[N];
int vis[N];
double d[N][N];

void init() {
    tot = 0;
    mp.clear();
    memset(vis, 0, sizeof(vis));
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (i == j) d[i][j] = 0;    
            else d[i][j] = INF;
        }   
    }
}

double getDis(int x, int y) {
    return sqrt((pow(X[x] - X[y], 2) + pow(Y[x] - Y[y], 2)));
}

void input() {
    scanf("%d %d", &n, &m);
    init();
    string s;
    ll a, b;
    for (int i = 1; i <= n; i++) {
        cin >> s >> a >> b; 
        mp[s] = i;
        name[i] = s;
        X[i] = a, Y[i] = b;
    }
}

void floyd() {
    for (int k = 1; k <= n; k++) {
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) {
                if (d[i][j] > d[i][k] + d[k][j]) {
                    d[i][j] = d[i][k] + d[k][j];
                }
            }   
        }   
    }
}

void solve() {
    string s1, s2, s3, stemp;
    for (int i = 0; i < m; i++) {
        cin >> s1 >> stemp >> s2 >> stemp >> stemp >> s3;   
        int id1 = mp[s1], id2 = mp[s2], id3 = mp[s3];
        vis[id2] = vis[id3] = 1;
        //id2比id3的枪声更早传到id1那里，所以如果id2距离id1的距离比id3距离id1的距离要远的话，那么id2一定比id3先开枪
        double dis = getDis(id1, id3) - getDis(id1, id2);
        if (dis < d[id2][id3]) d[id2][id3] = dis;
    }
    floyd();
    int flag = 1;
    for (int i = 1; i <= n; i++) {
        if (vis[i]) tot++;  
        if (d[i][i] < 0) {
            flag = 0;
            break;
        }
    }
    if (!flag) {
        printf("IMPOSSIBLE\n"); 
        return;
    }
    int ans[N], cnt = 0;
    bool flag2;
    while (tot--) {
        for (int i = 1; i <= n; i++) {
            //对于一个i所有的j都小于0，说明i是剩下的人里面最早开枪的
            if (!vis[i]) continue;
            flag2 = true;   
            for (int j = 1; j <= n; j++) {
                if (i == j) continue;
                if (vis[j] && d[i][j] >= 0) flag2 = false;  
            }
            if (flag2) {
                ans[cnt++] = i;     
                vis[i] = 0;
                break;
            }
        }
        if (!flag2) break;
    }
    if (tot != -1) {
        printf("UNKNOWN\n");    
        return;
    }
    cout << name[ans[0]];
    for (int i = 1; i < cnt; i++) {
        cout << " " << name[ans[i]];
    }puts("");
}

int main() {
    int T;
    scanf("%d", &T);
    while (T--) {
        init();
        input();
        solve();
    }
    return 0;
}