HDOJ 3592 World Exhibition difference constraint, hdoj3592

HDOJ 3592 World Exhibition difference constraint, hdoj3592

World Exhibition Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission (s): 1373 Accepted Submission (s): 673


Problem DescriptionNowadays, please people want to go to Shanghai to visit the World Exhibition. so there are always a lot of people who are standing along a straight line waiting for entering. assume that there are N (2 <= N <= 1,000) people numbered 1 .. N who are standing in the same order as they are numbered. it is possible that two or more person line up at exactly the same location in the condition that those visit in a group.

There is something interesting. some like each other and want to be within a certain distance of each other in line. some really dislike each other and want to be separated by at least a certain distance. A list of X (1 <= X <= 10,000) constraints describes which person like each other and the maximum distance by which they may be separated; a subsequent list of Y constraints (1 <= Y <= 10,000) tells which person dislike each other and the minimum distance by which they must be separated.

Your job is to compute, if possible, the maximum possible distance between person 1 and person N that satisfies the distance constraints.
 
InputFirst line: An integer T represents the case of test.

The next line: Three space-separated integers: N, X, and Y.

The next X lines: Each line contains three space-separated positive integers: A, B, and C, with 1 <= A <B <= N. person A and B must be at most C (1 <= C <= 1,000,000) apart.

The next Y lines: Each line contains three space-separated positive integers: A, B, and C, with 1 <= A <B <= C. person A and B must be at least C (1 <= C <= 1,000,000) apart.
 
OutputFor each line: A single integer. if no line-up is possible, output-1. if person 1 and N can be arbitrarily far apart, output-2. otherwise output the greatest possible distance between person 1 and N.
Sample Input

14 2 11 3 82 4 152 3 4

 
Sample Output

19

 
Authoralpc20
Source2010ACM-ICPC Multi-University Training Contest (15) -- Host by NUDT

/*************************************** * ******** Author: CKbossCreated Time: File Name: HDOJ3592.cpp *************************************** * ********/# include <iostream> # include <cstdio> # include <cstring> # include <algorithm> # include <string> # include <cmath> # include <cstdlib> # include <vector> # include <queue> # include <set> # include <map> using namespace std; const int maxn = 111 1; const int INF = 0x3f3f3f; struct Edge {int to, next, cost;} edge [30300]; int Adj [maxn], Size; void init () {memset (Adj,-1, sizeof (Adj); Size = 0;} void Add_Edge (int u, int v, int c) {edge [Size]. to = v; edge [Size]. cost = c; edge [Size]. next = Adj [u]; Adj [u] = Size ++;} int n, m1, m2; int dist [maxn], cq [maxn]; bool inq [maxn]; bool spfa (int rt) {memset (dist, 63, sizeof (dist); memset (cq, 0, sizeof (cq )); memset (inq, false, sizeof (inq); dist [rt] = 0; queue <int> q; inq [rt] = true; q. push (rt); cq [rt] = 1; while (! Q. empty () {int u = q. front (); q. pop (); for (int I = Adj [u]; ~ I; I = edge [I]. next) {int v = edge [I]. to; if (dist [v]> dist [u] + edge [I]. cost) {dist [v] = dist [u] + edge [I]. cost; if (! Inq [v]) {inq [v] = true; cq [v] ++; if (cq [v]> = n) return false; q. push (v) ;}} inq [u] = false;} return true;} int main () {// freopen ("in.txt", "r", stdin ); // freopen ("out.txt", "w", stdout); int T_T; scanf ("% d", & T_T); while (T_T --) {scanf ("% d", & n, & m1, & m2); init (); int u, v, c; for (int I = 0; I <m1; I ++) {scanf ("% d", & u, & v, & c); Add_Edge (u, v, c );} for (int I = 0; I <m2; I ++) {scanf ("% d", & u, & v, & c ); add_Edge (v, u,-c);} bool fg = spfa (1); if (fg = false) puts ("-1 "); else if (dist [n] = INF) puts ("-2"); else printf ("% d \ n", dist [n]);} return 0 ;}

Copyright Disclaimer: This article is an original article by the blogger and cannot be reproduced without the permission of the blogger.