|  | 
|  | 
| | | Show all threads     Hide all threads     Show all messages     Hide all messages |  | TLE#16 | pashokts2001@gmail.com | 1279. Warehouse | 19 Feb 2021 00:21 | 1 |  | TLE#16 pashokts2001@gmail.com 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
 |  | WA# 21 | Anton [SUrSU] | 1279. Warehouse | 1 Dec 2020 00:25 | 4 |  | WA# 21 Anton [SUrSU] 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
Give me some tests Please!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.
Thank you very much, i did same mistake :D |  | Problem 1279 "Warehouse" has been rejudged | Vladimir Yakovlev (USU) | 1279. Warehouse | 3 Apr 2018 12:55 | 3 |  | New tests have been added. 95 authors have lost their AC.WowSuch an old problem and still you can add  new tests
when again rejudge ural 1394 and ural 1589 I belive my programme can be challenged |  | Is there anything speciale in tests 13? | Alexey | 1279. Warehouse | 13 Apr 2010 12:58 | 3 |  | 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
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.This test helped me a lot.
 2 2 10
 1 3
 2 4
 
 Output is: 5
 |  | Let sorting will help to you :) | Oleg Strekalovsky [Vologda SPU] | 1279. Warehouse | 25 Apr 2009 16:59 | 1 |  |  
 Edited by author 25.04.2009 17:00
 |  | read this if u get wa | marius dumitran | 1279. Warehouse | 23 Oct 2007 03:06 | 1 |  | 1 2 11 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.....
 |  | Hint | Sota | 1279. Warehouse | 16 Sep 2007 13:43 | 1 |  | Hint Sota 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
 |  | Please help me! I don't understand where is an error in my prog | Pasha | 1279. Warehouse | 21 Jul 2004 17:45 | 2 |  | 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?
You must write the minimum height. In your case this is 2 | 
 | 
 | 
|