結果

問題 No.2152 [Cherry Anniversary 2] 19 Petals of Cherry
ユーザー a16784542a16784542
提出日時 2022-12-17 15:43:40
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 334 ms / 1,000 ms
コード長 3,720 bytes
コンパイル時間 4,634 ms
コンパイル使用メモリ 265,760 KB
実行使用メモリ 34,516 KB
最終ジャッジ日時 2024-04-28 10:11:54
合計ジャッジ時間 15,797 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 67 ms
34,384 KB
testcase_01 AC 142 ms
34,512 KB
testcase_02 AC 46 ms
34,388 KB
testcase_03 AC 248 ms
34,384 KB
testcase_04 AC 175 ms
34,516 KB
testcase_05 AC 219 ms
34,392 KB
testcase_06 AC 190 ms
34,388 KB
testcase_07 AC 225 ms
34,388 KB
testcase_08 AC 191 ms
34,516 KB
testcase_09 AC 160 ms
34,408 KB
testcase_10 AC 187 ms
34,388 KB
testcase_11 AC 178 ms
34,384 KB
testcase_12 AC 189 ms
34,388 KB
testcase_13 AC 190 ms
34,388 KB
testcase_14 AC 210 ms
34,404 KB
testcase_15 AC 256 ms
34,516 KB
testcase_16 AC 198 ms
34,388 KB
testcase_17 AC 185 ms
34,516 KB
testcase_18 AC 235 ms
34,388 KB
testcase_19 AC 206 ms
34,388 KB
testcase_20 AC 144 ms
34,384 KB
testcase_21 AC 187 ms
34,388 KB
testcase_22 AC 223 ms
34,516 KB
testcase_23 AC 212 ms
34,384 KB
testcase_24 AC 248 ms
34,392 KB
testcase_25 AC 228 ms
34,384 KB
testcase_26 AC 210 ms
34,388 KB
testcase_27 AC 123 ms
34,388 KB
testcase_28 AC 65 ms
34,388 KB
testcase_29 AC 83 ms
34,384 KB
testcase_30 AC 95 ms
34,380 KB
testcase_31 AC 114 ms
34,508 KB
testcase_32 AC 125 ms
34,516 KB
testcase_33 AC 156 ms
34,384 KB
testcase_34 AC 164 ms
34,512 KB
testcase_35 AC 202 ms
34,512 KB
testcase_36 AC 199 ms
34,384 KB
testcase_37 AC 211 ms
34,388 KB
testcase_38 AC 231 ms
34,384 KB
testcase_39 AC 245 ms
34,392 KB
testcase_40 AC 261 ms
34,388 KB
testcase_41 AC 288 ms
34,388 KB
testcase_42 AC 297 ms
34,388 KB
testcase_43 AC 304 ms
34,392 KB
testcase_44 AC 311 ms
34,512 KB
testcase_45 AC 334 ms
34,404 KB
testcase_46 AC 330 ms
34,392 KB
testcase_47 AC 47 ms
34,516 KB
testcase_48 AC 237 ms
34,392 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#if !__INCLUDE_LEVEL__

#include __FILE__

struct Solver {
void solve() {
	const int n=19;
	V<V<int>> a(n);
	rep(i,n){
		int l;cin>>l;
		a[i].resize(l);
		rep(j,l){
			cin>>a[i][j];
			a[i][j]--;
		}
	}

	// V<V<V<ll>>> dp(2,V<V<ll>> (1<<n,V<ll>(2)));
	V<V<ll>> dp(1<<n,V<ll>(2));
	dp[0][0]=1;
	auto f = [&](const int &k,const int &x,const int &l){
		int res=l;
		rep(i,x){
			if((k>>i)&1)res++;
		}
		return res&1;
	};
	

	V<V<int>> x(n+1);
	rep(i,1<<n){
		x[bp(i)].emplace_back(i);
	}
	rep(i,n){
		rep(j,sz(a[i])){
			int ai=a[i][j];
			fore(k,x[i]){
				if((k>>ai)&1)continue;
				rep(l,2){
					int t=f(k,ai,l);
					dp[k|(1<<ai)][t]+=dp[k][l];
				}
			}
		}
	}

	cout<<dp[(1<<n)-1][1]<<" ";
	cout<<dp[(1<<n)-1][0]<<endl;
}};

signed main() {
	int ts = 1;
	// scanf("%lld",&ts);
	rep(ti,ts) {
		Solver solver;
		solver.solve();
	}
	return 0;
}

#else

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;

using namespace std;

// #define int ll

using ll=long long;
using ld = long double;
using uint = unsigned;
using ull = unsigned long long;
using P=pair<int,int>;
using TP=tuple<int,int,int>;
template <class T> using V = vector<T>;
template <class T> using max_heap = priority_queue<T>;
template <class T> using min_heap = priority_queue<T, vector<T>, greater<>>;

#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)
#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)
#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)
#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))
#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)
#define FOR4_R(i, a, b, c) for (ll i = (b)-1; i >= ll(a); i -= (c))
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define rrep(...) overload4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)
#define fore(i,a) for(auto &i:a)

#define all(x) x.begin(),x.end() 
#define sz(x) ((int)(x).size())
#define bp(x) (__builtin_popcountll((long long)(x)))
#define elif else if
#define mpa make_pair
#define bit(n) (1LL<<(n))
#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
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 vector<T>&v){if(sz(v))o<<join(v," ");return o;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.first<<","<<v.second;}
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 vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
template<typename T>ll suma(const V<V<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(vector<T>&a,const T&x){a.insert(a.begin(),x);}

const int INF = 1001001001;
const ll INFL = 3e18;
const int MAX = 2e6+5;


#endif
0