G - Arranging Your Team

G - Arranging Your Team

Time Limit:3000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit  Status

Description

Your country has qualified for the FIFA 2010 South Africa World Cup. As the coach, you have made up the 23 men squad. Now you must select 11 of them as the starters. As is well known, there are four positions in soccer: goalkeeper, defender, midfielder and striker. Your favorite formation is 4-4-2, that is, you should choose 4 defenders, 4 midfielders, 2 strikers, and of course, 1 goalkeeper. As a retired ACMer, you want to write a program to help you make decision. Each person's ability has been evaluated as a positive integer. And what's more, for some special pairs of persons, if the two people are both on the field, there will be an additional effect (positive or negative). Now you should choose the 11 persons to make the total value maximum.

 

Input

There are multiple test cases, separated by an empty line. The first 23 lines of each test case indicate each person's name S  _i, ability value V  _i, and position. The length of each name is no more than 30, and there are no whitespaces in the names. All the names are different. The ability values are positive integers and no more than 100. The position is one of "goalkeeper", "defender", "midfielder" and "striker". 

Then an integer M indicates that there are M special pairs. Each of the following M lines contains S  _i, S  _j and C  _ij, means that if S  _i and S  _jare both on the field, the additional profit is C  _ij. (-100 ≤ C  _ij ≤ 100). S  _i and S  _j are different strings, and must be in the previous 23 names. All the (S  _i, S  _j) pairs 
are different. 

 

Output

Output one line for each test case, indicating the maximum total ability values, that is, the total ability values of the 11 persons plus the additional effects. If you cannot choose a 4-4-2 formation, output "impossible" instead.

 

Sample Input

     
     

      
      Buffon 90 goalkeeper
De_Sanctis 80 goalkeeper
Marchetti 80 goalkeeper
Zambrotta 90 defender
Cannavaro 90 defender
Chiellini 90 defender
Maggio 90 defender
Bonucci 80 defender
Criscito 80 defender
Bocchetti 80 defender
Pirlo 90 midfielder
Gattuso 90 midfielder
De_Rossi 90 midfielder
Montolivo 90 midfielder
Camoranesi 80 midfielder
Palombo 80 midfielder
Marchisio 80 midfielder
Pepe 80 midfielder
Iaquinta 90 striker
Di_Natale 90 striker
Gilardino 80 striker
Quagliarella 80 striker
Pazzini 80 striker
1
Pirlo Quagliarella 50

ZhangSan01 50 goalkeeper
ZhangSan02 50 defender
ZhangSan03 50 defender
ZhangSan04 50 defender
ZhangSan05 50 defender
ZhangSan06 50 defender
ZhangSan07 50 defender
ZhangSan08 50 defender
ZhangSan09 50 defender
ZhangSan10 50 defender
ZhangSan11 50 defender
ZhangSan12 50 defender
ZhangSan13 50 defender
ZhangSan14 50 defender
ZhangSan15 50 defender
ZhangSan16 50 midfielder
ZhangSan17 50 midfielder
ZhangSan18 50 midfielder
ZhangSan19 50 midfielder
ZhangSan20 50 midfielder
ZhangSan21 50 midfielder
ZhangSan22 50 midfielder
ZhangSan23 50 midfielder
0 
     
     

 

Sample Output

     
     

      
      1030
impossible 
     
     

题目会给你23个球员的姓名、分数、定位。定位一共有4种，g,d,m,s。对应每种定位需要选的人数是1 4 4 2，如果不能达到就输出impossible，如果能达到就输出能够获得的最高分。

题目还定义了加分设定，如果会给出很多对选手，如果他们同时上场则有分数的加成。

思路，因为最多只有23个球员，dfs暴力即可，对于统计分数加成可以将姓名hash掉或者map为一个数字然后用数组保存。

因为DFS写得有点丑陋，所以WA了一发，顺便这道题有坑点就是分数可能为负，所以ANS初始化应该为-INF。

#include"iostream"
#include"cstring"
#include"cstdio"
#include"string"
#include"map"
#include"algorithm"

#define INF 0x7f7f7f7f

using namespace std;

struct node
{
    string name;
    char pos;
    int point;
}man[25];

int add[25][25];
map<string,int> mp;
int num;
int numg,numd,numm,nums;
int ans;
bool vis[25];

void dfs(int nowg,int nowd,int nowm,int nows,int score,int id)
{
    if(id == 25) return;
    if(nowg == 1 && nowd == 4 && nowm == 4 && nows == 2)
    {
        ans = max(ans,score);
        return;
    }
    if(man[id].pos == 'g' && nowg < 1)
    {
        int ad = 0;
        for(int i = 1;i <= 23;i++)
        {
            if(vis[i]) ad += add[id][i];
        }
        vis[id] = true;
        dfs(nowg+1,nowd,nowm,nows,score+man[id].point+ad,id+1);
        vis[id] = false;
        dfs(nowg,nowd,nowm,nows,score,id+1);
    }
    else if(man[id].pos == 'd' && nowd < 4)
    {
        int ad = 0;
        for(int i = 1;i <= 23;i++)
        {
            if(vis[i]) ad += add[id][i];
        }
        vis[id] = true;
        dfs(nowg,nowd+1,nowm,nows,score+man[id].point+ad,id+1);
        vis[id] = false;
        dfs(nowg,nowd,nowm,nows,score,id+1);
    }
    else if(man[id].pos == 'm' && nowm < 4)
    {
        int ad = 0;
        for(int i = 1;i <= 23;i++)
        {
            if(vis[i]) ad += add[id][i];
        }
        vis[id] = true;
        dfs(nowg,nowd,nowm+1,nows,score+man[id].point+ad,id+1);
        vis[id] = false;
        dfs(nowg,nowd,nowm,nows,score,id+1);
    }
    else if(man[id].pos == 's' && nows < 2)
    {
        int ad = 0;
        for(int i = 1;i <= 23;i++)
        {
            if(vis[i]) ad += add[id][i];
        }
        vis[id] = true;
        dfs(nowg,nowd,nowm,nows+1,score+man[id].point+ad,id+1);
        vis[id] = false;
        dfs(nowg,nowd,nowm,nows,score,id+1);
    }
    else dfs(nowg,nowd,nowm,nows,score,id+1);
}

int main(void)
{
    string s,pos;
    int p;
    while(cin >> s >> p >> pos)
    {
        num = numg = numd = numm = nums = 0;
        ans = -INF;
        memset(add,0,sizeof(add));
        memset(vis,false,sizeof(vis));
        if(pos[0] == 'g')
        {
            ++numg;
            man[1].name = s;
            man[1].pos = 'g';
            man[1].point = p;
        }
        else if(pos[0] == 'd')
        {
            ++numd;
            man[1].name = s;
            man[1].pos = 'd';
            man[1].point = p;
        }
        else if(pos[0] == 'm')
        {
            ++numm;
            man[1].name = s;
            man[1].pos = 'm';
            man[1].point = p;
        }
        else
        {
            ++nums;
            man[1].name = s;
            man[1].pos = 's';
            man[1].point = p;
        }
        mp[s] = 1;
        for(int i = 2;i <= 23;i++)
        {
            cin >> s >> p >> pos;
            mp[s] = i;
            if(pos[0] == 'g')
            {
                ++numg;
                man[i].name = s;
                man[i].pos = 'g';
                man[i].point = p;
            }
            else if(pos[0] == 'd')
            {
                ++numd;
                man[i].name = s;
                man[i].pos = 'd';
                man[i].point = p;
            }
            else if(pos[0] == 'm')
            {
                ++numm;
                man[i].name = s;
                man[i].pos = 'm';
                man[i].point = p;
            }
            else
            {
                ++nums;
                man[i].name = s;
                man[i].pos = 's';
                man[i].point = p;
            }
        }
        int nn;
        scanf("%d",&nn);
        while(nn--)
        {
            string s1,s2;
            int adp;
            cin >> s1 >> s2 >> adp;
            add[mp[s1]][mp[s2]] = adp;
            add[mp[s2]][mp[s1]] = adp;
        }

        //for(int i = 1;i <= 23;i++) cout << man[i].pos << endl;
        //for(int i = 1;i <= 23;i++) cout << man[i].point << endl;

        if(numg < 1 || numd < 4 || numm < 4 || nums < 2)
        {
            printf("impossible\n");
            continue;
        }

        dfs(0,0,0,0,0,1);
        printf("%d\n",ans);
    }
    return 0;
}