Обсуждение @ 1333. Джинн-бомбардировки 2 @ Timus Online Judge

Test#10 OR Can it be solved with monte carlo alogrithm?

Послано Alex Svetkin [OrelSTU] 19 окт 2004 02:02

Can it be solved with monte carlo alogrithm?
I used 10^6 points for checking and got WA at test #10. Then changed number of points to 10^5 and still get WA#10.

Edited by author 19.10.2004 02:09

Monte Carlo. WA on #10 too. (+)

Послано Maigo Akisame (maigoakisame@yahoo.com.cn) 20 окт 2004 12:37

I cut the square into 10^5 stripes and WA #10. Then I magnified the picture by 10^4 times and changed real into extended, WA #10 still. Wrong test, or wrong algo?

Re: Monte Carlo. WA on #10 too. (+)

Послано Saturn (HUS) 20 окт 2004 16:53

I used 10^6 points checking and I got AC=)

Could you explain how? I get TLE.

Послано Maigo Akisame (maigoakisame@yahoo.com.cn) 21 окт 2004 04:26

Re: Test#10 OR Can it be solved with monte carlo alogrithm?

Послано PSV 5 окт 2006 21:18

Try to post your code I'm sure the problem there

Re: Test#10 OR Can it be solved with monte carlo alogrithm?

Послано Schullz 30 июл 2013 20:24

I've solved it with monte carlo alogrithm.
So, i can say that it is possible

Обсуждение задачи 1333. Джинн-бомбардировки 2