ARMY - Army Strength
The next MechaGodzilla invasion is on its way to Earth. And once again, Earth will be the battleground for an epic war.
MechaGodzilla's army consists of many nasty alien monsters, such as Space Godzilla, King Gidorah, and MechaGodzilla herself.
To stop them and defend Earth, Godzilla and her friends are preparing for the battle.
Each army consists of many different monsters. Each monster has a strength that can be described by a positive integer. (The larger the value, the stronger the monster.)
The war will consist of a series of battles. In each battle, the weakest of all the monsters that are still alive is killed.
If there are several weakest monsters, but all of them in the same army, one of them is killed at random. If both armies have at least one of the weakest monsters, a random weakest monster of MechaGodzilla's army is killed.
The war is over if in one of the armies all monsters are dead. The dead army lost, the other one won.
You are given the strengths of all the monsters. Find out who wins the war.
The first line of the input file contains an integer T specifying the number of test cases. Each test case is preceded by a blank line.
Each test case starts with line containing two positive integers NG and NM – the number of monsters in Godzilla's and in MechaGodzilla's army. Two lines follow. The first one contains NG positive integers – the strengths of the monsters in Godzilla's army. Similarly, the second one contains NM positive integers – the strengths of the monsters in MechaGodzilla's army.
For each test case, output a single line with a string that describes the outcome of the battle.
If it is sure that Godzilla's army wins, output the string "Godzilla".
If it is sure that MechaGodzilla's army wins, output the string "MechaGodzilla".
Otherwise, output the string "uncertain".
input: 2 1 1 1 1 3 2 1 3 2 5 5 output: Godzilla MechaGodzilla
In the first test case, there are only two monsters, and they are equally strong. In this situation, MechaGodzilla's monster is killed and the war ends.
In the second test case, the war will consist of three battles, and in each of them one of Godzilla's monsters dies.
For all the test cases, int in C/C++/Java or longint in Pascal is enough.
just take max of both and compare!!
simplest question on spoj Ac in one go
Simple IF-ELSE question!
A great example to implement priority queue (heap)Last edit: 2019-04-27 16:11:17
no uncertain case. Just find the strongest between both armies and AC. Use BufferedReader instead of Scanner in Java. Costed me 2 TLEs.
python user use heapq from standard libraray no use of uncertain
doesn't need sorting or array just simple implementation. btw I did spelling mistake and got W/A. :P
Accepted in 0.1 time, how can I reduce it ? I am comparing each element to max while taking input , how can it be any faster ? ( People have got AC in 0.0 time ...)
I forgot to print "uncertain" but I got AC!! Don't know why they mentioned "uncertain" in the question!!