GOODA - Good Travels
It's that time of year again - the best ACM-ICPC team of all time is off to the World Finals! Being the best, they realize that a good performance starts before the contest itself - in order to get into the perfect mindset, they must have as much fun on the trip to the contest site as possible!
The Team is interested in a network of $N$ ($2 \leq N \leq 10^6$) cities (conveniently numbered $1..N$), interconnected by $M$ ($1 \leq M \leq 10^6$) one-way flights (similarly numbered $1..M$). Their hometown is city $S$ ($1 \leq S \leq N$), and the contest will take place in city $E$ ($1 \leq E \leq N$, $S \neq E$). Flight $i$ goes from city $a_i$ ($1 \leq a_i \leq N$) to city $b_i$ ($1 \leq b_i \leq N$, $a_i \neq b_i$), and no two flights connect the same pair of cities in the same direction. In general, no cities are guaranteed to be reachable from other cities by a sequence of flights. However, The Team of course knows that city $E$ is reachable from city $S$ - they're not about to break their streak of triumphant wins!
Now, each city $i$ has a fun value, $f_i$ ($0 \leq f_i \leq 10^6$), associated with it. Along their trip, The Team will take time to have fun at every city they visit, including the first and last. However, though they can visit a city multiple times (including cities $S$ and $E$), or even take a certain flight multiple times, surely this gets boring quickly - therefore, any city's fun can only be had up to once.
The Team wants to determine the maximal amount of fun they can have on any sequence of flights that starts at city $S$ and ends at city $E$. Naturally, every member on The Team is so intelligent that they've calculated this value in their heads (and are quite excited about it) - but can you?
First line: 4 integers, $N$, $M$, $S$, and $E$
Next $N$ lines: 1 integer, $f_i$, for $i = 1..N$
Next $M$ lines: 2 integers, $a_i$ and $b_i$, for $i = 1..M$
1 integer, the maximal amount of fun The Team can have on their trip.
5 6 1 4 5 4 5 10 2 1 2 1 3 2 4 3 4 4 5 5 4 Output:
Explanation of Sample:
The network of cities and flights looks like this (the fun values of cities are shown below them):
The optimal route that The Team can take goes through cities $1 \rightarrow 3 \rightarrow 4 \rightarrow 5 \rightarrow 4$, yielding a total fun value of $5+5+10+2+0=22$.
Is this problem just about finding the strongly connected components and than summing up the values of cities in which S and E are located??
Seems stack limit is increased. So recursive solutions work now. totally worth time :)
worth solving :)
Amazing problem! Surprisingly, AC in 1 go :)
Really nice problem,it takes few combinations of ideas and topics to solve this that is what it makes it fun and challenging.
nice question :)
Version of problem without small stack limit: http://wcipeg.com/problem/goodaLast edit: 2016-02-20 02:49:38
Use long long
nasty stack limit is nasty x)
Could you please give me a test case for which my solution got SIGSEGV ? If you do not think that it would be a spoiler.