Codeforces Round #688 (Div. 2) Editorial - Codeforces

→ Pay attention

Before contest
Hello 2025
5 days

→ Streams

Advent of Code problem-solving

By Errichto

Stream is running

View all →

→ Top rated

#	User	Rating
1	tourist	3985
2	jiangly	3885
3	jqdai0815	3682
4	Benq	3580
5	orzdevinwang	3526
6	ksun48	3506
7	ecnerwala	3505
8	Radewoosh	3457
9	Kevin114514	3377
10	gamegame	3374

Countries | Cities | Organizations

→ Top contributors

#	User	Contrib.
1	cry	170
2	Um_nik	162
3	atcoder_official	161
4	maomao90	158
4	-is-this-fft-	158
6	djm03178	157
7	Dominater069	156
8	adamant	154
9	luogu_official	153
10	awoo	152

View all →

→ Find user

→ Recent actions

Detailed →

Codeforces Round #688 (Div. 2) Editorial

Revision en5, by djm03178, 2020-12-04 20:01:21

Tutorial is loading...

Solutions

Tutorial is loading...

Solutions - C++ - Java - Python 3

Tutorial is loading...

Solutions - C++ - Java - Python 3

Tutorial is loading...

Solutions - C++ - Java

Tutorial is loading...

Solutions - C++ - Java

Tutorial is loading...

Solutions - C++ - Java - Python 3

History

Revisions

	Rev.	Lang.	By	When	Δ	Comment
	en6		djm03178	2020-12-04 21:51:22	3	Tiny change: '03)\n- [O(nmlogn) (C++' -> '03)\n- [O((n+m)logn) (C++'
	en5		djm03178	2020-12-04 20:01:21	116
	en4		djm03178	2020-12-04 20:00:15	0	(published)
	en3		djm03178	2020-12-04 19:59:39	1379	Tiny change: '453A]\n* [$\mathcal{O}(nm)$ (C++)](ht' -> '453A]\n* [O(nm) (C++)](ht' (saved to drafts)
	en2		djm03178	2020-12-04 18:42:48	2559	(published)
	en1		djm03178	2020-12-04 18:40:04	2675	Initial revision (saved to drafts)