|
|
| Показать все ветки Спрятать все ветки Показать все сообщения Спрятать все сообщения | | Happy Ending Problem | yyll | 1538. Сторожевые башни | 5 ноя 2021 13:44 | 1 | | | Error in the third test. | -XraY- | 1538. Сторожевые башни | 25 мар 2013 17:58 | 1 | There is some trash in the end of file. | | it's easy if you know... | MSDN | 1538. Сторожевые башни | 19 янв 2011 04:21 | 4 | 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 Thanks for 9 and for Ramsei. Owing to your post I've read something of theory of Ramsei. And I find it enough curious. Thanks for it. Thanks a lot. Very interesting theory. | | I CAN"T UNDERSTAND THIS PROBLEM | Micheal Jackson | 1538. Сторожевые башни | 6 янв 2011 15:51 | 1 | So, if the pigeon is black or white, how does this work?
Edited by author 06.01.2011 15:52 | | Good Problem=) (+) | Yurchuk Maxim, Rybinsk, Liceum #2 | 1538. Сторожевые башни | 28 дек 2008 21:53 | 1 | But what proove?
Edited by author 28.12.2008 23:42 | | What method complexity should be used?(+) | SPIRiT | 1538. Сторожевые башни | 11 сен 2008 18:33 | 7 | 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? O(1) :) (-) Dmitry 'Diman_YES' Kovalioff. On the brink of retirement 28 сен 2007 10:56 Is there really such an algo? You don't have to tell me the idea, just say that there is such an algo... Theoretically, O(C(5,N)), but in a practice - O(1) :) 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)... There exists an algorithm with O(N*h) complexity... | | Wa test 22 | MSDN | 1538. Сторожевые башни | 2 сен 2008 21:15 | 1 | | | Help on test22 | RP++ | 1538. Сторожевые башни | 18 янв 2008 05:11 | 1 | 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. | | Hint | Fyodor Menshikov | 1538. Сторожевые башни | 16 май 2007 05:44 | 1 | Hint Fyodor Menshikov 16 май 2007 05:44 [hint deleted]
Edited by moderator 16.05.2007 09:25 |
|
|
|
