1a:I[10086,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"AdSenseInsert"] 1b:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"CodeViewer"] 1c:T426,#include using namespace std; int dp[1<<17][17]; int32_t main() { cin.tie(0)->sync_with_stdio(0); int N; cin >> N; vector a(N); for(int i = 0; i < N; i++) { int t, bm = 0; cin >> t; while(t--) { int x; cin >> x; x--; bm |= 1 << x; } dp[bm][16]++; a[i] = bm; } vector cur; for(int bm=1; bm<(1<<17); bm++) { for(int t=16; t>=0; t--) { cur.clear(); for(int i=0; i<17; i++) { if(bm & (1<= cur.size()) { continue; } int loc = cur[t]; if(loc > 0 && !(bm & (1<<(loc-1)))) { dp[bm][t] += dp[bm^(1<

코드 #5197