Discussion @ 1028. Stars @ Timus Online Judge

Is it strange to such a prolem?

Posted by sony 4 Oct 2004 21:08

I only think of a O(N^2) algo for this problem.
At first,I wrote it in Pascal,But TLE.
And then,I wrote it in C,and got AC.
Who can do the explanation for me?
Thanks!

What is difference in time they worked?

Posted by Vlad Veselov [PMG17, Vinnitsa - KNU, Kiev] 5 Oct 2004 16:23

Re: What is difference in time they worked?

Posted by Sandro 11 Jul 2005 23:34

I got AC with N^2 CPP solution in 0.968 sec. Maybe judges should decrease the Time Limit.

My O(N^2) / 247 bytes on Delphi is 0.515 sec. (-)

Posted by Dmitry 'Diman_YES' Kovalioff 12 Jul 2005 09:01

Time limit was reduced (+)

Posted by Vladimir Yakovlev (USU) 25 Jul 2005 21:06

New time limit is 0.25 sec. Bruteforce gets TL now.
All recent submits were rejudged.

Discussion of Problem 1028. Stars