Discussion @ 1756. One and a Half Diggers @ Timus Online Judge

Stankov WA #9 [3] // Problem 1756. One and a Half Diggers 13 Mar 2010 15:21

I have Wa #9 please give some tests

Oleg Strekalovsky [Vologda SPU] Re: WA #9 [1] // Problem 1756. One and a Half Diggers 26 Apr 2010 19:57

Try to find minimum amount of peoples with complexity o(1) like that:
      if ((m * d1) % d2 == 0) {
         b = (m * d1) / d2;
      } else {
         b = (m * d1) / d2 + 1;
      }

Edited by author 26.04.2010 19:58

Petru Trimbitas Re: WA #9 // Problem 1756. One and a Half Diggers 2 Oct 2011 00:44

i've changed
        for(int j=1; j<=i; ++j) cout<<floor(fr)<<' ';
        for(int j=i+1; j<=d2; ++j) cout<<ceil(fr)<<' ';

to
        for(int j=1; j<=i; ++j) cout<<fixed<<setprecision(0)<<floor(fr)<<' ';
        for(int j=i+1; j<=d2; ++j) cout<<fixed<<setprecision(0)<<ceil(fr)<<' ';

Pavel Re: WA #9 // Problem 1756. One and a Half Diggers 5 Jul 2021 02:03

try bigger numbers

insi Test [10] // Problem 1756. One and a Half Diggers 13 Mar 2010 14:44

I have WA #2 ..

Can somebody give me some tests, please ?:)

Edited by author 13.03.2010 14:57

Smilodon_am Re: Test [9] // Problem 1756. One and a Half Diggers 13 Mar 2010 15:00

5 2 3
Ans: 3 3 4

5 6 4
Ans: 7 7 8 8

insi Re: Test [5] // Problem 1756. One and a Half Diggers 13 Mar 2010 15:03

My program:

5 2 3 -> 1 1 8

5 6 4 -> 1 1 1 27

Are these answers correct ?

Stankov Re: Test [2] // Problem 1756. One and a Half Diggers 13 Mar 2010 15:20

Azeri91 Re: Test [1] // Problem 1756. One and a Half Diggers 24 Mar 2010 12:53

Why it isn't correct?

staticor Re: Test // Problem 1756. One and a Half Diggers 7 Jul 2013 22:37

find less diggers solution

Azeri91 Re: Test // Problem 1756. One and a Half Diggers 24 Mar 2010 12:53

I think it is correct

Mohan Re: Test // Problem 1756. One and a Half Diggers 27 Sep 2014 11:18

insi your answers are not correct. You need to keep an even distribution.

Edited by author 27.09.2014 11:20

Edited by author 27.09.2014 11:21

Yashar Abbasov Re: Test [2] // Problem 1756. One and a Half Diggers 13 Apr 2010 02:03

for test 5 6 4 is answer 7 7 7 9 correct?

Edited by author 13.04.2010 02:05

Edited by author 13.04.2010 02:05

dAFTc0d3r [Yaroslavl SU] Re: Test // Problem 1756. One and a Half Diggers 13 Apr 2010 22:23

No.
8 8 7 7 id correct.
Because max(7,7,7,9) = 9 > 8 = max(8,8,7,7)
and we need to minimize that max.

maslowmw Re: Test // Problem 1756. One and a Half Diggers 7 May 2020 22:35

Also acceptable answer: 8 8 8 6

Flint Storman -> Tests [1] // Problem 1756. One and a Half Diggers 16 Sep 2012 18:56

Hope it will help:

5 5 6
5 5 5 5 5 0

2 5 4
3 3 3 1

41 17 16
44 44 44 44 44 44 44 44 44 44 44 44 44 44 44 37

41 17 15
47 47 47 47 47 47 47 47 47 47 47 47 47 47 39

31 13 20
21 21 21 21 21 21 21 21 21 21 21 21 21 21 21 21 21 21 21 4

3 3 6
2 2 2 2 1 0

5 6 4
8 8 8 6

5 2 3
4 4 2

3 2 9
1 1 1 1 1 1 0 0 0

3 4 10
2 2 2 2 2 2 0 0 0 0

2 3 9
1 1 1 1 1 1 0 0 0

6 2 13
1 1 1 1 1 1 1 1 1 1 1 1 0

4 5 10
2 2 2 2 2 2 2 2 2 2

[RISE] Levon Oganesyan [RAU] Another answers for this tests from AC program // Problem 1756. One and a Half Diggers 24 Jul 2014 10:08

This answers for tests right too.

5 5 6
5 4 4 4 4 4

2 5 4
3 3 2 2

41 17 16
44 44 44 44 44 44 44 44 44 43 43 43 43 43 43 43

41 17 15
47 47 47 47 47 47 47 46 46 46 46 46 46 46 46

31 13 20
21 21 21 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20

3 3 6
2 2 2 1 1 1

5 6 4
8 8 7 7

5 2 3
4 3 3

3 2 9
1 1 1 1 1 1 0 0 0

3 4 10
2 2 1 1 1 1 1 1 1 1

2 3 9
1 1 1 1 1 1 0 0 0

giorgi "It is possible that on some days nobody will work" [2] // Problem 1756. One and a Half Diggers 23 Dec 2011 15:51

so in every case diggers can work only 1th day and after that just place 0?

panhantao Re: "It is possible that on some days nobody will work" // Problem 1756. One and a Half Diggers 19 Apr 2012 00:03

In most of the cases, no
because the statement says you should finish the work with a minimal number of diggers

Pegasus Re: "It is possible that on some days nobody will work" // Problem 1756. One and a Half Diggers 24 Oct 2012 19:06

I first do this just output m*d1, 0
but its wrong

Afli WA#6. What's wrong? // Problem 1756. One and a Half Diggers 6 Oct 2012 01:26

i found the mistake.

Edited by author 07.10.2012 17:02

Edited by author 07.10.2012 17:34

Marat WA #3 [5] // Problem 1756. One and a Half Diggers 21 Jul 2011 17:35

Give me some tests, please.

Lucian Ilea Re: WA #3 [4] // Problem 1756. One and a Half Diggers 2 Aug 2011 17:12

I think the reason for WA3 is in the following test
5 6 4
The evaluator accepts 8 8 7 7 but not 8 8 8 6.

rakeshvarna Re: WA #3 // Problem 1756. One and a Half Diggers 24 Aug 2011 21:03

But why is 8 8 8 6 wrong. The max is still only 8.

ucs6 Re: WA #3 [2] // Problem 1756. One and a Half Diggers 16 Sep 2011 04:33

My program outputs 8 8 8 6 and got AC

sbidujko Re: WA #3 [1] // Problem 1756. One and a Half Diggers 4 Apr 2012 01:19

I had the same error. The mistake was in logic.
In test 3 3 6 I had 2 2 2 2 1 1 but correct answer is 2 2 2 2 1 0 ,of course.

panhantao Re: WA #3 // Problem 1756. One and a Half Diggers 19 Apr 2012 00:21

I think you are right.
but my program which WA#3 output 1 2 1 2 1 2 in test 3 3 6,I think it's right,too....

Abbasi Complete and Correct solution of this Problem // Problem 1756. One and a Half Diggers 18 Mar 2012 15:19

kindly provide me the correct solution of this in c#.

Anton Hint // Problem 1756. One and a Half Diggers 27 Jan 2012 09:25

m * d1 is count of men needed to complete work in 1 day. You should divide this count into d2 days. On obvious way to do it with min men per day is to add men equally to d2 days one-by-one, while total men count is not 0.

Mehemmed Veliyev[Azerbaijan] No subject [1] // Problem 1756. One and a Half Diggers 30 Dec 2011 01:05

I don't understand
do i output 0 ,if on same days diggers don't work ?

Edited by author 30.12.2011 01:10

Mehemmed Veliyev[Azerbaijan] Re: No subject // Problem 1756. One and a Half Diggers 30 Dec 2011 01:11

I got WA 5

smolcoder If you have WA #15 // Problem 1756. One and a Half Diggers 22 Aug 2010 06:07

2 3 9
ans.: 1 1 1 1 1 1 0 0 0
NOT simple 1 1 1 1 1 1

awpris Clarification conditions // Problem 1756. One and a Half Diggers 15 Mar 2010 02:51

Question removed

Edited by author 15.03.2010 03:09

Style: flat | tree | nested
Thread Order: bubble | fixed

Discussion of Problem 1756. One and a Half Diggers