Submission #65438336

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define db double
#define i128 __int128
#define ui unsigned int
#define ull unsigned long long

mt19937 rng_32(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());
const ull X=rng_64();
ull splitmix64(ull x) {
	x^=x<<13;
	x^=x>>7;
	x^=x<<17;
	return x;
}
ull rng(ull x){return splitmix64(x+X);}

const int N=20;
const int M=100; 
int n,m;
ll c[(1<<N)+10];
int val[(1<<N)+10][M+2];
int lowbit(int x){return x&(-x);}

int main(){
	ios::sync_with_stdio(0),cin.tie(0);
	cin>>n>>m;
	for(int i=0;i<n;i++){
		cin>>c[(1<<2*i)];
		c[(1<<(2*i+1))]=c[(1<<2*i)]; 
	}
	for(int i=1;i<=m;i++){
		int k;
		cin>>k;
		for(int j=1;j<=k;j++){
			int x;
			cin>>x;
			x--;
			val[(1<<2*x)][i]=1;
			val[(1<<2*x+1)][i]=1;
		}
	}
	n=n*2;
	ll ans=1e18;
	for(int i=0;i<(1<<n);i++){
		if(i!=lowbit(i)){
			for(int j=1;j<=m;j++)
				val[i][j]=val[i^lowbit(i)][j]+val[lowbit(i)][j];
			c[i]=c[i^lowbit(i)]+c[lowbit(i)];
		}
		bool is1=true;
		for(int j=1;j<=m;j++) is1&=(val[i][j]>=2);
		if(is1) ans=min(ans,c[i]);
	}
	cout<<ans;
	return 0;
}
/*
W [20:15(read wrong),20:18]
C [20:18,20:20](n=n*2)

Cyber malody E judge fc choke.

g++ test.cpp -o test -std=c++14 -O2 -Wall -Wshadow ulimit -s 5120000
./test
*/

Submission Info

Compile Error

Main.cpp: In function ‘int main()’:
Main.cpp:43:36: warning: suggest parentheses around ‘+’ inside ‘<<’ [-Wparentheses]
   43 |                         val[(1<<2*x+1)][i]=1;
      |                                 ~~~^~

Judge Result