제출 #1078723

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1078723		khactrung1912	Lozinke (COCI17_lozinke)	C++14	0 / 100	1 ms	604 KiB

lozinke

// CAU DUA DU DAU
#include <bits/stdc++.h>
using namespace std;

#define uf(i, a, b) for (int i = (a); i <= (b); i++)
#define df(i, a, b) for (int i = (a); i >= (b); i--)
#define rep(i, n) for (int i = 1; i <= (n); i++)
#define ll long long
#define sz(k) (int)k.size()
#define task "TOYS"

template <class T> 
	bool maximize(T &a, const T &b){
		if (a < b){
			a = b; 
			return 1;
		} else return 0;
	};
template <class T> 
	bool minimize(T &a, const T &b){
		if (a > b){
			a = b; 
			return 1;
		} else return 0;
	};

const int maxn = 1e6+10;
const ll MOD = 1e9+7;

int n, m, toy[maxn], bitmax[maxn], cnt[1 << 20], dp[1 << 20];

void sub1(){
	cnt[0] = 1;
	for (int i = 1; i <= n; i++){
		for (int mask = (1 << m) - 1; mask >= 0; mask--){
			if (cnt[mask]){
				cnt[mask | toy[i]] += cnt[mask];
			}       
		}
	}
	cout << cnt[(1 << m) - 1];
}

void solve(){
	cin >> n >> m;
	rep(i, n){
		int k, x;
		cin >> k;
		rep(j, k) cin >> x, toy[i] += (1 << (x-1));
		for (int b = m; b >= 0; b--) if ((toy[i] >> b) & 1){
			bitmax[i] = b;
			break;
		}
	}
	if (n <= 100  && m <= 15) sub1();
	else cout << (1 << m)-1;
//	else if (1) sub2();
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr); cout.tie(nullptr);
	int numTest = 1;
//	cin >> numTest;
	while (numTest--) solve();
	return 0;
}

• Subtask 1: 0 / 100