結果
問題 | No.2152 [Cherry Anniversary 2] 19 Petals of Cherry |
ユーザー | 👑 Nachia |
提出日時 | 2022-12-09 00:05:57 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 73 ms / 1,000 ms |
コード長 | 2,238 bytes |
コンパイル時間 | 908 ms |
コンパイル使用メモリ | 80,352 KB |
実行使用メモリ | 11,520 KB |
最終ジャッジ日時 | 2024-11-15 02:54:09 |
合計ジャッジ時間 | 5,493 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 54 ms
11,368 KB |
testcase_01 | AC | 68 ms
11,392 KB |
testcase_02 | AC | 47 ms
11,372 KB |
testcase_03 | AC | 65 ms
11,420 KB |
testcase_04 | AC | 67 ms
11,392 KB |
testcase_05 | AC | 70 ms
11,392 KB |
testcase_06 | AC | 67 ms
11,520 KB |
testcase_07 | AC | 68 ms
11,392 KB |
testcase_08 | AC | 65 ms
11,264 KB |
testcase_09 | AC | 69 ms
11,392 KB |
testcase_10 | AC | 67 ms
11,412 KB |
testcase_11 | AC | 65 ms
11,436 KB |
testcase_12 | AC | 67 ms
11,264 KB |
testcase_13 | AC | 65 ms
11,392 KB |
testcase_14 | AC | 69 ms
11,392 KB |
testcase_15 | AC | 69 ms
11,392 KB |
testcase_16 | AC | 68 ms
11,392 KB |
testcase_17 | AC | 68 ms
11,440 KB |
testcase_18 | AC | 67 ms
11,520 KB |
testcase_19 | AC | 69 ms
11,380 KB |
testcase_20 | AC | 64 ms
11,392 KB |
testcase_21 | AC | 70 ms
11,392 KB |
testcase_22 | AC | 71 ms
11,392 KB |
testcase_23 | AC | 67 ms
11,392 KB |
testcase_24 | AC | 69 ms
11,396 KB |
testcase_25 | AC | 68 ms
11,392 KB |
testcase_26 | AC | 67 ms
11,392 KB |
testcase_27 | AC | 64 ms
11,264 KB |
testcase_28 | AC | 53 ms
11,264 KB |
testcase_29 | AC | 57 ms
11,392 KB |
testcase_30 | AC | 61 ms
11,264 KB |
testcase_31 | AC | 64 ms
11,264 KB |
testcase_32 | AC | 65 ms
11,392 KB |
testcase_33 | AC | 67 ms
11,308 KB |
testcase_34 | AC | 67 ms
11,520 KB |
testcase_35 | AC | 68 ms
11,392 KB |
testcase_36 | AC | 68 ms
11,392 KB |
testcase_37 | AC | 70 ms
11,392 KB |
testcase_38 | AC | 71 ms
11,392 KB |
testcase_39 | AC | 73 ms
11,392 KB |
testcase_40 | AC | 73 ms
11,388 KB |
testcase_41 | AC | 73 ms
11,392 KB |
testcase_42 | AC | 70 ms
11,392 KB |
testcase_43 | AC | 67 ms
11,392 KB |
testcase_44 | AC | 64 ms
11,392 KB |
testcase_45 | AC | 55 ms
11,264 KB |
testcase_46 | AC | 62 ms
11,264 KB |
testcase_47 | AC | 47 ms
11,392 KB |
testcase_48 | AC | 72 ms
11,516 KB |
ソースコード
#line 1 "Main.cpp" #include <iostream> #include <string> #include <vector> #include <algorithm> #include <utility> #include <atcoder/modint> #line 1 "nachia\\misc\\bit-operations.hpp" #line 4 "nachia\\misc\\bit-operations.hpp" namespace nachia{ int Popcount(unsigned long long c) noexcept { #ifdef __GNUC__ return __builtin_popcountll(c); #else c = (c & (~0ull/3)) + ((c >> 1) & (~0ull/3)); c = (c & (~0ull/5)) + ((c >> 2) & (~0ull/5)); c = (c & (~0ull/17)) + ((c >> 4) & (~0ull/17)); c = (c * (~0ull/257)) >> 56; return c; #endif } // please ensure x != 0 int MsbIndex(unsigned long long x) noexcept { #ifdef __GNUC__ return 63 - __builtin_clzll(x); #else int res = 0; for(int d=32; d>=0; d>>=1) if(x >> d){ res |= d; x >>= d; } return res; #endif } // please ensure x != 0 int LsbIndex(unsigned long long x) noexcept { #ifdef __GNUC__ return __builtin_ctzll(x); #else return msb_idx(x & -x); #endif } } #line 8 "Main.cpp" using namespace std; using i32 = int32_t; using u32 = uint32_t; using i64 = int64_t; using u64 = uint64_t; #define rep(i,n) for(int i=0; i<(int)(n); i++) const i64 INF = 1001001001001001001; using Modint = atcoder::static_modint<1000000007>; int main(){ const int N = 19; int B[N] = {}; rep(i,N){ int L; cin >> L; rep(j,L){ int a; cin >> a; a--; B[i] |= (1<<a); } } vector<pair<i64, i64>> dp(1<<N); dp[0] = {1,0}; rep(b,1<<N){ int k = nachia::Popcount(b); rep(i,N) if(!(b&(1<<i))) if(B[k]&(1<<i)){ int c = nachia::Popcount(b>>i) % 2; if(c == 0){ dp[b|(1<<i)].first += dp[b].first; dp[b|(1<<i)].second += dp[b].second; } else{ dp[b|(1<<i)].second += dp[b].first; dp[b|(1<<i)].first += dp[b].second; } } } cout << dp.back().first << " " << dp.back().second << '\n'; return 0; } struct ios_do_not_sync{ ios_do_not_sync(){ std::ios::sync_with_stdio(false); std::cin.tie(nullptr); } } ios_do_not_sync_instance;