Submission #65433479

---

Source Code Expand

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
#define pb push_back
#define ff first
#define ss second
const int N=2e3+7;
const int mod=1e9+7;
const double eps=1e-9;
const double pi=    3.14159265358979323846;
using namespace std;  
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
             tree_order_statistics_node_update>
    op_set;

string rep(int n,int len)
{
    string a="";
    for(int i=0;i<len;i++,n=n/3)
        a+=(char)('0'+n%3);
    reverse(a.begin(),a.end());
    return a;
}

int32_t main() 
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n,m;
    cin >> n >> m;

    vector<long long> costs(n);
    for(int i=0;i<n;i++)
        cin >> costs[i];

    vector<vector<int>> zoo(n);
    for(int i=0;i<m;i++)
    {
        int k;
        cin >> k;
        while(k--)
        {
            int ex;
            cin >> ex;
            zoo[ex-1].pb(i);
        }
    }

    long long ans=1e18;
    int highest=pow(3,n);
    for(int i=1;i<highest;i++)
    {
        string tmp=rep(i,n);
        long long curr=0ll;
        for(int j=0;j<n;j++)
            curr+=(tmp[j]-'0')*costs[j];

        vector<int> animals(m);
        for(int j=0;j<n;j++)
            for(auto animal : zoo[j])
                animals[animal]+=(tmp[j]-'0');

        if(*std::min_element(animals.begin(),animals.end())>=2)
            ans=std::min(ans,curr);
    }
    cout << ans << "\n";
}

/*
Mar Gaye Ehsaas Meray, 
Chubay Wo Ilfaaz Teray, 
Tumne Dekha Tak Na Jaty Way, 
*/

Submission Info

Judge Result