301058: CF200C. Football Championship

Memory Limit:256 MB Time Limit:2 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Football Championship

题意翻译

这个题目是说,Berland的国家队成功加入一场足球联赛的半决赛。下面是球赛的规则: **·** 两队比赛,比赛结束后哪支队伍进的球比对方队伍多,哪方获胜。 **·** 胜利得3分,平局两队各得1分,失败不得分(得0分)。 **·** 这四队中得到第一或第二的队伍进入下一轮。 每个队伍的名次是由总得分来算的:分越多,名次越高。如果两个队伍有同样的分,以下列方式来决定高低(越靠前的规则越优先考虑,如果还是不能分出高低,再往下判断。下列第一个权重最高): **·** 每个队的进球数减去失球数,得到的结果越高排名就越高。 **·** 总进球数越高,排名就越高。 **·** 如果以上都不行的话,则以字典序排列。 现在还有一场比赛未打。一共6场比赛,已知前五场的队伍与得分。某个队伍和Berland还没交战。教练想让你找到如此X:Y(X是Berland的得分,Y是另一只球队的得分),可以满足下列条件: **·** X>Y,Berland得赢; **·** Berland赢后,得进前二名; **·** 如果不止一种答案,尽可能让X-Y小; **·** 如果还是有很多答案(不止一个),你应该让Y尽可能小。 输入格式: 一共有五行。 每一行都是以“team1 team2 goals1:goals2”(没引号)形式出现。表示team1跟team2交战一局。team1进了goal1个球,team2进了goal2个球。team1和team2都是非空字符串,并且都是大写字母,总长度不超过20。goal1和goal2都是0~9的正整数。 Berland队名字是"BERLAND"。保证只有Berland和另一支队伍打了2场比赛,其他队打了3场。 输出格式: 输出比分X:Y。X是Berland分数,Y是另一只球队的分数。如果怎么样也无法得到第一或第二,输出一行"IMPOSSIBLE"(没引号)。 提示:最后一场分数也不一定小,比如10:0这种情况。

题目描述

Any resemblance to any real championship and sport is accidental. The Berland National team takes part in the local Football championship which now has a group stage. Let's describe the formal rules of the local championship: - the team that kicked most balls in the enemy's goal area wins the game; - the victory gives 3 point to the team, the draw gives 1 point and the defeat gives 0 points; - a group consists of four teams, the teams are ranked by the results of six games: each team plays exactly once with each other team; - the teams that get places 1 and 2 in the group stage results, go to the next stage of the championship. In the group stage the team's place is defined by the total number of scored points: the more points, the higher the place is. If two or more teams have the same number of points, then the following criteria are used (the criteria are listed in the order of falling priority, starting from the most important one): - the difference between the total number of scored goals and the total number of missed goals in the championship: the team with a higher value gets a higher place; - the total number of scored goals in the championship: the team with a higher value gets a higher place; - the lexicographical order of the name of the teams' countries: the country with the lexicographically smaller name gets a higher place. The Berland team plays in the group where the results of 5 out of 6 games are already known. To be exact, there is the last game left. There the Berand national team plays with some other team. The coach asks you to find such score $ X $ : $ Y $ (where $ X $ is the number of goals Berland scored and $ Y $ is the number of goals the opponent scored in the game), that fulfills the following conditions: - $ X $ > $ Y $ , that is, Berland is going to win this game; - after the game Berland gets the 1st or the 2nd place in the group; - if there are multiple variants, you should choose such score $ X $ : $ Y $ , where value $ X-Y $ is minimum; - if it is still impossible to come up with one score, you should choose the score where value $ Y $ (the number of goals Berland misses) is minimum.

输入输出格式

输入格式


The input has five lines. Each line describes a game as " $ team_{1} $ $ team_{2} $ $ goals_{1} $ : $ goals_{2} $ " (without the quotes), what means that team $ team_{1} $ played a game with team $ team_{2} $ , besides, $ team_{1} $ scored $ goals_{1} $ goals and $ team_{2} $ scored $ goals_{2} $ goals. The names of teams $ team_{1} $ and $ team_{2} $ are non-empty strings, consisting of uppercase English letters, with length of no more than 20 characters; $ goals_{1},goals_{2} $ are integers from 0 to 9. The Berland team is called "BERLAND". It is guaranteed that the Berland team and one more team played exactly 2 games and the the other teams played exactly 3 games.

输出格式


Print the required score in the last game as $ X $ : $ Y $ , where $ X $ is the number of goals Berland scored and $ Y $ is the number of goals the opponent scored. If the Berland team does not get the first or the second place in the group, whatever this game's score is, then print on a single line "IMPOSSIBLE" (without the quotes). Note, that the result score can be very huge, 10:0 for example.

输入输出样例

输入样例 #1

AERLAND DERLAND 2:1
DERLAND CERLAND 0:3
CERLAND AERLAND 0:1
AERLAND BERLAND 2:0
DERLAND BERLAND 4:0

输出样例 #1

6:0

输入样例 #2

AERLAND DERLAND 2:2
DERLAND CERLAND 2:3
CERLAND AERLAND 1:3
AERLAND BERLAND 2:1
DERLAND BERLAND 4:1

输出样例 #2

IMPOSSIBLE

说明

In the first sample "BERLAND" plays the last game with team "CERLAND". If Berland wins with score 6:0, the results' table looks like that in the end: 1. AERLAND (points: 9, the difference between scored and missed goals: 4, scored goals: 5) 2. BERLAND (points: 3, the difference between scored and missed goals: 0, scored goals: 6) 3. DERLAND (points: 3, the difference between scored and missed goals: 0, scored goals: 5) 4. CERLAND (points: 3, the difference between scored and missed goals: -4, scored goals: 3) In the second sample teams "AERLAND" and "DERLAND" have already won 7 and 4 points, respectively. The Berland team wins only 3 points, which is not enough to advance to the next championship stage.

Input

题意翻译

这个题目是说,Berland的国家队成功加入一场足球联赛的半决赛。下面是球赛的规则: **·** 两队比赛,比赛结束后哪支队伍进的球比对方队伍多,哪方获胜。 **·** 胜利得3分,平局两队各得1分,失败不得分(得0分)。 **·** 这四队中得到第一或第二的队伍进入下一轮。 每个队伍的名次是由总得分来算的:分越多,名次越高。如果两个队伍有同样的分,以下列方式来决定高低(越靠前的规则越优先考虑,如果还是不能分出高低,再往下判断。下列第一个权重最高): **·** 每个队的进球数减去失球数,得到的结果越高排名就越高。 **·** 总进球数越高,排名就越高。 **·** 如果以上都不行的话,则以字典序排列。 现在还有一场比赛未打。一共6场比赛,已知前五场的队伍与得分。某个队伍和Berland还没交战。教练想让你找到如此X:Y(X是Berland的得分,Y是另一只球队的得分),可以满足下列条件: **·** X>Y,Berland得赢; **·** Berland赢后,得进前二名; **·** 如果不止一种答案,尽可能让X-Y小; **·** 如果还是有很多答案(不止一个),你应该让Y尽可能小。 输入格式: 一共有五行。 每一行都是以“team1 team2 goals1:goals2”(没引号)形式出现。表示team1跟team2交战一局。team1进了goal1个球,team2进了goal2个球。team1和team2都是非空字符串,并且都是大写字母,总长度不超过20。goal1和goal2都是0~9的正整数。 Berland队名字是"BERLAND"。保证只有Berland和另一支队伍打了2场比赛,其他队打了3场。 输出格式: 输出比分X:Y。X是Berland分数,Y是另一只球队的分数。如果怎么样也无法得到第一或第二,输出一行"IMPOSSIBLE"(没引号)。 提示:最后一场分数也不一定小,比如10:0这种情况。

加入题单

上一题 下一题 算法标签: