結果

問題 No.1689 Set Cards
ユーザー deuteridayo
提出日時 2021-09-24 22:59:55
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 28 ms / 2,000 ms
コード長 2,262 bytes
コンパイル時間 3,876 ms
コンパイル使用メモリ 235,100 KB
実行使用メモリ 19,456 KB
最終ジャッジ日時 2024-07-05 11:10:13
合計ジャッジ時間 5,153 ms
ジャッジサーバーID
(参考情報)
judge4 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 23
権限があれば一括ダウンロードができます

ソースコード

diff #

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
using lint = long long;
using ulint = unsigned long long;
#define endl '\n'
int const INF = 1<<30;
lint const INF64 = 1LL<<61;
// lint const mod = 1e9+7;
long const mod = 998244353;
lint ceilDiv(lint x, lint y){if(x >= 0){return (x+y-1)/y;}else{return x/y;}}
lint floorDiv(lint x, lint y){if(x >= 0){return x/y;}else{return (x-y+1)/y;}}
lint Sqrt(lint x){lint upper = 1e9;lint lower = 0;while(upper - lower > 0){lint mid = (1+upper + lower)/2;if(mid * mid > x){upper = mid-1;}else{lower = mid;}}return upper;}
lint gcd(lint a,lint b){if(a<b)swap(a,b);if(a%b==0)return b;else return gcd(b,a%b);}
lint lcm(lint a,lint b){return (a / gcd(a,b)) * b;}
lint chmin(vector<lint>&v){lint ans = INF64;for(lint i:v){ans = min(ans, i);}return ans;}
lint chmax(vector<lint>&v){lint ans = -INF64;for(lint i:v){ans = max(ans, i);}return ans;}
double dist(double x1, double y1, double x2, double y2){return sqrt(pow(x1-x2, 2) + pow(y1-y2,2));}
string toString(lint n){string ans = "";if(n == 0){ans += "0";}else{while(n > 0){int a = n%10;char b = '0' + a;string c = "";c += b;n /= 10;ans = c + ans;}}return ans;}
string toString(lint n, lint k){string ans = toString(n);string tmp = "";while(ans.length() + tmp.length() < k){tmp += "0";}return tmp + ans;}
vector<lint>prime;void makePrime(lint n){prime.push_back(2);for(lint i=3;i<=n;i+=2){bool chk = true;for(lint j=0;j<prime.size() && prime[j]*prime[j] <= i;j++){if(i % prime[j]==0){chk=false;break;}}if(chk)prime.push_back(i);}}
struct edge{
    int to;
};
using graph = vector<vector<edge>>;
vector<vector<lint>>dp(501, vector<lint>(1<<12, 0));


int main(){ 
    int n;
    cin >> n;
    vector<lint>c(n);
    for(int i = 0;i<n;i++){
        lint tmp = 0;
        int k;
        cin >> k;
        for(int j=0;j<k;j++){
            int c;
            cin >> c;
            c--;
            tmp += 1<<c;
        }
        c[i] = tmp;
    }
    dp[0][(1<<12) - 1] = 1;
    for(int i=0;i<n;i++) {
        for(int j = 0;j<(1<<12);j++) {
            dp[i+1][j] += dp[i][j];
            dp[i+1][j & c[i]] += dp[i][j];
            dp[i+1][j] %= mod;
            dp[i+1][j & c[i]] %= mod;
        }
    }
    cout << dp[n][0] << endl;


}

0