Can we have better solution than O(n^2 log n) for the following problem 1.

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

→ Pay attention

Before contest
Codeforces Round 974 (Div. 3)
16:48:34
Register now »

→ Streams

Codeforces Round 974 Solution Discussion

By aryanc403

Before stream 19:13:34

View all →

→ Top rated

#	User	Rating
1	tourist	4009
2	jiangly	3773
3	Radewoosh	3646
4	ecnerwala	3624
5	jqdai0815	3620
5	Benq	3620
7	orzdevinwang	3612
8	Geothermal	3569
8	cnnfls_csy	3569
10	Um_nik	3396

Countries | Cities | Organizations

View all →

→ Top contributors

#	User	Contrib.
1	Um_nik	163
2	cry	161
3	maomao90	160
4	-is-this-fft-	159
5	awoo	158
6	atcoder_official	157
7	adamant	155
8	nor	154
9	maroonrk	152
10	Dominater069	148

View all →

→ Find user

→ Recent actions

I_Love_Diar_Narumov → Codeforces Round 973 (Div. 2)
purplesyringa → AI might erase CP, but not us
RobinFromTheHood → Codeforces Round 974 (Div. 3)
ycperson → Disproving the Necessity of IQ/Aptitude in Mastering Competitive Programming
SecondThread → Meta Hacker Cup 2024 Schedule — Introducing the Meta Hacker Cup AI Track
zhengqingyuan → Some useful conclution for some naive algorithms to solve number theory problem
1guptagaurav → Something i learned from today's contest
IF-THEN → Why isn't there some toggle button to turn on dark theme on Codeforces?
Um_nik → On AI ruining "solving math problems with computer"
dorjderem → Anyone who comments under this post has to reach CM by September if can't....
69eloChess → Extreme cheating today
ICPCNews → The 2024 ICPC World Finals Astana
MikeMirzayanov → Rule Restricting the Use of AI [revision 2024-09-14]
Petr → A baursak week
Yahia_Emara → Fun Fact
TheScrasse → Italian Olympiad in Informatics (OII) 2024 — Online Contest
JattzzKun → Can someone please explain what this checker comment means?
warmingcium → Welcome to CityUHK(DG) Programming Ranking Contest 2024!
peltorator → Ok, lets talk about cout.tie once and forever
WeakestTopology → Snapshot of finite calculus and using it to solve a 3000 rated problem
TuongOnArrival1 → About the real importance of maths in CP
TuongOnArrival1 → Youngest Grandmaster
Greem3 → Add friends in Codeforces
BiNARyBeastt → Codeforces Round 972 (Div. 2)
Negationist → How to improve implementation skills?

Detailed →

Can we have better solution than O(n^2 log n) for the following problem 1.

Revision en1, by pkpawan, 2022-06-21 18:32:15

Problem 1 from Past Online assesment of Citadel

History

Revisions

	Rev.	Lang.	By	When	Δ	Comment
	en1		pkpawan	2022-06-21 18:32:15	207	Initial revision (published)