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.
2 <= N <= 2 * 10^5,
M = min( 2 * 10^5, N * ( N - 1 ) / 2 )
# | User | Rating |
---|---|---|
1 | tourist | 3843 |
2 | jiangly | 3705 |
3 | Benq | 3628 |
4 | orzdevinwang | 3571 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3530 |
8 | ecnerwala | 3499 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 154 |
6 | maroonrk | 153 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
9 | orz | 145 |
10 | pajenegod | 144 |
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.
2 <= 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 |
---|