11237 - Halloween treats

[eonx]

Could somebody post any hint how to solve this problem without exceeding time limit ?

[mf]

Hint: n >= c.

Bigger hint: the solution is always possible. Think about partial sums of a's and the pigeonhole principle.

[shakil]

I also get TLE. How i can improve....

Code: Select all

Cut after AC . I did not read the problem clearly.

[mf]

Well you might start by learning some good indentation style and posting comments about what your code is doing.

Edit: your algorithm is clearly inefficient. Try any big input.

[hamedv]

I got TLE

can any one explain his algorithm

[rio]

mf had gived us good hint.

Heres a little io test. You may notice something (Think why my code outputs different from sample io ... and try to make a supposition..
Input

Code: Select all

6 7
1 3 2 8 11 3 9
4 5
1 2 3 7 5
3 6
7 11 2 5 13 17
0 0

Output

Code: Select all

1 2 3
2 3 4
1 2

----
Rio

[yiuyuho]

Hint: n >= c.

Bigger hint: the solution is always possible. Think about partial sums of a's and the pigeonhole principle.

Wow, I wouldn't have come up with that in a million years. Thanks for the hint mf!

[abmargb]

Is the most efficient solution O(c) ?

[masteringminds]

Hello,

Sorry I m really a novice here, but i m asking about: what do u mean by partial sums of a's???

Thanks

[mf]

Sorry I m really a novice here, but i m asking about: what do u mean by partial sums of a's???

The sequence 0, a[0], a[0]+a[1], a[0]+a[1]+a[2], ...

[masteringminds]

Thanks very much..your hints were very helpful and I got it AC from the first time which is Weird!! But it was nice at the first day of the new year!!

Thanks again,

[primeobject]

A easy problem...
only coding style is gonna save you... same methodology can bring you TLE or top ten(10) ranking based on how you code