###### UPC-5007 High Score(计算)

Mårten and Simon enjoy playing the popular board game Seven Wonders, and have just ﬁnished a match. It is now time to tally the scores.

One of the ways to score in Seven Wonders is through the use of Science. During the game, the players may collect a number of Science tokens of three different types: Cog, Tablet, and Compass. If a player has a Cogs, b Tablets and c Compasses, that player gets a2 + b2 + c2 + 7 · min(a, b, c) points.

However, the scoring is complicated by the concept of Wildcard Science tokens. For each Wildcard Science token a player has, she may count that as one of the three ordinary types of Science tokens. For instance, the ﬁrst player in Sample Input 1 has 2 Cogs, 1 Tablet, 2 Compasses, and 1 Wildcard Science, so could thus choose to have the distributions (3, 1, 2), (2, 2, 2) or (2, 1, 3) of Cogs, Tablets and Compasses, respectively. The possible scores for this player are then 32 + 12 + 22 + 7 · 1 = 21, 22 + 22 + 22 + 7 · 2 = 26 and 22 + 12 + 32 + 7 · 1 = 21 depending on how the Wildcard Science is assigned. Thus, the maximum score for this player is 26.
Given the number of tokens each player in the game has, compute the maximum possible score that each of them can achieve if they assign their Wildcard Science tokens optimally.

The input consists of:
• One line with an integer n (3 ≤ n ≤ 7), the number of players in the game.
• n lines, each with four integers a, b, c, d (0 ≤ a, b, c, d ≤ 109 ), giving the number of Cog,Tablet, Compass, and Wildcard Science tokens of a player.

For each player, in the same order they are given in the input, output the maximum score the player may get.

3
2 1 2 1
3 2 1 0
1 3 0 1

26
21
18

#include<bits/stdc++.h>
#define LL long long
using namespace std;
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
LL a[4],d;
scanf("%lld%lld%lld%lld",&a[0],&a[1],&a[2],&d);
sort(a,a+3);
LL maxn=a[0]*a[0]+a[1]*a[1]+(a[2]+d)*(a[2]+d)+7*a[0];
LL minn=a[1]-a[0];
if(d>minn)
{
a[0]+=minn;
d-=minn;
minn=a[2]-a[1];
if(d/2>=minn)
{
a[0]+=minn;
a[1]+=minn;
d-=2*minn;
a[0]+=d/3;
a[1]+=d/3;
a[2]+=d/3;
a[2]+=d%3;
}
else
{
a[0]+=d/2;
a[1]+=d/2;
d%=2;
a[0]+=d;
}
}
else a[0]+=d;
LL ans=a[0]*a[0]+a[1]*a[1]+a[2]*a[2]+7*min(a[0],min(a[1],a[2]));
//        printf("%lld %lld %lld\n",a[0],a[1],a[2]);
//        printf("------%lld   %lld\n",ans,maxn);
printf("%lld\n",max(ans,maxn));
}
}


#### 网络工程师系统可靠性计算强化训练教程

1970年01月01日 08:00

#### UVa 12261 High Score (贪心&“向左走，向右走”)

2013-11-18 14:32:34

#### Xpert Highscore Plus2

2013年10月16日 18.31MB 下载

#### Football Score

2014-05-18 12:37:28

#### high score

2010-04-01 22:59:00

#### HighScorePlus软件简易操作

2010年03月14日 1.11MB 下载

#### solr如何计算score？

2014-07-18 16:34:37

#### High Score--nwerc2017（思维）

2018-04-17 06:28:17

#### ElasticSearch 的分数 (_score) 是怎么计算得出 (2.X & 5.X)

2017-03-03 15:57:15

#### Lucene评分score计算

2014-11-17 10:01:10

## 不良信息举报

UPC-5007 High Score(计算)