ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1333. Genie Bomber 2

Test#10 OR Can it be solved with monte carlo alogrithm?
Posted by Alex Svetkin [OrelSTU] 19 Oct 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. (+)
Posted by Maigo Akisame (maigoakisame@yahoo.com.cn) 20 Oct 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. (+)
Posted by Saturn (HUS) 20 Oct 2004 16:53
I used 10^6 points checking and I got AC=)
Could you explain how? I get TLE.
Posted by Maigo Akisame (maigoakisame@yahoo.com.cn) 21 Oct 2004 04:26
Re: Test#10 OR Can it be solved with monte carlo alogrithm?
Posted by PSV 5 Oct 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?
Posted by Schullz 30 Jul 2013 20:24
I've solved it with monte carlo alogrithm.
So, i can say that it is possible