|
|
| Показать все ветки Спрятать все ветки Показать все сообщения Спрятать все сообщения | | Great task | Hououin`~`Kyouma | 1358. Провода | 26 май 2024 21:19 | 3 | It would be interesting to solve such a problem on an arbitrary graph (not a tree) or to say that there is no solution for such a graph. it is well known problem. but its hard to implement. You should find a clique of size 5 or complete bipartite subgraph with size (3, 3). There is no solution if and only if there exist such subgraph or topologicaly equal to that(other vertex can adjust 2 dif. vertexes of such subgraph). I took lectures about that a long time ago. Can't find source now.
Edited by author 26.05.2024 21:22 | | WA16 | Gleb Koveshnikov | 1358. Провода | 28 июл 2018 19:48 | 1 | WA16 Gleb Koveshnikov 28 июл 2018 19:48 This test helped me to get ac after wa16:
5
1 2
1 3
2 5
3 4 | | To Admins | Jia Wang | 1358. Провода | 15 авг 2017 23:41 | 3 | Can the coordinates be negative integers? yes, coordinates may be negative and this problem is very very easy :) This makes the problem much easier. Can anyone share the solution without this condition? | | Thanks to authors!!! I like this problem! | __Andrewy__ | 1358. Провода | 16 авг 2015 19:58 | 1 | My algo works O(N). It's the fastest algo because the problem has O(N) data.
Edited by author 16.08.2015 20:04 | | Why WA#4? | TTTD | 1358. Провода | 2 сен 2014 20:05 | 1 | | | note for WA#3 | hoan | 1358. Провода | 29 июл 2012 16:04 | 2 | the distance between any pair of computer must greater than one, not between two pair which connect whit cable.
sorry for my poor english.
GOOD LUCK!!!
Edited by author 06.12.2010 20:26
Edited by author 06.12.2010 20:26 | | Why? | Radi Muhammad Reza | 1358. Провода | 11 фев 2011 16:13 | 1 | Why? Radi Muhammad Reza 11 фев 2011 16:13 I do not know why I got AC !!!
why log doesn't work and exp works? | | 2Admins | mastersobg | 1358. Провода | 13 июн 2008 01:12 | 2 | 2Admins mastersobg 12 июн 2008 21:18
>Результат
>N строк, в i-й строке находятся два действительных числа -
>координаты i-го компьютера. Координаты не должны по модулю превышать 1000.
>Output
>You should output N lines. In the ith line there should be
>two integers – coordinates of the ith computer. The coordinates shouldn’t exceed 1000.
As you see there is some differences between problem statements. What i should write to output: real or integer numbers?? The correct version was the russian one. The english version is fixed. Thank you. | | What does this problem mean? | tantian | 1358. Провода | 9 авг 2007 07:54 | 1 | What's the task?
Could you help me? | | ADMINS | +FAMAS+ | 1358. Провода | 16 янв 2006 20:42 | 8 | ADMINS +FAMAS+ 16 янв 2006 14:56 WHY THIS CODE DIDN'T GIVE AC?
VAR
N,I:INTEGER;
BEGIN
READLN(N);
FOR I:=0 TO N-1 DO WRITELN(I,' ',I);
END.
ВСЕ ПРОВОДА БУДУТ ПАРАЛЕЛЬНЫ, А ЗНАЧИТ НЕ БУДУТ ПЕРЕСЕКАТЬСЯ:)
SORRY, THIS RUSSIAN LANGUAGE But you forget to preserve the order of the computers.
Consider this test:
3
1 3
1 2
Your output
0 0
1 1
2 2
It's obviously incorrect.
Edited by author 16.01.2006 15:43 tupoy Aydarkanov Tair OKTL 16 янв 2006 16:44 ЕСЛИ Я ТУПОЙ, ТО ТЫ ТОГДА КТО? БЫЧАРА. РОГА ТО ПООБЛОМАЮ Нам нужно соединить 1 и 3, 1 и 2 компьютеры.
Если мы расположим iый компьютер в точке (i-1,i-1),
два отрезка (0,0)-(2,2) и (1,1)-(2,2) будут пересекаться по отрезку. что пересечение всегда выражается точкой,
а если взять точки i i то они будут накладываться друг на друга.
да фиг с ним короче, всё равно я её решил, она и так простая. | | Problem 1358 rejudged | Vladimir Yakovlev (USU) | 1358. Провода | 23 мар 2005 22:54 | 1 | A bug in a validator was found. It was fixed and problem was rejudged.
Many authors got WA now. Please, read problem statement more carefully |
|
|
|
