| ENG RUS | Timus Online Judge |
Discussion of Problem 1358. CablesGleb WA16 // Problem 1358. Cables 28 Jul 2018 19:48 This test helped me to get ac after wa16: 5 1 2 1 3 2 5 3 4 yifei To Admins [2] // Problem 1358. Cables 12 Apr 2006 06:35 Can the coordinates be negative integers? Giorgi Saghinadze (Tbilisi SU) Re: To Admins [1] // Problem 1358. Cables 9 Mar 2007 04:47 yes, coordinates may be negative and this problem is very very easy :) Sq1 Re: To Admins // Problem 1358. Cables 15 Aug 2017 23:41 This makes the problem much easier. Can anyone share the solution without this condition? Felix_Mate Thanks to authors!!! I like this problem! // Problem 1358. Cables 16 Aug 2015 19:58 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 TTTD Why WA#4? // Problem 1358. Cables 2 Sep 2014 20:05 hoan note for WA#3 [1] // Problem 1358. Cables 6 Dec 2010 20:24 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 ANDREY TRUBIN Re: note for WA#3 // Problem 1358. Cables 29 Jul 2012 16:04 two tests 2 1 2 and 2 2 1 muhammad Why? // Problem 1358. Cables 11 Feb 2011 16:13 I do not know why I got AC !!! why log doesn't work and exp works? M@STeR.SoBG 2Admins [1] // Problem 1358. Cables 12 Jun 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?? Sandro (USU) Re: 2Admins // Problem 1358. Cables 13 Jun 2008 01:12 The correct version was the russian one. The english version is fixed. Thank you. tantian What does this problem mean? // Problem 1358. Cables 9 Aug 2007 07:54 What's the task? Could you help me? +FAMAS+ ADMINS [7] // Problem 1358. Cables 16 Jan 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 jedimastex Re: ADMINS [6] // Problem 1358. Cables 16 Jan 2006 15:43 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 +FAMAS+ THEY PARALLEL, THEY DIDN'T CROSS. [5] // Problem 1358. Cables 16 Jan 2006 15:59 Aydarkanov Tair OKTL No subject [2] // Problem 1358. Cables 16 Jan 2006 16:44 Potmu chto ti dibil Aydarkanov Tair OKTL tupoy [1] // Problem 1358. Cables 16 Jan 2006 16:44 potomu chto ti tupoy +FAMAS+ УСКОГЛАЗЫЙ ЧМО ЗАТКНИСЬ, ОТМОЙСЯ ОТ ГУТАЛИНА // Problem 1358. Cables 16 Jan 2006 16:56 ЕСЛИ Я ТУПОЙ, ТО ТЫ ТОГДА КТО? БЫЧАРА. РОГА ТО ПООБЛОМАЮ jedimastex Re: THEY PARALLEL, THEY DIDN'T CROSS. [1] // Problem 1358. Cables 16 Jan 2006 19:46 Нам нужно соединить 1 и 3, 1 и 2 компьютеры. Если мы расположим iый компьютер в точке (i-1,i-1), два отрезка (0,0)-(2,2) и (1,1)-(2,2) будут пересекаться по отрезку. +FAMAS+ да я просто думаю, // Problem 1358. Cables 16 Jan 2006 20:42 что пересечение всегда выражается точкой, а если взять точки i i то они будут накладываться друг на друга. да фиг с ним короче, всё равно я её решил, она и так простая. Vladimir Yakovlev (USU) Problem 1358 rejudged // Problem 1358. Cables 23 Mar 2005 22:54 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
|