25分求调

#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#define int long long
using namespace std;
const int M=1e5+10,N=15;
int a[N][N];
int n,m;
int b[N][M];
vector<int> p[M];
int bj[N][N];
int ones[N][1<<N];
int Log[1<<N];
int lowbit(int x){
    return x&(-x);
}
int f[N][1<<N];
signed main()
{
    cin>>n>>m;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++){
            cin>>b[i][j];
        }
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            bj[i][j]=1;
    for(int i=1;i<=n;i++){
        int k;
        cin>>k;
        for(int j=1;j<=k;j++){
            int x;
            cin>>x;
            for(int k=0;k<p[x].size();k++){
                bj[i][p[x][k]]=bj[p[x][k]][i]=0;
            }
            p[x].push_back(i);
            for(int g=1;g<=n;g++){
                a[g][i]+=b[g][x];
            }
        }
    }
    int sum=0;
    for(int i=1;i<=n;i++)Log[1<<i]=i;
    memset(ones,100,sizeof ones);
    for(int k=1;k<=n;k++){
        for(int i=1;i<=n;i++){
            ones[k][1<<(i-1)]=a[k][i];
        }
        for(int i=0;i<(1<<n);i++){
            if(ones[k][i]<=1e18)continue;
            int x=i;
            int o=1;
            for(int j=x;j;j=(j-1)&i){
                if(ones[k][j]>=1e18){
                    o=0;
                    break;
                }
            } 
            if(o){
                ones[k][i]=0;
                x=i;
                while(x){
                    ones[k][i]+=a[k][Log[lowbit(x)]+1];
                    if(ones<=0)sum++;
                    x-=lowbit(x);
                   
                }
            }
        }  
    }
    int ans=1e18;
    memset(f,100,sizeof f);
    for(int i=0;i<(1<<n);i++){
        f[1][i]=min(f[1][i],ones[1][i]);
    }
    for(int i=2;i<=n;i++){
        for(int j=0;j<(1<<n);j++){
            // f[i][j];
            for(int k=j;k;k=(k-1)&j){
                if(f[i-1][k]<=1e18)f[i][j]=min(f[i][j],f[i-1][k]+ones[i][j^k]);
            }
        }
    }
    for(int i=1;i<=n;i++){
        ans=min(ans,f[i][(1<<n)-1]);
    }
    cout<<ans;
    
}