結果

問題 No.2152 [Cherry Anniversary 2] 19 Petals of Cherry
ユーザー snukesnuke
提出日時 2022-12-09 00:09:00
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 64 ms / 1,000 ms
コード長 3,602 bytes
コンパイル時間 2,400 ms
コンパイル使用メモリ 205,240 KB
実行使用メモリ 15,404 KB
最終ジャッジ日時 2024-04-22 18:43:33
合計ジャッジ時間 5,514 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 17 ms
15,224 KB
testcase_01 AC 26 ms
15,364 KB
testcase_02 AC 14 ms
15,308 KB
testcase_03 AC 48 ms
15,232 KB
testcase_04 AC 35 ms
15,360 KB
testcase_05 AC 44 ms
15,404 KB
testcase_06 AC 37 ms
15,312 KB
testcase_07 AC 42 ms
15,244 KB
testcase_08 AC 43 ms
15,224 KB
testcase_09 AC 34 ms
15,228 KB
testcase_10 AC 31 ms
15,336 KB
testcase_11 AC 37 ms
15,404 KB
testcase_12 AC 34 ms
15,284 KB
testcase_13 AC 35 ms
15,240 KB
testcase_14 AC 47 ms
15,224 KB
testcase_15 AC 43 ms
15,224 KB
testcase_16 AC 33 ms
15,332 KB
testcase_17 AC 37 ms
15,312 KB
testcase_18 AC 49 ms
15,304 KB
testcase_19 AC 44 ms
15,344 KB
testcase_20 AC 30 ms
15,220 KB
testcase_21 AC 31 ms
15,292 KB
testcase_22 AC 42 ms
15,248 KB
testcase_23 AC 35 ms
15,228 KB
testcase_24 AC 46 ms
15,224 KB
testcase_25 AC 41 ms
15,328 KB
testcase_26 AC 46 ms
15,328 KB
testcase_27 AC 27 ms
15,344 KB
testcase_28 AC 16 ms
15,336 KB
testcase_29 AC 17 ms
15,300 KB
testcase_30 AC 21 ms
15,316 KB
testcase_31 AC 21 ms
15,344 KB
testcase_32 AC 24 ms
15,384 KB
testcase_33 AC 27 ms
15,404 KB
testcase_34 AC 28 ms
15,220 KB
testcase_35 AC 32 ms
15,312 KB
testcase_36 AC 35 ms
15,328 KB
testcase_37 AC 35 ms
15,224 KB
testcase_38 AC 40 ms
15,288 KB
testcase_39 AC 40 ms
15,304 KB
testcase_40 AC 42 ms
15,216 KB
testcase_41 AC 47 ms
15,228 KB
testcase_42 AC 48 ms
15,316 KB
testcase_43 AC 54 ms
15,280 KB
testcase_44 AC 61 ms
15,288 KB
testcase_45 AC 64 ms
15,288 KB
testcase_46 AC 64 ms
15,348 KB
testcase_47 AC 13 ms
15,248 KB
testcase_48 AC 45 ms
15,332 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep1(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < (t); ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define newline puts("")
using namespace std;
template<typename T> using vc = vector<T>;
template<typename T> using vv = vc<vc<T>>;
template<typename T> using PQ = priority_queue<T,vc<T>,greater<T>>;
using uint = unsigned; using ull = unsigned long long;
using vi = vc<int>; using vvi = vv<int>; using vvvi = vv<vi>;
using ll = long long; using vl = vc<ll>; using vvl = vv<ll>; using vvvl = vv<vl>;
using P = pair<int,int>; using vp = vc<P>; using vvp = vv<P>;
int geti(){int x;scanf("%d",&x);return x;}
vi pm(int n, int s=0) { vi a(n); iota(rng(a),s); return a;}
template<typename T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<typename T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v," ");return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;}
template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int){a.fi--;a.se--;}
template<typename T>void operator--(vc<T>&a,int){for(T&x:a)x--;}
template<typename T>void operator++(vc<T>&a,int){for(T&x:a)x++;}
template<typename T>void operator+=(vc<T>&a,T b){for(T&x:a)x+=b;}
template<typename T>void operator+=(vc<T>&a,const vc<T>&b){a.insert(a.end(),rng(b));}
template<typename T1,typename T2>bool mins(T1& x,const T2&y){if(x>y){x=y;return true;}else return false;}
template<typename T1,typename T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;}
template<typename Tx, typename Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}
template<typename T>ll suma(const vc<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
template<typename T>ll suma(const vv<T>&a){ll res(0);for(auto&&x:a)res+=suma(x);return res;}
template<typename T>void uni(T& a){sort(rng(a));a.erase(unique(rng(a)),a.end());}
template<typename T>void prepend(vc<T>&a,const T&x){a.insert(a.begin(),x);}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return;}
#define yes { puts("Yes"); return;}
#define no { puts("No"); return;}
#define ret(x) { cout<<(x)<<endl; return;}
#define yn {puts("Yes");}else{puts("No");}
const int MX = 200005;

struct Solver {
  void solve() {
    int n = 19;
    int n2 = 1<<n;
    vvl dp(2,vl(n2));
    vvi is(n+1);
    rep(i,n2) is[pcnt(i)].pb(i);
    dp[0][0] = 1;
    rep(ni,n) {
      int m;
      scanf("%d",&m);
      vi a(m);
      cin>>a;
      a--;
      for (int s : is[ni]) {
        for (int i : a) if (~s>>i&1) {
          int x = pcnt(s>>i)&1;
          rep(o,2) {
            dp[o^x][s|1<<i] += dp[o][s];
          }
        }
      }
    }
    ll a0 = dp[0][n2-1], a1 = dp[1][n2-1];
    cout<<a0<<" "<<a1<<endl;
  }
};

int main() {
  // cin.tie(nullptr); ios::sync_with_stdio(false);
  int ts = 1;
  // scanf("%d",&ts);
  rep1(ti,ts) {
    Solver solver;
    solver.solve();
  }
  return 0;
}
0