Given a graph with N nodes with each node numbered from 1 to N and M edges and a target vertex T. Find the number of different ways to reach target vertex T from vertex numbered 1.
N <= 2 * 10^5, M = min( 2 * 10^5, N * ( N — 1 ) / 2 )
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
How to solve this graph problem?
Given a graph with N nodes with each node numbered from 1 to N and M edges and a target vertex T. Find the number of different ways to reach target vertex T from vertex numbered 1.
N <= 2 * 10^5, M = min( 2 * 10^5, N * ( N — 1 ) / 2 )
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en6 | ALuca_Rd | 2022-02-06 23:39:27 | 39 | Tiny change: 'ash; 5sec \n' -> 'ash; 5sec \n\nCompute the answer modulo 10^9 + 7. \n' | ||
en5 | ALuca_Rd | 2022-02-06 23:38:19 | 27 | Tiny change: ' ) / 2 )` \n' -> ' ) / 2 )` \n\nTime limit - 5sec \n' | ||
en4 | ALuca_Rd | 2022-02-06 21:40:47 | 8 | Tiny change: ', N * ( N — 1 ) / 2 )' -> ', N * ( N - 1 ) / 2 )' | ||
en3 | ALuca_Rd | 2022-02-06 21:40:21 | 9 | |||
en2 | ALuca_Rd | 2022-02-06 21:39:05 | 2 | Tiny change: '= 2 * 10^5\nM = min(' -> '= 2 * 10^5, \nM = min(' | ||
en1 | ALuca_Rd | 2022-02-06 21:37:57 | 282 | Initial revision (published) |
Name |
---|