Help needed in Graph problem [1020B] - Codeforces

Please read the new rule regarding the restriction on the use of AI tools. ×

→ Pay attention

Before contest
Kotlin Heroes: Episode 11
15:05:38
Register now »

→ Top rated

#	User	Rating
1	tourist	4009
2	jiangly	3839
3	Radewoosh	3646
4	jqdai0815	3620
4	Benq	3620
6	orzdevinwang	3612
7	Geothermal	3569
7	cnnfls_csy	3569
9	ecnerwala	3494
10	Um_nik	3396

Countries | Cities | Organizations

→ Top contributors

#	User	Contrib.
1	Um_nik	164
2	maomao90	160
3	-is-this-fft-	159
4	atcoder_official	158
4	awoo	158
4	cry	158
7	adamant	155
8	nor	154
9	TheScrasse	153
10	maroonrk	152

View all →

→ Find user

→ Recent actions

Detailed →

Help needed in Graph problem [1020B]

Revision en2, by avdp, 2021-03-15 10:46:04

Guys can Someone give me O(N) approach for this problem as When I checked around 20-30 solutions all were O(N^2) so I need a code basically as I have some idea that If a node is in cycle then the answer is the node itself and else the answer is nearest node in a cycle.

Please help me implement code for O(N).

P.S. I checked that no blog exists on this problem and Please forgive me as I know this may be a NOOB doubt and I have started learning Graphs a week back only.

History

Revisions

	Rev.	Lang.	By	When	Δ	Comment
	en2		avdp	2021-03-15 10:46:04	169
	en1		avdp	2021-03-15 10:44:22	374	Initial revision (published)