SHELL - Shell game
Your program is to play the traditional "shell" game (see Shell_game). The game is played as follows:
There is a person called an operator; he/she has 3 identical, non-transparent hollow objects - shells, and a metal ball, which he/she places under one of these objects. Then, the operator quickly swaps pairs of shells several times; if shells at positions A and B are swapped, and the ball is under the shell at position A, it moves under the shell at position B. In the end, you have to guess which shell the ball is under.
The shells are identical, and positions mean immediate position that you see (left will always denote the leftmost shell, not the shell that was leftmost in the beginning).
Input
The first line of input contains one string - "left", "center" or "right", denoting the position of the shell the ball is under in the beginning. The second line contains an integer N<=10, denoting the number of swaps. N lines follow, all of them contain 2 strings - positions of 2 shells which are swapped.
Output
Output position of the shell the ball is under after all swaps are performed.
Warning
Testing simulates the exact progress of an actual game! There are 10 testcases; in the last one only, N = 10. You're likely to get a WA on this last test case, even if your program seems correct. Remember, it's like an actual game!
Example
Input: left 2 left right right center Output: center
Explanation
In the beginning, the ball is under the left shell. After swap 1, it's under the right shell. After swap 2, it's under the center shell.
hide comments
Jakub ©afin:
2012-04-11 16:34:47
hendrik: if it should be moved to tutorial, why did less than 200 people solve it?
|
|
Vamsi Kavala:
2012-04-11 16:34:47
STUPID problem!! Don't waste your time solving this.. |
|
hendrik:
2012-04-11 16:34:47
Should be moved to tutorial. |
|
Rishi Mukherje:
2012-04-11 16:34:47
after so many WAs got AC..:)...the problem description is really good...:)..never clicked in my mind... Last edit: 2012-01-07 15:55:10 |
|
.:abacus:.:
2012-04-11 16:34:47
there were 2 more test cases in slovac version
|
|
Jakub ©afin:
2012-04-11 16:34:47
with or without comments' help? |
|
Secret:
2012-04-11 16:34:47
got AC in 1st time :P |
|
Jakub ©afin:
2012-04-11 16:34:47
I'm afraid I don't see it written anywhere that position can only be left/center/right, nor that you're supposed to output only left/center/right. If the ball has no valid position (if you choose left/center/right, your answer is wrong), then, in general, its position is something like dividing by zero in arithmetics. What is the correct, answer, then? It's silence, which, in this case, is an empty output file. That to my explanation about the way I understood the description.
|
|
conioh:
2012-04-11 16:34:47
thanx @XeRon!X got AC |
|
RAJDEEP GUPTA:
2012-04-11 16:34:47
Aman Kumar is right. There are 10 files. Not 10 test cases in a single file. |
Added by: | Xellos |
Date: | 2011-12-26 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All |
Resource: | people.ksp.sk/~acm |