Have your Seat in the Cypher Code Apocalypse 3
Each team has _two_ participants who have to be at the venue in time. At least one of the teammates needs to reach the contest venue in time to book their preferred seat in the room. The participants can be anywhere in the University campus before the contest.
The two participants would start moving towards the venue at the same time. The length of each straight road between the turns and corners in the university is given. You have to tell out which member of each team will be able to book their teams' seats.
Each team will have their two lines of inputs for each of the member
. And the rest of the line would give $R$ distances $D$ that each participant have to cover to reach the venue.
Sample Input: 2
4 6 3 5 5
4 3 7 5 5
2 9 9
3 6 2 9
Sample Output: A
EXPLANATION: - There are $2$ teams.
- For team 1,
Member $A$ would cover distance 6->3->5->5->Venue
Member $B$ would have to go 3->7->5->5->Venue
- Clearly Member $A$ would reach first at the venue.
- Similarly, for team 2, Member B even with more turns has to cover less distance and hence would reach the venue first.
|Time Limit:||1 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.6, PYPY, CS2, RUBY, PHP, GO, NODEJS, HASK, rust, SCALA, swift, D, PERL, FORT, CAML, CLPS, PRLG, ST, NICE, LUA, BASH, LISP sbcl, LISP clisp, JS, TCL, kotlin, PERL6, CLOJ, COB|
Fetching successful submissions