UVALive 7147 World Cup(数学+贪心)(2014 Asia Shanghai Regional Contest)


In normal football games, the winner team gets 3 points, loser team gets 0 point, and if there is a draw
game, both of the teams get 1 point.
In World Cup 1994, Group D there is an interest thing happened. There are 4 teams in that group,
Argentina, Nigeria, Bulgaria and Greece. Greece lost all the 3 matehes and scored 0. Argentina defeated
Nigeria, Nigeria defeated Bulgaria and Bulgaria defeat Argentina. Since there are only 2 teams could
advance to the next stage, one of the 3 teams will be eliminated. It’s really a surprise that a team
scored 6 will be eliminated in a 4 advance 2 group competition. That is really interesting and we’d like
to dig it deeper.
In this problem, there are N teams in a group. Within a group, any two teams will play each other
exactly once, so each team will have N − 1 matches in total.
In a match, the winner team will get A points and the loser team gets C points. If the match ends
with a draw, each of the teams gets B points. When all matches finished, the teams will be ranked by
their score (in case of multiple teams get the same score, they will be ordered randomly), and the top
M teams from the group can advance to the next stage.
Our questions are: What is the maximum possible score that a team can earn and still not advance?
(Note that there may be other teams in the same group that also earn that same score and do advance.)
Similarly, what is the minimum possible score that a team can earn and still advance?
The first line of the input gives the number of test cases, T. T cases follow. Each case has two lines.
The first line contains two numbers, N and M. The second line contains three numbers, A, B, and C.
For each test case, output one line containing ‘Case #x: y z’, where x is the test case number (starting
from 1) and y is maximum score that a team may be eliminated. z is the minimum score that a team
may advance to the next stage.




考虑第一个问题,贪心地让分数都尽量集中到前m+1个队伍身上,那么就要后n-m-1个队伍都给m+1个队伍最多的分数,即max{A, B}。

那么前m+1个队伍的竞技中,希望分数尽量地平均,则要赢一场便输一场,或者全部平手,则有floor(m/2)场得分为max{A + C, B + B}。

若m为奇数,那么最后一场要有一半的队伍获胜,或全部平手,此时最低分数为max{B, C}。

同样,考虑第二个问题,贪心得让后n-m+1的队伍分数都尽量少,那么久要前m-1个队伍给后n-m+1个队伍最少的分数,即min{B, C}。

那么后n-m+1个队伍的竞技中,也是希望分数尽量地平均,则要赢一场便输一场,或者全部平手,则有floor((n-m)/2)场得分为min{A + C, B + B}。

若n-m为奇数,那么最后一场要有一半的队伍获胜,或全部平手,此时最高分数为min{A, B}。




 1 #ifdef OYK_JUDGE
 2 #define longformat "%I64d"
 3 #else
 4 #define longformat "%lld"
 5 #endif // OYK_JUDGE
 7 #include <cstdio>
 8 #include <algorithm>
 9 using namespace std;
10 typedef long long LL;
12 int n, m, a, b, c, T;
14 LL solve1() {
15     LL res = max(a, b) * LL(n - m - 1);
16     res += LL(m) / 2 * max(a + c, b + b);
17     if(m & 1) res += max(b, c);
18     return res;
19 }
21 LL solve2() {
22     LL res = min(b, c) * LL(m - 1);
23     res += LL(n - m) / 2 * min(a + c, b + b);
24     if((n - m) & 1) res += min(a, b);
25     return res;
26 }
28 int main() {
29     scanf("%d", &T);
30     for(int t = 1; t <= T; ++t) {
31         scanf("%d%d%d%d%d", &n, &m, &a, &b, &c);
32         if(a < c) swap(a, c);
33         printf("Case #%d: " longformat " " longformat "\n", t, solve1(), solve2());
34     }
35 }
View Code


posted @ 2015-05-14 17:13  Oyking  阅读(573)  评论(0编辑  收藏