Canadian Computing Competition: 2007 Stage 1, Senior #4
The local waterpark has a great slide complex, with many paths crisscrossing down the hill. There is one start point and one end point, but at various points one can turn and take different paths. Walter and Wanda are wondering exactly how many different ways there are to go down the slide. Can you solve their problem?
More precisely, there are 
~n~ marked points (including the start at 
~1~ and the end at ~n~) where the paths down the hill may split or merge. All paths move down the hill to higher numbered positions; some paths will actually cross over others without meeting but we don't have to worry about that. We won't worry about the collisions between sliders that can happen either. Our problem is simply to determine the number of different sequences of marked points we can follow down the hill.
For example, at one small waterpark, there are 4 points with direct slides from ~1~ to points 
~2~ and 
~4~; from ~2~ to 
~3~ and ~4~; and from ~3~ to ~4~. There are 3 ways down the hill. You can check this by seeing that we can go 
~(1,2,3,4)~, 
~(1,2,4)~ or 
~(1,4)~.
(Here is a hint: think about starting at the bottom of the slide.)
Input Specification
Input begins with a single integer ~n~ (
~1 \le n \le 9999~), on a line by itself, indicating the number of marked points. The next lines contain point pairs of the form x y, where 
~1 \le x < y \le n~. For example, 1234 8765 indicates a direct slide from point 1234 to point 8765. The last line of input will be indicated by point pair 0 0.
Output Specification
The output is an integer, which is the number of different paths from point ~1~ to point ~n~. You can assume that the number of paths will be less than 
~2^{30}~. It is possible that there is no path from point ~1~ to point ~n~, in which case the number of paths is 
~0~.
Sample Input
4
1 2
1 4
2 3
2 4
3 4
0 0
Output for Sample Input
3
Comments
I implemented an inefficient topological sort dp algorithm, and ..... it worked?
Wow.
This is truly the exact moment Walter White became Heisenberg.
I did for testing the following graph:
In this test, there should be 3 paths: (1-2-5), (1-3-5), (1-4-3-5). But the solution of the official CCC, link, gives 2 paths. Maybe I didn't understand the goal of the problem...
Your case is invalid.
you are correct. It seems I misread it. thank you for clearing my doubt.
My DFS implementation TLEs. Any suggestions?
Brute force dfs TLEs, try using a different approach. DP is one of the problem types here.
My code wont run on Dmoj. Works on some compilers only.
Check the status code help page for some details about the
integer array which would occupy around 381mb of memory.
failed initializingerror you're getting. Put simply, you're declaring aThe memory limit for this problem is 64mb.
Is it a coincidence that the example does the exact same thing as his submission?