| ENG RUS | Timus Online Judge |
Discussion of Problem 1279. Warehousepashokts2001@gmail.com TLE#16 // Problem 1279. Warehouse 19 Feb 2021 00:21 Does anyone have a clue on what test №16 is? If something, I am writing on Python. Edited by author 19.02.2021 02:12 Anton [SUrSU] WA# 21 [3] // Problem 1279. Warehouse 14 Jul 2006 03:18 Is it the same problem if I placed containers in linear massive? Edited by author 17.07.2006 18:02 Anton [SUrSU] Re: WA# 21 // Problem 1279. Warehouse 17 Jul 2006 18:02 Give me some tests Please! Loky Re: WA# 21 [1] // Problem 1279. Warehouse 20 Sep 2006 22:12 I had WA #21 too. But there was no something special, just stupid mistake. I stored the input not in Matrix, but in Array. And I filled it wrong; My wrong way: (in pascal) for i := 1 to n do for j := 1 to m do read(Mat[(i-1)*n + j]); My correct way: for i := 1 to n do for j := 1 to m do read(Mat[(i-1)*m + j]); May be it will help you. And here is test which helped me find my mistake: 2 3 6 1 1 1 1 1 1 Answer: 2. Shamov Roman Re: WA# 21 // Problem 1279. Warehouse 1 Dec 2020 00:25 Thank you very much, i did same mistake :D Vladimir Yakovlev (USU) Problem 1279 "Warehouse" has been rejudged [2] // Problem 1279. Warehouse 3 Apr 2018 04:54 New tests have been added. 95 authors have lost their AC. Mahilewets Nikita Re: Problem 1279 "Warehouse" has been rejudged [1] // Problem 1279. Warehouse 3 Apr 2018 09:21 Wow Such an old problem and still you can add new tests Shen Yang Re: Problem 1279 "Warehouse" has been rejudged // Problem 1279. Warehouse 3 Apr 2018 12:55 when again rejudge ural 1394 and ural 1589 I belive my programme can be challenged Alexey Is there anything speciale in tests 13? [2] // Problem 1279. Warehouse 9 May 2006 22:53 When I wrote my first version, I had TLE#13. I optimize it - Crash#13. Help me with tests or hints. Please. Thanks. Edited by author 10.05.2006 20:37 ASK Re: Is there anything speciale in tests 13? // Problem 1279. Warehouse 8 Mar 2010 02:29 I guess in this test one needs to add to the largest section (and N*M is not very small) -- I had a problem with 1e8 sentinel. MAK Re: Is there anything speciale in tests 13? // Problem 1279. Warehouse 13 Apr 2010 12:58 This test helped me a lot. 2 2 10 1 3 2 4 Output is: 5 Oleg Strekalovsky [Vologda SPU] Let sorting will help to you :) // Problem 1279. Warehouse 25 Apr 2009 16:59 Edited by author 25.04.2009 17:00 marius dumitran read this if u get wa // Problem 1279. Warehouse 23 Oct 2007 03:06 1 2 1 1 1 -> answer = 1 not 2.. final configuration 1 2 -> minimum 2.... i solved it 4 times thinking i was supose to find the minimal height of the stacks that have things added and one more thing test 13 100 100 99***** 1 1 1 1 1.......... .......... ........... 1 1 1 1 1..... Sota Hint // Problem 1279. Warehouse 16 Sep 2007 13:43 Let M be maximum of height. In case of h<=M and you think separately with in case of h>M. (h=answer) Case of h<=M, it tries putting. In case of h>M, remainder is distributed equally after putting. Edited by author 16.09.2007 13:47 Pasha Please help me! I don't understand where is an error in my prog [1] // Problem 1279. Warehouse 19 May 2004 22:04 If there is any secret in this problem? I have just reading all data in one-dimensional massive and fill it while there is any extra box. 10 boxes must be lay on this set: 1 1 1 1 2 2 2 3 3 3 3 3 and 10=> 2 2 2 2 2 2 2 3 3 3 3 3 and 6=> 3 3 3 3 3 3 2 3 3 3 3 3 and 0 Do I must write "2" or "3" ? Can somebody explain my mistake or give me a hint, please? Khlyzov Andrew Re: Please help me! I don't understand where is an error in my prog // Problem 1279. Warehouse 21 Jul 2004 17:45 You must write the minimum height. In your case this is 2
|