2018 South Central USA Regional Contest

#### Start

2018-11-10 18:15 UTC

## 2018 South Central USA Regional Contest

#### End

2018-11-10 23:15 UTC
The end is near!
Contest is over.
Not yet started.
Contest is starting in -372 days 15:17:17

5:00:00

0:00:00

# Problem DDJ Gigs

Photo by Zierros

Doug James is an up-and-coming DJ from Graphland who’s had a tough time making it big. This all changed with the release of his latest EP Wiggly Waves, which is the first album in history to go both Platinum and Uranium. With his newfound popularity, Doug (a.k.a. DJ Polygon) needs help with a problem most artists would be lucky to face: deciding which of his many gig offers to take.

There are $K$ venues in Graphland, connected by $R$ roads. The venues are numbered $1$ to $K$. Doug’s house is venue $1$, and he is ready to leave or perform at time $t = 0$.

Doug has $G$ gig offers. The $i$-th gig is at venue $V_ i$, runs during the time interval $[S_ i,E_ i)$ (inclusive start, exclusive end), and pays out $M_ i$ cryptocents. Doug can’t take multiple gigs at the same time, and he can’t take gigs while he’s traveling between venues.

Doug is overwhelmed by his newfound fame and many gig requests, and wants your help making as much money as possible.

## Input

The first line of the input contains three integers $G$, $K$, and $R$: the number of gigs Doug has been offered, the number of venues in Graphland, and the number of roads connecting these venues.

These integers satisfy $1 \leq G \leq 200\, 000$, $1 \leq K \leq 100$, and $0 \leq R \leq \min \left(4\, 000, K(K-1)/2\right)$.

Then follow $R$ lines, each of which has three integers $A_ i$, $B_ i$, and $T_ i$, specifying the $i$-th (bidirectional) road. The $i$-th road connects venues $A_ i$ and $B_ i$ and it takes time $T_ i$ to travel the road in either direction. The values satisfy $1 \leq A_ i, B_ i \leq K$, $A_ i \neq B_ i$, and $1 \leq T_ i \leq 1\, 000\, 000$. Every road has two distinct endpoints, and there is at most one road between any pair of venues.

Then follow $G$ lines, each of which has four integers $V_ i$, $S_ i$, $E_ i$, and $M_ i$. This means the $i$-th gig runs from time $S_ i$ (inclusive) to $E_ i$ (exclusive) at venue $V_ i$, and pays $M_ i$ cryptocents. These values satisfy the bounds $0 \leq S_ i < E_ i \leq 1\, 000\, 000\, 000$ and $1 \leq M_ i \leq 1\, 000\, 000$.

## Output

Output a single integer: the maximum number of cryptocents that DJ Polygon can make by taking on the right gigs.

## Sample Explanation

In the first sample, There are two gigs at venue $1$ and one gig at venue $2$. Doug can either play both gigs at venue $1$ for $11$ cryptocents, or spend the first $10$ units of time traveling to venue $2$ and play that gig for $33$ cryptocents. He chooses the latter.

In the second sample, Doug makes the most by staying at venue $1$ and playing both of those gigs to earn $70$ cryptocents.

Sample Input 1 Sample Output 1
3 2 1
1 2 10
1 4 6 6
1 6 10 5
2 10 30 33

33

Sample Input 2 Sample Output 2
3 2 1
1 2 10
1 4 6 30
1 6 10 40
2 10 30 50

70