結果
問題 | No.2152 [Cherry Anniversary 2] 19 Petals of Cherry |
ユーザー | PCTprobability |
提出日時 | 2022-12-09 00:06:43 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 5,226 bytes |
コンパイル時間 | 5,571 ms |
コンパイル使用メモリ | 285,124 KB |
実行使用メモリ | 159,716 KB |
最終ジャッジ日時 | 2024-10-14 18:14:13 |
合計ジャッジ時間 | 28,285 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 100 ms
122,368 KB |
testcase_01 | AC | 238 ms
159,104 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 691 ms
159,104 KB |
testcase_04 | AC | 494 ms
153,600 KB |
testcase_05 | AC | 468 ms
159,220 KB |
testcase_06 | AC | 505 ms
153,600 KB |
testcase_07 | AC | 469 ms
155,008 KB |
testcase_08 | AC | 512 ms
150,656 KB |
testcase_09 | AC | 370 ms
155,136 KB |
testcase_10 | AC | 502 ms
158,080 KB |
testcase_11 | AC | 491 ms
159,104 KB |
testcase_12 | AC | 349 ms
159,104 KB |
testcase_13 | AC | 383 ms
152,192 KB |
testcase_14 | AC | 443 ms
155,008 KB |
testcase_15 | AC | 487 ms
157,184 KB |
testcase_16 | AC | 386 ms
157,056 KB |
testcase_17 | AC | 418 ms
159,104 KB |
testcase_18 | AC | 498 ms
155,136 KB |
testcase_19 | AC | 480 ms
159,104 KB |
testcase_20 | AC | 296 ms
146,944 KB |
testcase_21 | AC | 383 ms
155,008 KB |
testcase_22 | AC | 419 ms
157,568 KB |
testcase_23 | AC | 384 ms
155,136 KB |
testcase_24 | AC | 590 ms
159,232 KB |
testcase_25 | AC | 403 ms
159,104 KB |
testcase_26 | AC | 528 ms
159,104 KB |
testcase_27 | AC | 407 ms
155,136 KB |
testcase_28 | AC | 89 ms
122,240 KB |
testcase_29 | AC | 118 ms
142,848 KB |
testcase_30 | AC | 149 ms
151,936 KB |
testcase_31 | AC | 169 ms
156,032 KB |
testcase_32 | AC | 197 ms
157,952 KB |
testcase_33 | AC | 210 ms
158,720 KB |
testcase_34 | AC | 240 ms
158,976 KB |
testcase_35 | AC | 279 ms
159,104 KB |
testcase_36 | AC | 325 ms
159,232 KB |
testcase_37 | AC | 408 ms
158,976 KB |
testcase_38 | AC | 452 ms
158,976 KB |
testcase_39 | AC | 533 ms
159,104 KB |
testcase_40 | AC | 581 ms
159,232 KB |
testcase_41 | AC | 677 ms
159,104 KB |
testcase_42 | AC | 736 ms
159,232 KB |
testcase_43 | AC | 837 ms
159,104 KB |
testcase_44 | AC | 911 ms
159,104 KB |
testcase_45 | TLE | - |
testcase_46 | AC | 995 ms
159,716 KB |
testcase_47 | AC | 2 ms
5,248 KB |
testcase_48 | AC | 565 ms
150,912 KB |
ソースコード
#include <bits/stdc++.h>using namespace std;#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#if __has_include(<atcoder/all>)#include <atcoder/all>using namespace atcoder;#endifusing ll = long long;using ld = long double;using ull = unsigned long long;#define endl "\n"typedef pair<int, int> Pii;#define REP(i, n) for (int i = 0; i < (n); ++i)#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)#define ALL(x) begin(x), end(x)#define rrep(i,a,b) for(int i=a;i>=b;i--)#define fore(i,a) for(auto &i:a)#define all(s) (s).begin(),(s).end()#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)#define drep(i, n) drep2(i, n, 0)#define rever(vec) reverse(vec.begin(), vec.end())#define sor(vec) sort(vec.begin(), vec.end())#define fi first#define se second#define pb push_back#define P pair<ll,ll>#define PQminll priority_queue<ll, vector<ll>, greater<ll>>#define PQmaxll priority_queue<ll,vector<ll>,less<ll>>#define PQminP priority_queue<P, vector<P>, greater<P>>#define PQmaxP priority_queue<P,vector<P>,less<P>>#define NP next_permutation//const ll mod = 1000000009;const ll mod = 998244353;//const ll mod = 1000000007;const ll inf = 4100000000000000000ll;const ld eps = ld(0.00000000001);static const long double pi = 3.141592653589793;template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];}template<class T,class K>void vcin(vector<T> &n,vector<K> &m){for(int i=0;i<int(n.size());i++) cin>>n[i]>>m[i];}template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;}template<class T>void vcin(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cin>>n[i][j];}}}template<class T>void vcout(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cout<<n[i][j]<<" ";}cout<<endl;}cout<<endl;}void yes(bool a){cout<<(a?"yes":"no")<<endl;}void YES(bool a){cout<<(a?"YES":"NO")<<endl;}void Yes(bool a){cout<<(a?"Yes":"No")<<endl;}void possible(bool a){ cout<<(a?"possible":"impossible")<<endl; }void Possible(bool a){ cout<<(a?"Possible":"Impossible")<<endl; }void POSSIBLE(bool a){ cout<<(a?"POSSIBLE":"IMPOSSIBLE")<<endl; }template<class T>auto min(const T& a){ return *min_element(all(a)); }template<class T>auto max(const T& a){ return *max_element(all(a)); }template<class T,class F>void print(pair<T,F> a){cout<<a.fi<<" "<<a.se<<endl;}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<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}ll fastgcd(ll u,ll v){ll shl=0;while(u&&v&&u!=v){bool eu=!(u&1);bool ev=!(v&1);if(eu&&ev){++shl;u>>=1;v>>=1;}else if(eu&&!ev){u>>=1;}else if(!eu&&ev){v>>=1;}else if(u>=v){u=(u-v)>>1;}else{ll tmp=u;u=(v-u)>>1;v=tmp;}}return !u?v<<shl:u<<shl;}ll modPow(ll a, ll n, ll mod) { if(mod==1) return 0;ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1;} return ret; }vector<ll> divisor(ll x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++){ if(x % i == 0) {ans.push_back(i); if(i*i!=x){ ans.push_back(x / ans[i]);}}}sor(ans); return ans; }ll pop(ll x){return __builtin_popcountll(x);}ll poplong(ll x){ll y=-1;while(x){x/=2;y++;}return y;}P hyou(P a){ll x=fastgcd(abs(a.fi),abs(a.se));a.fi/=x;a.se/=x;if(a.se<0){a.fi*=-1;a.se*=-1;}return a;}P Pplus(P a,P b){ return hyou({a.fi*b.se+b.fi*a.se,a.se*b.se});}P Ptimes(P a,ll b){ return hyou({a.fi*b,a.se});}P Ptimes(P a,P b){ return hyou({a.fi*b.fi,a.se*b.se});}P Pminus(P a,P b){ return hyou({a.fi*b.se-b.fi*a.se,a.se*b.se});}P Pgyaku(P a){ return hyou({a.se,a.fi});}template<class T>struct Sum{vector<T> data;Sum(const vector<T>& v):data(v.size()+1){for(ll i=0;i<v.size();i++) data[i+1]=data[i]+v[i];}T get(ll l,ll r) const {return data[r]-data[l];}};template<class T>struct Sum2{vector<vector<T>> data;Sum2(const vector<vector<T>> &v):data(v.size()+1,vector<T>(v[0].size()+1)){for(int i=0;i<v.size();i++) for(int j=0;j<v[i].size();j++) data[i+1][j+1]=data[i][j+1]+v[i][j];for(int i=0;i<v.size();i++) for(int j=0;j<v[i].size();j++) data[i+1][j+1]+=data[i+1][j];}T get(ll x1,ll y1,ll x2,ll y2) const {return data[x2][y2]+data[x1][y1]-data[x1][y2]-data[x2][y1];}};void cincout(){ios::sync_with_stdio(false);std::cin.tie(nullptr);cout<< fixed << setprecision(15);}ll dp[20][1<<19][2];int main() {cincout();dp[0][0][0]=1;for(int i=0;i<19;i++){ll n;cin>>n;vector<ll> a(n);vcin(a);for(auto &e:a) e--;for(int j=0;j<(1<<19);j++){for(int k=0;k<n;k++){if((j>>a[k])&1) continue;dp[i+1][j^(1<<a[k])][pop(j>>a[k])%2]+=dp[i][j][0];dp[i+1][j^(1<<a[k])][(pop(j>>a[k])%2)^1]+=dp[i][j][1];}}}cout<<dp[19][(1<<19)-1][0]<<" "<<dp[19][(1<<19)-1][1]<<endl;}