CCPC－Wannafly & Comet OJ 夏季欢乐赛（2019） 篮球校赛

https://www.cometoj.com/contest/59/problem/G?problem_id=2697

思路：每种属性选5个，必然是从这些中选出的；判断哪个人，哪种属性用过dfs； 

#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <map>
#include <set>
#include <stack>
using namespace std;

#define sfi(x) scanf("%d",&x)
#define sfc(x) scanf("%c",x)
#define sfl(x) scanf("%lld",&x)
#define sfs(x) scanf("%s",x)

#define rint register int
#define pb push_back
#define fl() printf("flag!\n")
#define INF 0x3f3f3f3f
#define ll long long
#define mem(x,y) memset(x,y,sizeof(x))
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=5e5+9;

struct node
{
    int id;
    int val[6];
}a[maxn];

bool cmp1(node x,node y)
{
    return x.val[1]>y.val[1];
}
bool cmp2(node x,node y)
{
    return x.val[2]>y.val[2];
}
bool cmp3(node x,node y)
{
    return x.val[3]>y.val[3];
}
bool cmp4(node x,node y)
{
    return x.val[4]>y.val[4];
}
bool cmp5(node x,node y)
{
    return x.val[5]>y.val[5];
}

int mp[maxn][6];
bool vis[6];
bool use[maxn];
int id[maxn];
ll ans=0;
int n;
int nn;
void dfs(int pos,int cnt,ll sum)
{
    if(cnt>=5)
    {
        ans=max(ans,sum);
        return ;
    }
    if(pos>nn) return ;
    for(int i=1;i<=5;i++)
    {
        if(!vis[i]&&!use[id[pos]])
        {
            vis[i]=1;
            use[id[pos]]=1;
            dfs(pos+1,cnt+1,sum+mp[pos][i]);
            vis[i]=0;
            use[id[pos]]=0;
        }
    }
    dfs(pos+1,cnt,sum);
}


int main()
{
    //FAST_IO;
    //freopen("input.txt","r",stdin);


    cin>>n;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=5;j++)
        {
            cin>>a[i].val[j];
            a[i].id=i;
        }
    }


    sort(a+1,a+1+n,cmp1);
    for(int i=1;i<=5;i++)
    {
        ++nn;
        id[nn]=a[i].id;
        for(int j=1;j<=5;j++)
            mp[nn][j]=a[i].val[j];
    }

    sort(a+1,a+1+n,cmp2);
    for(int i=1;i<=5;i++)
    {
        ++nn;
        id[nn]=a[i].id;
        for(int j=1;j<=5;j++)
            mp[nn][j]=a[i].val[j];
    }
    sort(a+1,a+1+n,cmp3);
    for(int i=1;i<=5;i++)
    {
        ++nn;
        id[nn]=a[i].id;
        for(int j=1;j<=5;j++)
            mp[nn][j]=a[i].val[j];
    }
    sort(a+1,a+1+n,cmp4);
    for(int i=1;i<=5;i++)
    {
        ++nn;
        id[nn]=a[i].id;
        for(int j=1;j<=5;j++)
            mp[nn][j]=a[i].val[j];
    }
    sort(a+1,a+1+n,cmp5);
    for(int i=1;i<=5;i++)
    {
        ++nn;
        id[nn]=a[i].id;
        for(int j=1;j<=5;j++)
            mp[nn][j]=a[i].val[j];
    }

    /*cout<<nn<<endl;
    for(int i=1;i<=nn;i++)
    {
        for(int j=1;j<=5;j++)
        {
            cout<<mp[i][j]<<" ";
        }
        cout<<endl;
        if(i%5==0) cout<<endl;
    }*/


    dfs(1,0,0);

    cout<<ans<<endl;

    return 0;
}