Players alternate, Alice moves first. Each turn a player picks any component and eliminates it from the exhibit. In the event that Alice picks even worth, she adds it to her score. On the off chance that the picked esteem is odd, Alice's score doesn't
Correct answer will be upvoted else Multiple Downvoted. Computer science.
Players alternate, Alice moves first.
Each turn a player picks any component and eliminates it from the exhibit.
In the event that Alice picks even worth, she adds it to her score. On the off chance that the picked esteem is odd, Alice's score doesn't change.
Essentially, on the off chance that Bob picks odd worth, he adds it to his score. On the off chance that the picked esteem is even, Bob's score doesn't change.
On the off chance that there are no numbers left in the cluster, the game finishes. The player with the most noteworthy score wins. Assuming the scores of the players are equivalent, a draw is announced.
For instance, assuming n=4 and a=[5,2,7,3], the game could go as follows (there are different choices):
On the principal move, Alice picks 2 and get two focuses. Her score is presently 2. The exhibit an is presently [5,7,3].
On the subsequent move, Bob picks 5 and get five focuses. His score is presently 5. The exhibit an is presently [7,3].
On the third move, Alice picks 7 and get no focuses. Her score is presently 2. The exhibit an is presently [3].
On the last move, Bob picks 3 and get three focuses. His score is currently 8. The cluster an is vacant at this point.
Since Bob has more focuses toward the finish of the game, he is the victor.
You need to discover who will win if the two players play ideally. Note that there might be copy numbers in the exhibit.
Input
The main line contains an integer t (1≤t≤104) — the number of experiments. Then, at that point, t experiments follow.
The main line of each experiment contains an integer n (1≤n≤2⋅105) — the number of components in the exhibit a.
The following line contains n integers a1,a2,… ,an (1≤
It is ensured that the amount of n over all experiments doesn't surpass 2⋅105.
Output
For each experiment, output on a different line:
"Alice" if Alice wins with the ideal play;
"Sway" if Bob wins with the ideal play;
"Tie", if a tie is proclaimed during the ideal play.
Step by step
Solved in 4 steps with 1 images
