제출 #1318931

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1318931		m.zeeshanrashid	Norela (info1cup18_norela)	C++20	0 / 100	10 ms	2872 KiB

norela

// #ifdef __AVX2__
// #pragma GCC target "avx2"
// #endif
// #pragma GCC optimize "O3"
// #pragma GCC optimize "unroll-loops"
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp> 
// #include <ext/pb_ds/tree_policy.hpp> 
// using namespace __gnu_pbds; 
using namespace std;
#define int long long
#define elif else if
#define all(l) begin(l),end(l)
#define rall(l) rbegin(l),rend(l)
#define append push_back
#define print(l) for(auto i:l) cout<<i<<' '; cout<<endl;
#define pprint(a,b) cout<<a<<' '<<b<<endl;
#define inp(l) for(auto &i:l) cin>>i;
// #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define pai make_pair
#define endl "\n"
#define pii pair<int,int>
#define fi first
#define se second
#define vec vector

// const int mod=998244353;
const int mod1=998244353;
const int mod=1e9+7;
const int N=2e5+5;

int iter=1,itera=1;
void solve(){
	int n,m;
	cin>>n>>m;
	vec<int>a;
	for(int i=0;i<m;i++){
		int s;
		cin>>s;
		vec<int>b(s);
		inp(b);
		int x=0;
		for(auto i:b)
			x+=1<<(i-1);
		a.append(x);
	}
	// print(a)
	int si=(1<<m);
	vec<int>dp(si,0);
	vec<bool>vis(si,0);
	vis[0]=1;
	queue<int>q;
	q.push(0);
	int ans=-1;
	while(q.size()){
		int x=q.front();
		q.pop();
		int v=1;
		for(int i=0;i<m;i++){
			int g=x|v;
			if(vis[g]) continue;
			q.push(g);
			dp[g]=dp[x]^a[i];
			vis[g]=1;
			if(dp[g]==(1<<n)-1){
				int g1=__builtin_popcount(g);
				int cur=__builtin_popcount(ans);
				if(ans<0 or g1<cur){
					ans=g;
					continue;
				}
				if(g1==cur) ans=min(ans,g);
			}
			v<<=1;
		}
	}
	cout<<__builtin_popcount(ans)<<endl;
	for(int i=1;i<=m;i++){
		if(ans&1) cout<<i<<' ';
		ans>>=1;
	}
}
signed main(){
	// freopen("","r",stdin);
	// freopen("","w",stdout);
	ios_base::sync_with_stdio(false);
	cin.tie(NULL); 
	cout.tie(NULL);
	cout<<fixed<<setprecision(20);
	// cin>>itera;
	for(iter=1;iter<=itera;iter++) solve();
}

• Subtask 1: 0 / 20
• Subtask 2: 0 / 30
• Subtask 3: 0 / 25
• Subtask 4: 0 / 25