結果
問題 | No.2152 [Cherry Anniversary 2] 19 Petals of Cherry |
ユーザー | karinohito |
提出日時 | 2022-12-09 00:09:47 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 200 ms / 1,000 ms |
コード長 | 3,247 bytes |
コンパイル時間 | 2,170 ms |
コンパイル使用メモリ | 205,688 KB |
実行使用メモリ | 171,420 KB |
最終ジャッジ日時 | 2024-10-14 18:15:49 |
合計ジャッジ時間 | 11,853 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 139 ms
171,160 KB |
testcase_01 | AC | 140 ms
171,292 KB |
testcase_02 | AC | 141 ms
171,164 KB |
testcase_03 | AC | 179 ms
171,292 KB |
testcase_04 | AC | 154 ms
171,292 KB |
testcase_05 | AC | 193 ms
171,292 KB |
testcase_06 | AC | 152 ms
171,224 KB |
testcase_07 | AC | 164 ms
171,164 KB |
testcase_08 | AC | 177 ms
171,292 KB |
testcase_09 | AC | 142 ms
171,164 KB |
testcase_10 | AC | 181 ms
171,160 KB |
testcase_11 | AC | 161 ms
171,296 KB |
testcase_12 | AC | 142 ms
171,420 KB |
testcase_13 | AC | 153 ms
171,292 KB |
testcase_14 | AC | 167 ms
171,292 KB |
testcase_15 | AC | 168 ms
171,164 KB |
testcase_16 | AC | 166 ms
171,292 KB |
testcase_17 | AC | 176 ms
171,292 KB |
testcase_18 | AC | 173 ms
171,292 KB |
testcase_19 | AC | 177 ms
171,292 KB |
testcase_20 | AC | 137 ms
171,296 KB |
testcase_21 | AC | 181 ms
171,164 KB |
testcase_22 | AC | 158 ms
171,296 KB |
testcase_23 | AC | 154 ms
171,288 KB |
testcase_24 | AC | 185 ms
171,292 KB |
testcase_25 | AC | 180 ms
171,160 KB |
testcase_26 | AC | 174 ms
171,164 KB |
testcase_27 | AC | 171 ms
171,292 KB |
testcase_28 | AC | 140 ms
171,164 KB |
testcase_29 | AC | 142 ms
171,288 KB |
testcase_30 | AC | 143 ms
171,288 KB |
testcase_31 | AC | 137 ms
171,420 KB |
testcase_32 | AC | 139 ms
171,292 KB |
testcase_33 | AC | 139 ms
171,288 KB |
testcase_34 | AC | 147 ms
171,288 KB |
testcase_35 | AC | 151 ms
171,244 KB |
testcase_36 | AC | 160 ms
171,292 KB |
testcase_37 | AC | 173 ms
171,220 KB |
testcase_38 | AC | 180 ms
171,292 KB |
testcase_39 | AC | 187 ms
171,164 KB |
testcase_40 | AC | 190 ms
171,292 KB |
testcase_41 | AC | 190 ms
171,292 KB |
testcase_42 | AC | 193 ms
171,288 KB |
testcase_43 | AC | 195 ms
171,196 KB |
testcase_44 | AC | 200 ms
171,292 KB |
testcase_45 | AC | 192 ms
171,296 KB |
testcase_46 | AC | 192 ms
171,292 KB |
testcase_47 | AC | 136 ms
171,196 KB |
testcase_48 | AC | 179 ms
171,292 KB |
ソースコード
#include <bits/stdc++.h>using namespace std;//#include <atcoder/all>//using namespace atcoder;using ll = long long;using vll = vector<ll>;using vvll = vector<vll>;using vvvll = vector<vvll>;using vvvvll = vector<vvvll>;using vvvvvll = vector<vvvvll>;using vvvvvvll = vector<vvvvvll>;using vb = vector<bool>;using vvb = vector<vb>;using vvvb = vector<vvb>;using vvvvb = vector<vvvb>;using vd = vector<double>;using vvd = vector<vd>;using vvvd = vector<vvd>;using vvvvd = vector<vvvd>;using vvvvvd = vector<vvvvd>;#define all(A) A.begin(),A.end()#define ALL(A) A.begin(),A.end()#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)using pqr = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>;template<class T>bool chmax(T& p, T q, bool C = 1) {if (C == 0 && p == q) {return 1;}if (p < q) {p = q;return 1;}else {return 0;}}template<class T>bool chmin(T& p, T q, bool C = 1) {if (C == 0 && p == q) {return 1;}if (p > q) {p = q;return 1;}else {return 0;}}ll gcd(ll(a), ll(b)) {if (a == 0)return b;if (b == 0)return a;ll c = a;while (a % b != 0) {c = a % b;a = b;b = c;}return b;}ll sqrtz(ll N) {ll L = 0;ll R = sqrt(N) + 10000;while (abs(R - L) > 1) {ll mid = (R + L) / 2;if (mid * mid <= N)L = mid;else R = mid;}return L;}/*using mint = modint998244353;//using Mint = modint;vector<mint> fact, factinv, inv;const ll mod = 998244353;void prenCkModp(ll n) {fact.resize(n + 5);factinv.resize(n + 5);inv.resize(n + 5);fact[0] = fact[1] = 1;factinv[0] = factinv[1] = 1;inv[1] = 1;for (ll i = 2; i < n + 5; i++) {fact[i] = (fact[i - 1] * i);inv[i] = mod - (inv[mod % i] * (mod / i));factinv[i] = (factinv[i - 1] * inv[i]);}}mint nCk(ll n, ll k) {if (n < k || k < 0) return 0;return fact[n] * (factinv[k] * factinv[n - k]);}*/int main() {ll N=19;vvll D(N,vll(N,0));rep(i,N){ll L;cin>>L;rep(j,L){ll A;cin>>A;A--;D[i][A]=1;}}vvll DPE(N+1,vll(1<<N,0)),DPO(N+1,vll(1<<N,0));DPE[0][0]=1;rep(i,N){rep(bit,(1<<N)){if(DPE[i][bit]==0&&DPO[i][bit]==0)continue;ll cnt=0;rep(j,N){if(bit&(1<<j)){cnt++;continue;}else{if(D[i][j]==0)continue;else {if((i-cnt)%2!=0){DPE[i+1][bit+(1<<j)]+=DPO[i][bit];DPO[i+1][bit+(1<<j)]+=DPE[i][bit];}else{DPO[i+1][bit+(1<<j)]+=DPO[i][bit];DPE[i+1][bit+(1<<j)]+=DPE[i][bit];}}}}}}cout<<DPE[N][(1<<N)-1]<<" "<<DPO[N][(1<<N)-1]<<endl;}