QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#232488 | #7607. The Doubling Game 2 | CharlieVinnie | TL | 55ms | 315656kb | C++17 | 2.1kb | 2023-10-30 15:27:12 | 2023-10-30 15:27:13 |
Judging History
answer
#define _GLIBCXX_DEBUG
#include "bits/stdc++.h"
#ifdef DEBUG
#include "PrettyDebug.hpp"
#else
#define debug(...) [](auto...){}(__VA_ARGS__)
#define debuga(...) [](auto...){}(__VA_ARGS__)
#endif
#define For(i,a,b) for(int i=a;i<=b;i++)
#define Rev(i,a,b) for(int i=a;i>=b;i--)
#define Fin(file) freopen(file,"r",stdin)
#define Fout(file) freopen(file,"w",stdout)
#define assume(expr) ((!!(expr))||(exit((fprintf(stderr,"Assumption Failed: %s on Line %d\n",#expr,__LINE__),-1)),false))
#define range basic_string_view
using namespace std; typedef long long ll;
constexpr int N=3e5+5,mod=1e9+7;
inline void ck(int& x,ll y) { x=(x+y)%mod; }
int n,h[N]; vector<int> to[N],f[N],g[N]; // f up, g down
void dfs(int u,int pa){
if(pa) to[u].erase(find(to[u].begin(),to[u].end(),pa));
for(int v:to[u]) dfs(v,u);
sort(to[u].begin(),to[u].end(),[&](int x,int y){return f[x].size()<f[y].size();});
vector<int> F(1),G(1); F[0]=1;
for(int v:to[u]){
vector<int> F0(1u<<f[v].size()),G0(1u<<f[v].size());
for(auto s=0u;s<F.size();s++){
ck(F0[s],1ll*F[s]*h[v]);
ck(G0[s],1ll*G[s]*h[v]);
for(auto i=0u;i<f[v].size();i++) if(~s>>i&1) {
ck(F0[s|1<<i],1ll*F[s]*f[v][i]);
if(s>(1u<<i)) ck(G0[s|1<<i],1ll*G[s]*f[v][i]);
else ck(G0[s|1<<i],1ll*F[s]*g[v][i]);
}
}
F.swap(F0); G.swap(G0);
}
int o=__lg(F.size()); f[u].resize(o+1); g[u].resize(o+1);
For(k,0,o){
int s=(1<<k)-1; ck(f[u][k],F[s]); ck(g[u][k],F[s]);
For(j,0,k-2) ck(g[u][j],G[s^1<<j]);
For(j,0,k-2) ck(g[u][j],F[s^1<<j]);
ck(h[u],G[s]); ck(h[u],F[s]);
}
}
signed main(){
atexit([](){cerr<<"Time = "<<clock()<<" ms"<<endl;}); ios::sync_with_stdio(0); cin.tie(0);
cin>>n; For(i,1,n-1) { int x,y; cin>>x>>y; to[x].push_back(y); to[y].push_back(x); }
dfs(1,0); cout<<h[1]<<'\n';
return 0;
}
// START TYPING IF YOU DON'T KNOW WHAT TO DO
// STOP TYPING IF YOU DON'T KNOW WHAT YOU'RE DOING
// CONTINUE, NON-STOPPING, FOR CHARLIEVINNIE
// Started Coding On: October 30 Mon, 12 : 47 : 05
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 4ms
memory: 53100kb
input:
5 1 2 1 3 1 4 4 5
output:
21
result:
ok single line: '21'
Test #2:
score: 0
Accepted
time: 14ms
memory: 53960kb
input:
1
output:
1
result:
ok single line: '1'
Test #3:
score: 0
Accepted
time: 9ms
memory: 54116kb
input:
128 11 32 116 81 65 4 117 47 5 81 104 30 61 8 82 59 95 20 92 29 29 127 97 39 123 33 59 128 115 33 83 67 74 16 77 33 64 73 124 123 8 127 61 51 101 122 35 90 119 116 112 27 81 93 109 123 54 1 119 100 116 16 65 47 67 27 22 105 76 87 36 39 27 96 72 31 91 123 21 105 118 12 110 48 121 72 14 115 24 16 106 ...
output:
508800953
result:
ok single line: '508800953'
Test #4:
score: 0
Accepted
time: 15ms
memory: 53116kb
input:
256 53 177 57 242 74 90 107 104 209 169 132 70 152 142 71 168 143 99 91 130 202 140 49 165 209 193 209 137 159 188 247 48 49 21 20 208 155 185 120 231 83 87 37 84 143 18 106 8 114 79 191 158 208 256 133 252 215 92 199 108 166 168 39 217 85 69 204 139 100 75 111 6 230 198 79 130 26 155 155 38 55 81 1...
output:
999869740
result:
ok single line: '999869740'
Test #5:
score: 0
Accepted
time: 11ms
memory: 53236kb
input:
512 507 193 168 152 48 369 273 170 101 349 160 261 438 197 446 224 125 264 210 131 272 218 361 85 226 119 57 33 229 89 37 317 130 417 30 470 435 300 499 417 132 260 196 430 119 117 157 260 207 151 368 277 188 371 214 330 484 228 96 94 97 442 251 461 443 248 163 207 306 147 346 90 457 112 436 222 364...
output:
37387055
result:
ok single line: '37387055'
Test #6:
score: 0
Accepted
time: 19ms
memory: 86068kb
input:
1024 340 598 1 851 245 819 414 736 996 316 300 284 924 407 532 557 362 178 1006 469 397 373 742 77 112 37 406 892 703 666 496 825 1002 100 875 856 263 975 227 6 288 389 661 437 160 626 833 770 912 837 405 628 466 686 45 629 59 13 163 991 1017 422 208 247 344 376 709 956 570 272 996 954 518 454 267 3...
output:
689180079
result:
ok single line: '689180079'
Test #7:
score: 0
Accepted
time: 17ms
memory: 56832kb
input:
2048 2046 1942 589 1449 1593 1983 936 414 387 184 1962 1237 1986 635 573 1619 1598 1109 458 836 1123 1563 1502 519 1467 347 1815 864 980 405 709 433 1682 211 1967 1915 1089 1902 564 211 128 1004 1568 315 293 494 1552 1772 1641 1157 431 1899 1334 1623 161 1870 885 1330 1863 502 1761 1643 692 1759 118...
output:
275839338
result:
ok single line: '275839338'
Test #8:
score: 0
Accepted
time: 36ms
memory: 315656kb
input:
4096 2546 3568 3084 3426 1262 2128 1773 1455 425 3750 3444 3265 3099 464 3479 3651 639 1727 2486 2768 1165 1905 1847 2626 1335 3938 2550 1594 1520 1758 3771 2227 3486 60 381 383 1268 2829 1884 3468 3195 2892 983 31 584 2599 2811 1876 1875 3310 3184 2941 2893 202 1305 1926 1019 1639 3529 1998 2129 12...
output:
99235843
result:
ok single line: '99235843'
Test #9:
score: 0
Accepted
time: 55ms
memory: 86412kb
input:
8192 5663 2164 3712 1600 336 2388 1971 4169 1579 7319 496 8080 5305 982 5508 5777 5324 6680 4636 6745 7295 6086 6948 388 5239 811 1875 7271 5755 2864 2933 795 6448 6716 3016 302 2474 2937 6355 5936 4973 4064 2920 2318 6254 4090 665 2500 961 8180 5416 6371 4958 5430 7905 5013 4373 3068 6557 3867 3056...
output:
79832799
result:
ok single line: '79832799'
Test #10:
score: -100
Time Limit Exceeded
input:
16384 4535 8823 5344 1240 5793 15361 8423 14130 14595 11420 12195 1332 9712 4829 9533 14608 1328 14962 13846 1173 12823 5702 3518 9298 3235 13113 14312 3915 3439 9003 4667 5401 3819 2395 13827 981 3557 11804 7369 11344 15524 1435 4706 15539 12838 2109 4986 5367 2766 4313 6802 12338 12059 3998 6327 5...