题目链接

题面:

题意:
每个物品有4个属性,给定 n 个物品分为 k 组,每组只能选一个物品,使得最终 D M G DMG DMG最大。

代码:

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<string>
#include<queue>
#include<bitset>
#include<map>
#include<unordered_map>
#include<set>
#include<list>
#define ui unsigned int
#define ll long long
#define llu unsigned ll
#define ld long double
#define pr make_pair
#define pb push_back
#define lc (cnt<<1)
#define rc (cnt<<1|1)
//#define len(x) (t[(x)].r-t[(x)].l+1)
#define tmid ((l+r)>>1)
using namespace std;

const int inf=0x3f3f3f3f;
const ll lnf=0x3f3f3f3f3f3f3f3f;
const double dnf=1e18;
const int mod=998244353;
const double eps=1e-1;
const double pi=acos(-1.0);
const int hp=13331;
const int maxn=55;
const int maxp=1100;
const int maxm=500100;
const int up=100000;

int va[maxn][maxn],vb[maxn][maxn],vc[maxn][maxn],vd[maxn][maxn];
int cnt[maxn],ans[maxn],top;
ll maxx=0;

void dfs(int p,int a,int b,int c,int d)
{
    if(p==top+1)
    {
        maxx=max(maxx,1ll*a*b*c*d);
        return ;
    }
    int x=ans[p];
    for(int i=1;i<=cnt[x];i++)
        dfs(p+1,a+va[x][i],b+vb[x][i],c+vc[x][i],d+vd[x][i]);
}

int main(void)
{
    int tt;
    scanf("%d",&tt);
    while(tt--)
    {
        int n,k;
        int op,a,b,c,d;
        memset(cnt,0,sizeof(cnt));
        top=0;
        scanf("%d%d",&n,&k);
        for(int i=1;i<=n;i++)
        {
            scanf("%d%d%d%d%d",&op,&a,&b,&c,&d);
            ++cnt[op];
            va[op][cnt[op]]=a;
            vb[op][cnt[op]]=b;
            vc[op][cnt[op]]=c;
            vd[op][cnt[op]]=d;
        }
        for(int i=1;i<=k;i++)
        {
            if(cnt[i]==0) continue;
            ans[++top]=i;
        }
        maxx=0;
        dfs(1,100,100,100,100);
        printf("%lld\n",maxx);
    }
    return 0;
}