zoj 3220

Killing Streak

---

Time Limit: 1 Second      Memory Limit: 32768 KB

---

Defense of the Ancients (DotA) is a custom scenario for Warcraft III. The objective of the scenario is to destroy the opponents' "Ancient". The two teams' ancients are heavily guarded structures at opposing corners of the map. Players use powerful units known as heroes, and are assisted by allied heroes and AI-controlled fighters called "creeps". As in role-playing games, players level up their hero and use gold to buy equipment during the mission.

Defense of the Ancients pits two teams of players against each other: the Sentinel and the Scourge. Players on the Sentinel team are based at the southwest corner of the map, and those on the Scourge team are based at the northeast corner. Each base is defended by towers and waves of units which guard the main paths leading to their base. In the center of each base is the "Ancient", a building that must be destroyed to win the game.

Each human player controls one Hero, a powerful unit with unique abilities. In Allstars, players on each side choose one of ninety-three heroes, each with different abilities and tactical advantages over other heroes. The scenario is highly team-oriented; it is difficult for one player to carry the team to victory alone. Nevertheless, some heroes, given enough time, can change the outcome single-handedly, while countering the opposing team's heroes. Defense of the Ancients allows up to ten players in a five versus five format and an additional two slots for referees or observers, often with an equal number of players on each side.

In order to win the game, killing is necessary. A killing Streak results when a single Hero accumulates multiple enemy hero kills without dying. The streak restarts upon the Hero's death to the enemy team, texts will show for every streak:

 

• "(name of player) has a Killing Spree!" for 3 kills.
• "(name of player) is Dominating!" for 4 kills.
• "(name of player) has a Mega Kill!" for 5 kills.
• "(name of player) is Unstoppable!" for 6 kills.
• "(name of player) is Wicked Sick!" for 7 kills.
• "(name of player) has a Monster Kill!!!" for 8 kills.
• "(name of player) is Godlike!" for 9 kills.
• "(name of player) is Beyond Godlike! Somebody kill him!!" for 10 kills and above. Although it is shown "Beyond Godlike! Somebody kill him!!", the game's voice actually says "Holy Shit!".

   

  Besides, there are some more interesting things, like "First Blood", "Double Kill!" and "Triple Kill!".

   

• "First Blood!"
  This results when one side executes the first hero kill in the game. The player who drew First Blood gains an extra 200 gold, and the text "(name of player) just drew First Blood!" is shown.

   

   

• Double Kill! / Triple Kill!
  A Double Kill results when two enemy heroes are killed by a single player in a short period of time. Triple Kill is the same, only when 3 or more enemy heroes are killed. Kills must be performed within 14 seconds after the last kill to trigger the text. It does not matter if you are killed during the time. When 4 or more heroes are killed, Triple Kill will just be repeated. The text is "(name of player) just got a Double Kill!" or "(name of player) just got a Triple Kill!". And you should notice, if one killing leads to two killing streak, the text of the "Double Kill! / Triple Kill!" always shows later.

   

  Now, if you have all the information about the killings, could you restore the texts which have been shown.

  Input

  The first line of the input is a single number T indicates the number of cases, there are at most 100 test cases. In each case, the killing information is like this:
  minute:second (name of player1) kills (name of player2)
  minute indicates the minutes the game had been player for, and second indicates the seconds. The name of player will less than 20 letters and there will be at most one kill in a single second. Each case will end with a line containing a single '#'. There will be less than 100 killings in a case.

  Output

  Restore the texts which have been shown. Output a blank line after each case.

  Sample Input

  2
  1:30 A kills B
  1:40 A kills C
  1:50 A kills D
  2:00 A kills E
  #
  10:00 vigoss kills tom
  10:29 vigoss kills mike
  10:14 vigoss kills peter
  #
  

  Sample Output

  A just drew First Blood!
  A just got a Double Kill!
  A has a Killing Spree!
  A just got a Triple Kill!
  A is Dominating!
  A just got a Triple Kill!
  
  vigoss just drew First Blood!
  vigoss just got a Double Kill!
  vigoss has a Killing Spree!
  
  //3220 Killing Streak 不会玩DOTA，吃亏了，还没有完成，没有时间了哈哈。
  #include <iostream>
  #include <map>
  using namespace std;
  
  struct Point
  {
  	int m;			//minus
  	int s;			//second
  	char p1[20];	//player1
  	char p2[20];	//plyaer2;
  };
  
  struct Player
  {
  	char cn[20];//player name
  	int lkm;	//last kill minus;
  	int lks;	//last kill seconds;
  	int tk;		//total kill number;
  	int ck;		//current sequential killing;
  };
  int cmp(const void * a, const void *b)
  {
  	Point x = *(Point*)a;
  	Point y = *(Point*)b;
  	if(x.m == y.m)
  		return x.s-y.s;
  	else
  		return x.m-y.m;
  }
  
  int main()
  {
  	char s[1000];
  	int T;
  	scanf("%d",&T);
  	Point f[100];
  	getchar();
  
  	char ks[][100] = 
  	{
  		"has a Killing Spree!",
  		"is Dominating!",
  		"has a Mega Kill!",
  		"is Unstoppable!" ,
  		"is Wicked Sick!" ,
  		"has a Monster Kill!!!",
  		"is Godlike!",
  		"is Beyond Godlike! Somebody kill him!!"
  	};
  	while(T--)
  	{
  		int n = 0;
  		map<char*,Player> m;
  		while(gets(s)&&strcmp(s,"#")!=0)
  		{
  			sscanf(s,"%d:%d %s kills %s",&f[n].m,&f[n].s,f[n].p1,f[n].p2);
  			Player p1;
  			Player p2;
  			if(m.find(f[n].p1)==m.end())
  			{				
  				strcpy(p1.cn,f[n].p1);
  				p1.ck = 1;	p1.tk = 1;
  				p1.lkm = f[n].m; p1.lks = f[n].s;
  				m[f[n].p1] = p1;
  			}
  			else
  			{			
  				strcpy(p1.cn,f[n].p1);
  				p1.ck++;	p1.tk++;
  				p1.lkm = f[n].m; p1.lks = f[n].s;
  				m[f[n].p1] = p1;
  			}
  			n++;			
  		}
  		printf("%s just drew First Blood!/n",f[0].p1);
  		qsort(f,n,sizeof(f[0]),cmp);
  		char cn[20];
  		// time difference;
  		int cm;
  		int cs;
  		m[f[0].p1].lkm = f[0].m;
  		m[f[0].p1].lks = f[0].s;
  		//m[f[0].p2].ck = 
  		for(int i = 1 ; i < n; i++)
  		{
  			if(strcmp(f[i-1].p1,f[i].p1)==0)
  			{
  				cm = f[i].m-m[f[i].p1].lkm;
  				cs = f[1].s-f[0].s;
  				if(cm>0||cs>14)