ALIEN2 - Aliens at the train, again!

The Alien who doesn’t like to see humans has moved to an Urban City (Yes, a little ironic) and now she’s facing a double-train system, but still, the alien hates humans, so she wants to see the minimum quantity of people possible in her way to the university at the two trains.

The Alien has some sort of anthropophobia, this means she has a phobia to the people or the society, knowing this, she tells you that can only see K persons in the train, if she sees more than that, she will have a panic attack.

With her special powers, the alien knows how much people is on every station of the train A and the train B, she asked you to make a program that, given the number of people in the stations of the train A and B and the maximum number of people she wants to see, you give her the number of stations she will have to cross and the minimum persons found in those stations. Knowing that:

  • The Alien starts from train A or B (she can choose where to start) but from the station 1.
  • She can switch from train A or B or viceversa, if she does this, she will see Ai+Bi people, being “i” the station she’s at that moment.
  • If she sees strictly more persons than the specified, she will automatically exit the train.

INPUT:

The input will contain two integers N (1<=N<=10,000) and K (1<=65,000) being the number of stations and the maximum number of people that the alien wants to see, then, 2 lines will follow, each containing N integers separated by a single space denoting the number of people found in the j-th station of the i-th train. (1<=Ni<=100)

OUTPUT:

Two single numbers denoting the number of stations passed and the people seen.

 

SAMPLE DATA:

INPUT:

3 10

9 2 4

1 2 9

OUTPUT:

3 9

INPUT2:

5 10

1 7 1 1 1

2 2 2 2 2

OUTPUT2:

5 9

 

Explanation I/O 1: The alien starts at the train B station 1, she sees 1 people, she continues to the station 2 and then decides to change the train, the alien have seen 4 more people, and then she continues at the train A up to the station 3. At this point the Alien will see (1+4+4) people (9) and has passed 3 stations.


Added by:david_8k
Date:2012-01-22
Time limit:0.100s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64
Resource:Own Problem

hide comments
2014-01-14 23:13:39 Man Mohan Mishra
nice and easy.. :)
2014-01-12 15:59:29 $OURABH $UMAN
AC in 1st attempt :) !!
2014-01-03 11:52:47 SanchitK
note that in the output there will be space between the 'number of stations passed and the people seen'-got two WA because of that.
2013-07-18 12:24:58 P_Quantum
any tricky case...??

Edit: not a easy task...but finally accpted.. :)

Last edit: 2013-07-19 11:34:35
2013-06-08 06:23:55 Ouditchya Sinha
Not an easy one definitely. A lot of corner cases, finally AC! :)
2013-06-02 23:22:39 Lucifer Sam
Please provide test cases :( . Unable to solve it :(
2013-05-14 20:11:35 nagato
easy one...:)
2013-01-27 11:21:52 ɥsǝןǝǝu
same code in...
java -> TLE
c -> AC in 0.00
2012-11-12 07:30:32 abhay
simple DP :)
2012-08-19 20:34:37 Aradhya
very good problem..not for kids 1!
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.