QOJ.ac

QOJ

Time Limit: 2 s Memory Limit: 256 MB Total points: 100

#22740. Layout

Statistics

Like everyone else, cows like to stand close to their friends when queuing for feed. FJ has $N$ ($2 \le N \le 1{,}000$) cows numbered 1..$N$ standing along a straight line waiting for feed. The cows are standing in the same order as they are numbered, and since they can be rather pushy, it is possible that two or more cows can line up at exactly the same location (that is, if we think of each cow as being located at some coordinate on a number line, then it is possible for two or more cows to share the same coordinate).

Some cows 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 $ML$ ($1 \le ML \le 10{,}000$) constraints describes which cows like each other and the maximum distance by which they may be separated; a subsequent list of $MD$ constraints ($1 \le MD \le 10{,}000$) tells which cows 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 cow 1 and cow $N$ that satisfies the distance constraints.

Input

Line 1: Three space-separated integers: $N$, $ML$, and $MD$.

Lines $2..ML+1$: Each line contains three space-separated positive integers: $A$, $B$, and $D$, with $1 \le A < B \le N$. Cows $A$ and $B$ must be at most $D$ ($1 \le D \le 1{,}000{,}000$) apart.

Lines $ML+2..ML+MD+1$: Each line contains three space-separated positive integers: $A$, $B$, and $D$, with $1 \le A < B \le N$. Cows $A$ and $B$ must be at least $D$ ($1 \le D \le 1{,}000{,}000$) apart.

Output

Line 1: A single integer. If no line-up is possible, output -1. If cows 1 and $N$ can be arbitrarily far apart, output -2. Otherwise output the greatest possible distance between cows 1 and $N$.

Examples

Input 1

4 2 1
1 3 10
2 4 20
2 3 3

Output 1

27

Explanation

Explanation of the sample:

There are 4 cows. Cows #1 and #3 must be no more than 10 units apart, cows #2 and #4 must be no more than 20 units apart, and cows #2 and #3 dislike each other and must be no fewer than 3 units apart.

The best layout, in terms of coordinates on a number line, is to put cow #1 at 0, cow #2 at 7, cow #3 at 10, and cow #4 at 27.

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.