[BZOJ4004][JLOI2015]装备购买（贪心+高斯消元求线性基）

题目描述

传送门

题解

求极大线性无关向量组，使权值和最小
按权值从小到大排序，高斯消元求解线性基即可

代码

#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;
#define LL long long
#define Mod 1000000007
#define N 505

int n,m,cnt,ans,b[N];
struct hp{LL a[N];int val;}ma[N];

int cmp(hp a,hp b)
{
    return a.val<b.val;
}
LL fast_pow(LL x,int p)
{
    LL ans=1;
    for (;p;p>>=1,x=x*x%Mod)
        if (p&1)
            ans=ans*x%Mod;
    return ans;
}
LL inv(LL x)
{
    return fast_pow(x,Mod-2);
}
int main()
{
    scanf("%d%d",&n,&m);
    for (int i=1;i<=n;++i)
        for (int j=1;j<=m;++j)
        {
            scanf("%lld",&ma[i].a[j]);
            ma[i].a[j]%=Mod;
        }
    for (int i=1;i<=n;++i) scanf("%d",&ma[i].val);
    sort(ma+1,ma+n+1,cmp);
    for (int i=1;i<=n;++i)
        for (int j=1;j<=m;++j)
            if (ma[i].a[j])
            {
                if (!b[j])
                {
                    b[j]=i;
                    ++cnt;
                    ans+=ma[i].val;
                    break;
                }
                else
                {
                    LL t=ma[i].a[j]*inv(ma[b[j]].a[j])%Mod;
                    for (int k=j;k<=m;++k)
                        ma[i].a[k]=((ma[i].a[k]-ma[b[j]].a[k]*t%Mod)%Mod+Mod)%Mod;
                }
            }
    printf("%d %d\n",cnt,ans);
}