| ENG RUS | Timus Online Judge |
Обсуждение задачи 1333. Джинн-бомбардировки 2MYLS Doubts about using the random number. [3] // Задача 1333. Джинн-бомбардировки 2 25 фев 2014 23:03 In my programme, I use 1000 000 random locations to check if the points are in the circle. At first, I wrote something like this: "double tx = ( double )( rand() % 101 ) / 100.0 ";(because: 0 ≤ x ≤ 1, -> rand() % 101 ∈[ 0, 100 ] );and just got WA...... Finally I changed the 101 into 100 and got AC; Can anyone tell me why 101 is incorrect? or it is actually right? Vedernikoff 'Goryinyich' Sergey (HSE: АОП) Re: Doubts about using the random number. [1] // Задача 1333. Джинн-бомбардировки 2 25 фев 2014 23:42 You're just lucky that in the second case you got AC - actually good tests will kill your second solution as well, because what you generate is random point on integer grid 100 x 100 and this is far from random real point. Good way of generating random point in unit square is doing double(rand()) / RAND_MAX for both coordinates - this will give you point close enough to truly random. MYLS Re: Doubts about using the random number. // Задача 1333. Джинн-бомбардировки 2 1 авг 2014 12:29 Thanks for your reply, I realize I have mixed up continuity and dispersion. :-） Dmi3Molodov Re: Don't use random numbers. // Задача 1333. Джинн-бомбардировки 2 8 июл 2026 16:57 This contradicts the condition of the task. It is ALWAYS required to have the correct answer. Use regular points. Nikita Mogilevets If you are too lazy to solve it yourself read that spoiler (deterministic algo) // Задача 1333. Джинн-бомбардировки 2 31 май 2017 12:26 You can just brute force all possible points on the grid. For every point check whether that point is under attack. So, your grid is just a SZ*SZ square matrix. SZ=200 is accurate enough, and even somewhat smaller values are OK. OIdiot I got AC(0.046s) by random algorithm. Any other algorithms? // Задача 1333. Джинн-бомбардировки 2 28 фев 2015 13:34 What about Simpson integration ? please. Alex Svetkin [INVENTOS] Test#10 OR Can it be solved with monte carlo alogrithm? [5] // Задача 1333. Джинн-бомбардировки 2 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 Maigo Akisame (maigoakisame@yahoo.com.cn) Monte Carlo. WA on #10 too. (+) [2] // Задача 1333. Джинн-бомбардировки 2 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? Saturn (HUS) Re: Monte Carlo. WA on #10 too. (+) [1] // Задача 1333. Джинн-бомбардировки 2 20 окт 2004 16:53 I used 10^6 points checking and I got AC=) Maigo Akisame (maigoakisame@yahoo.com.cn) Could you explain how? I get TLE. // Задача 1333. Джинн-бомбардировки 2 21 окт 2004 04:26 PSV Re: Test#10 OR Can it be solved with monte carlo alogrithm? // Задача 1333. Джинн-бомбардировки 2 5 окт 2006 21:18 Try to post your code I'm sure the problem there Schullz Re: Test#10 OR Can it be solved with monte carlo alogrithm? // Задача 1333. Джинн-бомбардировки 2 30 июл 2013 20:24 I've solved it with monte carlo alogrithm. So, i can say that it is possible Anuar Help, please! // Задача 1333. Джинн-бомбардировки 2 26 окт 2011 15:15 please, tell me how to solve this problem. I can't find right solution to this problem. MOPDOBOPOT (USU) WTF? [2] // Задача 1333. Джинн-бомбардировки 2 13 дек 2010 20:26 2 0.2 0.2 0.5 0.8 0.8 0.5 My accepted program returns 81, but the answer from statement is 80... Sandro (USU) Re: WTF? [1] // Задача 1333. Джинн-бомбардировки 2 13 дек 2010 21:49 "Precision of the result is required to be 1% or better." So answer 81 is OK. MOPDOBOPOT (USU) Re: WTF? // Задача 1333. Джинн-бомбардировки 2 15 дек 2010 20:03 Oh, OK! It's my permanent problem - don't reaв the statement. Leonid (SLenik) Andrievskiy WA #4.Can somebody help me? [Solved] [1] // Задача 1333. Джинн-бомбардировки 2 13 июн 2010 14:45 I'm using pure Monte-Carlo method. Here is my code (C#): [Code deleted by author] I've found my bug... P.S. For the pure Monte-Carlo method it is enough 10^5 points and Double type. Edited by author 13.06.2010 19:25 daftcoder [Yaroslavl SU] Re: WA #4.Can somebody help me? [Solved] // Задача 1333. Джинн-бомбардировки 2 28 авг 2010 04:40 100 * 100 pts are enough. Neizvestnii WhyCrash (floating-point invalid operation) test #10? // Задача 1333. Джинн-бомбардировки 2 17 май 2007 18:07 Sorry, I have AC! Edited by author 18.05.2007 17:10 Edited by author 18.05.2007 17:11 Romko [Lviv NU] Can anybody help me? I had WA#7 Look at my code: [3] // Задача 1333. Джинн-бомбардировки 2 28 янв 2007 00:42 [code deleted] Edited by author 28.01.2007 02:44 KirillB(Arkhangelsk - PomorSU) Re: Can anybody help me? I had WA#7 Look at my code: [2] // Задача 1333. Джинн-бомбардировки 2 28 янв 2007 02:22 It was really hard to understand your prog for me:) (use pascal:) try this test 0 Romko [Lviv NU] Re: Can anybody help me? I had WA#7 Look at my code: [1] // Задача 1333. Джинн-бомбардировки 2 28 янв 2007 02:39 Thank's a lot!!! I've got AC!!! But how I can to optimize my program? (My time 0.213) Romko [Lviv NU] Re: Can anybody help me? I had WA#7 Look at my code: // Задача 1333. Джинн-бомбардировки 2 28 янв 2007 02:44 :) Now I've got AC in 0.015 :) Thank's for help!!! ronobe (aka oberon) AC in 0.046 =) [3] // Задача 1333. Джинн-бомбардировки 2 6 мар 2005 03:13 subj =) qwerty My AC in 0.015. [2] // Задача 1333. Джинн-бомбардировки 2 7 мар 2005 13:51 - ronobe (aka oberon) Me too =) [1] // Задача 1333. Джинн-бомбардировки 2 7 мар 2005 15:42 779321 15:38:34 7 мар 2005 ronobe (aka oberon) 1333 C++ Accepted 0.015 107 КБ The time and exectness can be changed by one constant. In first AC submission it was 100000. In three next submissions this constant was lowered to 10000, 1000, 100 and I got AC too in 0.015... PSV Re: Me too =) // Задача 1333. Джинн-бомбардировки 2 5 окт 2006 21:20 that's boring. AC - is most wanted. Not in this problem... Edited by author 05.10.2006 21:29 Edited by author 05.10.2006 21:29 Sergeyev Alexander Почему нет сэмпла??? [1] // Задача 1333. Джинн-бомбардировки 2 16 окт 2004 14:36 С какой точностью выводить? PSV Re: Почему нет сэмпла??? // Задача 1333. Джинн-бомбардировки 2 5 окт 2006 21:16 One persent as written ;D Mingfei Li How to solve this problem? [10] // Задача 1333. Джинн-бомбардировки 2 24 окт 2004 19:32 Could anybody tell me the detail? Victor Barinov (TNU) Just check about 10^6 points from there square. (-) [3] // Задача 1333. Джинн-бомбардировки 2 24 окт 2004 22:14 Mingfei Li Re: Just check about 10^6 points from there square. (-) [2] // Задача 1333. Джинн-бомбардировки 2 25 окт 2004 07:36 Yeah,but how to present a circle? Kant SU of Russia: Roman Lipovsky Re: Just check about 10^6 points from there square. (-) [1] // Задача 1333. Джинн-бомбардировки 2 25 окт 2004 10:59 My program: count = 0; for X from 0.000 to 1.000 for Y from 0.000 to 1.000 if Point(X,Y) within some cirle then count := count+1 write(count/1000000*100); Mingfei Li Re: Just check about 10^6 points from there square. (-) // Задача 1333. Джинн-бомбардировки 2 25 окт 2004 13:41 Thank you. Kant SU of Russia: Roman Lipovsky Re: How to solve this problem? [1] // Задача 1333. Джинн-бомбардировки 2 24 окт 2004 22:49 Simplest solution: O(1000^2) works 0.39 seconds. Victor Barinov (TNU) It also works at O(100^2) // Задача 1333. Джинн-бомбардировки 2 24 окт 2004 23:38 Aydarkanov Tair OKTL Re: How to solve this problem? // Задача 1333. Джинн-бомбардировки 2 8 янв 2006 10:26 Aydarkanov Tair OKTL No subject // Задача 1333. Джинн-бомбардировки 2 8 янв 2006 10:26 Aydarkanov Tair OKTL Hello! [1] // Задача 1333. Джинн-бомбардировки 2 8 янв 2006 10:27 Aydarkanov Tair OKTL Hello! // Задача 1333. Джинн-бомбардировки 2 8 янв 2006 10:33 Why your name is Hybrid Theory? It's one of Linkin Park's albums(2000) Do you like Linkin Park? If you like it, then write me: \\tair_a@mail.ru \\fred007@mail.ru Yaroslavtsev Grigory (SpbSPU) What are the limitations for N? I think they must be written! [1] // Задача 1333. Джинн-бомбардировки 2 18 окт 2004 08:58 Vladimir Yakovlev (USU) N <= 10 // Задача 1333. Джинн-бомбардировки 2 18 окт 2004 09:06 Orenburg SU 2 Wrong tries // Задача 1333. Джинн-бомбардировки 2 16 окт 2004 16:17 Why we now have 10 tries instead of 5 as was before rejudging? Dmitry 'Diman_YES' Kovalioff. Retired Test #4 is incorrect! (+) [4] // Задача 1333. Джинн-бомбардировки 2 16 окт 2004 15:04 It contains only one digit - and this digit is 0, so n=0, so what should I output? I've tryed '0', '0.25' ,..., '2', '3', '4', '5', '6', '10', '99', '100', 'No solution', 'No', 'no', '0%', '0.00', '-1'... Nothing helps. What's wrong? KID Re: Test #4 is incorrect! (+) [3] // Задача 1333. Джинн-бомбардировки 2 16 окт 2004 15:20 Why do you think that test number 4 contains only zero (0)? Vladimir Yakovlev (USU) Test was deleted [2] // Задача 1333. Джинн-бомбардировки 2 16 окт 2004 15:23 Orenburg SU 2 No subject // Задача 1333. Джинн-бомбардировки 2 16 окт 2004 15:49 Edited by author 16.10.2004 16:20 KawaSaki Re:Re: Test was deleted // Задача 1333. Джинн-бомбардировки 2 16 окт 2004 15:54 <font color=#FF0000> ASD </font>
|