| ENG RUS | Timus Online Judge |
Обсуждение задачи 1538. Сторожевые башниyyll Happy Ending Problem // Задача 1538. Сторожевые башни 5 ноя 2021 13:44 -XraY- Error in the third test. // Задача 1538. Сторожевые башни 25 мар 2013 17:58 There is some trash in the end of file. MSDN it's easy if you know... [3] // Задача 1538. Сторожевые башни 3 фев 2009 14:53 There is theory of Ramsei. if you want 4 you need 5 points. if you want 5 you need 9 points. Edited by author 03.02.2009 14:53 svr Re: it's easy if you know... // Задача 1538. Сторожевые башни 3 фев 2009 20:23 Thanks for 9 and for Ramsei. xEugene Re: it's easy if you know... [1] // Задача 1538. Сторожевые башни 21 авг 2009 03:08 Owing to your post I've read something of theory of Ramsei. And I find it enough curious. Thanks for it. Oracle[Lviv NU] Re: it's easy if you know... // Задача 1538. Сторожевые башни 19 янв 2011 04:21 Thanks a lot. Very interesting theory. Micheal Jackson I CAN"T UNDERSTAND THIS PROBLEM // Задача 1538. Сторожевые башни 6 янв 2011 15:51 So, if the pigeon is black or white, how does this work? Edited by author 06.01.2011 15:52 Yurchuk Maxim, Rybinsk, Liceum #2 Good Problem=) (+) // Задача 1538. Сторожевые башни 28 дек 2008 21:53 But what proove? Edited by author 28.12.2008 23:42 SPIRiT What method complexity should be used?(+) [6] // Задача 1538. Сторожевые башни 27 сен 2007 21:00 According to the time limit and N size we cannot use O(N^3). Therefore it should be O(N^2) or O(N^2*lnN). What's the trick? O(N^2) - it's just to select two points. How to find other three quickly? Perhaps they should be chosen randomly? Or maybe we should use Graham scan as many times as possible, to see what we get? Dmitry 'Diman_YES' Kovalioff. On the brink of retirement O(1) :) (-) [3] // Задача 1538. Сторожевые башни 28 сен 2007 10:56 SPIRiT Re: O(1) :) (-). Was that a joke?(+) [2] // Задача 1538. Сторожевые башни 28 сен 2007 15:04 Is there really such an algo? You don't have to tell me the idea, just say that there is such an algo... Vedernikoff Sergey Re: O(1) :) (-). Was that a joke?(+) // Задача 1538. Сторожевые башни 29 сен 2007 16:46 Theoretically, O(C(5,N)), but in a practice - O(1) :) SPIRiT For a polygon with 4 vertices you need just 5. // Задача 1538. Сторожевые башни 1 окт 2007 18:47 I thought about this problem. It can be proven, that you can build a polygon with 4 vertices from any 5 that don't lie on the same line (that is one of the statements). How many vertices does one need to build a 5 vertex convex polygon (I think about 10 or 15)... ibm Re: What method complexity should be used?(+) [1] // Задача 1538. Сторожевые башни 6 мар 2008 00:19 There exists an algorithm with O(N*h) complexity... Denis Koshman Re: What method complexity should be used?(+) // Задача 1538. Сторожевые башни 11 сен 2008 18:33 I have O(1) complexity MSDN Wa test 22 // Задача 1538. Сторожевые башни 2 сен 2008 21:15 Help... RP++ Help on test22 // Задача 1538. Сторожевые башни 18 янв 2008 05:11 I WA on Test22 for many times...I don't why... Anyone can tell me what special things in the Test22,or give me the data to my Email:zej88889@163.com Thanks. Fyodor Menshikov Hint // Задача 1538. Сторожевые башни 16 май 2007 05:44 [hint deleted] Edited by moderator 16.05.2007 09:25
|