weak test data or weak algorithm analysis? - Codeforces

→ Pay attention

Before contest
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
33:41:15
Register now »

*has extra registration

→ Top rated

#	User	Rating
1	tourist	4009
2	jiangly	3823
3	Benq	3738
4	Radewoosh	3633
5	jqdai0815	3620
6	orzdevinwang	3529
7	ecnerwala	3446
8	Um_nik	3396
9	ksun48	3390
10	gamegame	3386

Countries | Cities | Organizations

→ Top contributors

#	User	Contrib.
1	cry	167
2	Um_nik	163
3	maomao90	162
3	atcoder_official	162
5	adamant	159
6	-is-this-fft-	158
7	awoo	157
8	TheScrasse	154
9	Dominater069	153
9	nor	153

View all →

→ Find user

→ Recent actions

Detailed →

weak test data or weak algorithm analysis?

Revision en7, by NikaraBika, 2017-09-08 10:07:00

Hello :)
This(14612490) is a brute force solution for 506D - Mr. Kitayuta's Colorful Graph and it's time complexity is absolutely O(n^2). (n <= 100 * 1000)
I submitted it and got AC!
Could someone help me? Why did it happen? Weak test data or fast servers?
(That code must get TLE if we give it a path of size 100 * 1000 and all edges with the same color without any query)

Tags

tle, analysis of problem

History

Revisions

	Rev.	Lang.	By	When	Δ	Comment
	en7		NikaraBika	2017-09-08 10:07:00	62
	en6		NikaraBika	2015-12-02 22:14:32	36
	en5		NikaraBika	2015-12-02 08:56:26	7	Tiny change: 'Hello\nThis([su' -> 'Hello :)<br>\nThis([su'
	en4		NikaraBika	2015-12-02 08:52:20	2
	en3		NikaraBika	2015-12-02 08:51:37	54
	en2		NikaraBika	2015-12-02 08:50:50	17
	en1		NikaraBika	2015-12-02 08:50:23	449	Initial revision (published)