結果

問題 No.2152 [Cherry Anniversary 2] 19 Petals of Cherry
ユーザー tko919tko919
提出日時 2022-12-09 00:08:37
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 155 ms / 1,000 ms
コード長 5,509 bytes
コンパイル時間 2,287 ms
コンパイル使用メモリ 212,820 KB
実行使用メモリ 34,400 KB
最終ジャッジ日時 2024-10-14 18:14:29
合計ジャッジ時間 7,982 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 58 ms
34,260 KB
testcase_01 AC 61 ms
34,392 KB
testcase_02 AC 60 ms
34,392 KB
testcase_03 AC 107 ms
34,392 KB
testcase_04 AC 73 ms
34,396 KB
testcase_05 AC 117 ms
34,268 KB
testcase_06 AC 76 ms
34,268 KB
testcase_07 AC 92 ms
34,268 KB
testcase_08 AC 94 ms
34,392 KB
testcase_09 AC 65 ms
34,392 KB
testcase_10 AC 96 ms
34,272 KB
testcase_11 AC 76 ms
34,268 KB
testcase_12 AC 64 ms
34,260 KB
testcase_13 AC 67 ms
34,392 KB
testcase_14 AC 92 ms
34,396 KB
testcase_15 AC 88 ms
34,392 KB
testcase_16 AC 81 ms
34,396 KB
testcase_17 AC 98 ms
34,272 KB
testcase_18 AC 106 ms
34,392 KB
testcase_19 AC 96 ms
34,400 KB
testcase_20 AC 57 ms
34,268 KB
testcase_21 AC 93 ms
34,396 KB
testcase_22 AC 91 ms
34,396 KB
testcase_23 AC 72 ms
34,392 KB
testcase_24 AC 111 ms
34,400 KB
testcase_25 AC 96 ms
34,396 KB
testcase_26 AC 93 ms
34,268 KB
testcase_27 AC 73 ms
34,396 KB
testcase_28 AC 58 ms
34,392 KB
testcase_29 AC 57 ms
34,392 KB
testcase_30 AC 56 ms
34,396 KB
testcase_31 AC 56 ms
34,388 KB
testcase_32 AC 59 ms
34,268 KB
testcase_33 AC 60 ms
34,392 KB
testcase_34 AC 64 ms
34,396 KB
testcase_35 AC 69 ms
34,392 KB
testcase_36 AC 81 ms
34,392 KB
testcase_37 AC 86 ms
34,264 KB
testcase_38 AC 98 ms
34,392 KB
testcase_39 AC 105 ms
34,400 KB
testcase_40 AC 109 ms
34,396 KB
testcase_41 AC 122 ms
34,396 KB
testcase_42 AC 133 ms
34,396 KB
testcase_43 AC 134 ms
34,264 KB
testcase_44 AC 143 ms
34,400 KB
testcase_45 AC 155 ms
34,268 KB
testcase_46 AC 149 ms
34,400 KB
testcase_47 AC 55 ms
34,392 KB
testcase_48 AC 110 ms
34,396 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 1 "library/Template/template.hpp"
#include <bits/stdc++.h>
using namespace std;

#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(v) (v).begin(),(v).end()
using ll=long long int;
const int inf = 0x3fffffff;
const ll INF = 0x1fffffffffffffff;
template<typename T>inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
#line 2 "library/Utility/fastio.hpp"
#include <unistd.h>

class FastIO{
    static constexpr int L=1<<16;
    char rdbuf[L];
    int rdLeft=0,rdRight=0;
    inline void reload(){
        int len=rdRight-rdLeft;
        memmove(rdbuf,rdbuf+rdLeft,len);
        rdLeft=0,rdRight=len;
        rdRight+=fread(rdbuf+len,1,L-len,stdin);
    }
    inline bool skip(){
        for(;;){
            while(rdLeft!=rdRight and rdbuf[rdLeft]<=' ')rdLeft++;
            if(rdLeft==rdRight){
                reload();
                if(rdLeft==rdRight)return false;
            }
            else break;
        }
        return true;
    }
    template<typename T,enable_if_t<is_integral<T>::value,int> =0>inline bool _read(T& x){
        if(!skip())return false;
        if(rdLeft+20>=rdRight)reload();
        bool neg=false;
        if(rdbuf[rdLeft]=='-'){
            neg=true;
            rdLeft++;
        }
        x=0;
        while(rdbuf[rdLeft]>='0' and rdLeft<rdRight){
            x=x*10+(neg?-(rdbuf[rdLeft++]^48):(rdbuf[rdLeft++]^48));
        }
        return true;
    }
    template<typename T,enable_if_t<is_floating_point<T>::value,int> =0>inline bool _read(T& x){
        if(!skip())return false;
        if(rdLeft+20>=rdRight)reload();
        bool neg=false;
        if(rdbuf[rdLeft]=='-'){
            neg=true;
            rdLeft++;
        }
        x=0;
        while(rdbuf[rdLeft]>='0' and rdbuf[rdLeft]<='9' and rdLeft<rdRight){
            x=x*10+(rdbuf[rdLeft++]^48);
        }
        if(rdbuf[rdLeft]!='.')return true;
        rdLeft++;
        T base=.1;
        while(rdbuf[rdLeft]>='0' and rdbuf[rdLeft]<='9' and rdLeft<rdRight){
            x+=base*(rdbuf[rdLeft++]^48);
            base*=.1;
        }
        if(neg)x=-x;
        return true;
    }
    inline bool _read(char& x){
        if(!skip())return false;
        if(rdLeft+1>=rdRight)reload();
        x=rdbuf[rdLeft++];
        return true;
    }
    inline bool _read(string& x){
        if(!skip())return false;
        for(;;){
            int pos=rdLeft;
            while(pos<rdRight and rdbuf[pos]>' ')pos++;
            x.append(rdbuf+rdLeft,pos-rdLeft);
            if(rdLeft==pos)break;
            rdLeft=pos;
            if(rdLeft==rdRight)reload();
            else break;
        }
        return true;
    }
    template<typename T>inline bool _read(vector<T>& v){
        for(auto& x:v){
            if(!_read(x))return false;
        }
        return true;
    }

    char wtbuf[L],tmp[50];
    int wtRight=0;
    inline void flush(){
        fwrite(wtbuf,1,wtRight,stdout);
        wtRight=0;
    }
    inline void _write(const char& x){
        if(wtRight>L-32)flush();
        wtbuf[wtRight++]=x;
    }
    inline void _write(const string& x){
        for(auto& c:x)_write(c);
    }
    template<typename T,enable_if_t<is_integral<T>::value,int> =0>inline void _write(T x){
        if(wtRight>L-32)flush();
        if(x==0){
            _write('0');
            return;
        }
        else if(x<0){
            _write('-');
            if (__builtin_expect(x == std::numeric_limits<T>::min(), 0)) {
                switch (sizeof(x)) {
                case 2: _write("32768"); return;
                case 4: _write("2147483648"); return;
                case 8: _write("9223372036854775808"); return;
                }
            }
            x=-x;
        }
        int pos=0;
        while(x!=0){
            tmp[pos++]=char((x%10)|48);
            x/=10;
        }
        rep(i,0,pos)wtbuf[wtRight+i]=tmp[pos-1-i];
        wtRight+=pos;
    }
    template<typename T>inline void _write(const vector<T>& v){
        rep(i,0,v.size()){
            if(i)_write(' ');
            _write(v[i]);
        }
    }
public:
    FastIO(){}
    ~FastIO(){flush();}
    inline void read(){}
    template <typename Head, typename... Tail>inline void read(Head& head,Tail&... tail){
        assert(_read(head));
        read(tail...); 
    }
    template<bool ln=true,bool space=false>inline void write(){if(ln)_write('\n');}
    template <bool ln=true,bool space=false,typename Head, typename... Tail>inline void write(const Head& head,const Tail&... tail){
        if(space)_write(' ');
        _write(head);
        write<ln,true>(tail...); 
    }
};

/**
 * @brief Fast IO
 */
#line 3 "sol.cpp"


FastIO io;
int main(){
    const int n=19;
    vector a(n,vector<int>());
    rep(i,0,n){
        int L;
        io.read(L);
        a[i].resize(L);
        io.read(a[i]);
        for(auto& x:a[i])x--;
    }

    vector dp(1<<n,vector<ll>(2));
    dp[0][0]=1;
    vector cand(n+1,vector<int>());
    rep(mask,0,1<<n){
        cand[__builtin_popcountll(mask)].push_back(mask);
    }    
    rep(i,0,n){
        for(auto& key:cand[i])rep(par,0,2)if(dp[key][par]){
            for(auto& add:a[i]){
                if(key>>add&1)continue;
                int nxt=par;
                if(__builtin_popcountll(key>>add)&1)nxt^=1;
                dp[key|(1<<add)][nxt]+=dp[key][par];
            }
        }
    }
    ll all=(1<<n)-1;
    io.write(dp[all][0],dp[all][1]);
    return 0;
}
0