Code forces 200C---Football Championship

<a href="http://codeforces.com/problemset/problem/200/C" target="_blank">点击打开链接</a>

题目：

C. Football Championship

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 &gt; 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.

Input

The input has five lines.

Each line describes a game as "team1 team2 goals1:goals2"

(without the quotes), what means that teamteam1 played

a game with team team2,

besides, team1 scored goals1 goals

and team2 scored goals2 goals.

The names of teams team1 and team2 are

non-empty strings, consisting of uppercase English letters, with length of no more than 20 characters; goals1, goals2 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.

Output

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.

Sample test(s)

Note

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:

AERLAND (points: 9, the difference between scored and missed goals: 4, scored goals: 5)

BERLAND (points: 3, the difference between scored and missed goals: 0, scored goals: 6)

DERLAND (points: 3, the difference between scored and missed goals: 0, scored goals: 5)

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.

题目意思：   有4支足球队进行足球比赛，其中有一支是BERLAND，现在这支队伍要和剩下的队伍三支队伍中还少一场比赛的队伍进行最后一场比赛，已知前面的5场比赛的结果，要求能否找到一个比分X：Y，使得BERLAND赢球，并且X-Y的差值最小，如果存在输出X：Y，否则输出IMPOSSIBLE.

满足以下条件：

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.

解题思路：模拟整个过程即可（对名有可能会和样列不同所以我加了一个处理对名的操作）、

1：将读入的数据处理存到一个s[4]数组对于四个队，默认BERLAND为s[3]

2：我们用两个for去枚举所以可能的X Y的比值，然后去处理排名，如果最后BERLAND是前两名即可.

3：当遇到相同分数时候判断条件为3个优先级从上往下先比较第一个不行比第二个最后看第三个

1：进球数-失球数的差值，差值小的优先

2：进球数多的优先

3：对名的字典序小的优先

代码：