Segment tree for graph problems - Codeforces

→ Pay attention

Before contest
Educational Codeforces Round 173 (Rated for Div. 2)
40:31:37
Register now »

→ Streams

CF Edu Round 173 Solution Discussion

By aryanc403

Before stream 42:41:36

View all →

→ Top rated

#	User	Rating
1	tourist	3985
2	jiangly	3814
3	jqdai0815	3682
4	Benq	3529
5	orzdevinwang	3526
6	ksun48	3517
7	Radewoosh	3410
8	hos.lyric	3399
9	ecnerwala	3392
9	Um_nik	3392

Countries | Cities | Organizations

→ Top contributors

#	User	Contrib.
1	cry	169
2	maomao90	162
2	Um_nik	162
4	atcoder_official	161
5	djm03178	158
6	-is-this-fft-	157
7	adamant	155
8	awoo	154
8	Dominater069	154
10	luogu_official	150

View all →

→ Find user

→ Recent actions

Detailed →

Segment tree for graph problems

Revision en1, by Ashwanth.K, 2024-11-01 07:58:37

Recently I came across a new idea to solve graph related problems using segment trees, I would like to discuss the same with a problem.

Problem:

History

Revisions

	Rev.	Lang.	By	When	Δ	Comment
	en10		Ashwanth.K	2024-11-01 12:05:17	0	(published)
	en9		Ashwanth.K	2024-11-01 12:04:45	805	Tiny change: 'ch of the M lines con' -> 'ch of the $M$ lines con'
	en8		Ashwanth.K	2024-11-01 09:00:59	51	Tiny change: 'ke: \n[Imgur](https://' -> 'ke: \n[ ](https://'
	en7		Ashwanth.K	2024-11-01 08:44:57	96	Tiny change: ' \n ![ ](https://' -> ' \n ![](https://'
	en6		Ashwanth.K	2024-11-01 08:37:06	454
	en5		Ashwanth.K	2024-11-01 08:31:48	486
	en4		Ashwanth.K	2024-11-01 08:26:10	444
	en3		Ashwanth.K	2024-11-01 08:16:41	967	Tiny change: ' \n \nExample: \n \n' -> ' \n \nExample: \n \n'
	en2		Ashwanth.K	2024-11-01 08:04:24	508
	en1		Ashwanth.K	2024-11-01 07:58:37	187	Initial revision (saved to drafts)