Submission #59493938

---

Source Code Expand

#include<bits/stdc++.h>
#include"atcoder/all"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i=0;i<n;i++)
#define all(a) a.begin(),a.end()
typedef long long ll;
typedef vector<ll> vi;
typedef pair<int,int> P;
constexpr ll mod = 998244353;
typedef modint998244353 mi;

ll a[105];

int main(){
    ll n,w;cin>>n>>w;
    mf_graph<ll>graph(n+2);

    ll sum=0;
    rep(i,n){
        cin>>a[i];
        sum+=a[i];
    }

    rep(i,n){
        int k;cin>>k;
        vector<int>c(k);
        rep(j,k)cin>>c[j];

        graph.add_edge(n,i,w);
        graph.add_edge(i,n+1,a[i]);
        rep(j,k){
            graph.add_edge(i,c[j]-1,1e9);
        }
    }

    cout<<sum-graph.flow(n,n+1)<<endl;
}

Submission Info

Judge Result