QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#90583 | #5020. 举办乘凉州喵,举办乘凉州谢谢喵 | OtoriEmu | 8 | 1286ms | 116768kb | C++14 | 4.8kb | 2023-03-23 20:12:35 | 2023-03-23 20:12:38 |
Judging History
answer
/*
¤ï¤ó¤ï¤ó¡¡¤ï¤ó¤À¤Û©`¤¤¤Ã¡î
Wonderhoy!
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double DB;
char buf[1<<21],*p1=buf,*p2=buf;
#define getchar() (p1==p2 && (p2=(p1=buf)+fread(buf,1,1<<18,stdin),p1==p2)?EOF:*p1++)
int read()
{
int x=0;
char c=getchar();
while(c<'0' || c>'9') c=getchar();
while(c>='0' && c<='9') x=(x<<1)+(x<<3)+(c^'0'),c=getchar();
return x;
}
void write(int x)
{
if(x>9) write(x/10);
putchar(x%10+'0');
}
typedef pair<int,int> P;
typedef vector<int> Poly;
typedef vector<P> PolyP;
#define mp make_pair
#define spc putchar(' ')
#define etr putchar('\n')
#define inlp(x,y) putchar(x==y?'\n':' ')
Poly G[200005];
int fa[19][200005];
#define F(u) fa[0][u]
int dep[200005],son[200005],siz[200005],h[200005];
void dfs1(int u,int f)
{
F(u)=f;
dep[u]=dep[f]+1;
siz[u]=1;
for(int v:G[u])
{
if(v==f) continue;
dfs1(v,u),siz[u]+=siz[v];
if(siz[v]>siz[son[u]]) son[u]=v;
h[u]=max(h[u],h[v]+1);
}
}
int top[200005];
void dfs2(int u,int t)
{
top[u]=t;
if(son[u]) dfs2(son[u],t);
for(int v:G[u]) if((v^F(u)) && (v^son[u])) dfs2(v,v);
}
int n,q;
int ans[200005];
inline int lowbit(int x){return x&(-x);}
namespace subt1
{
int mx[200005],rt,s,sz[200005];
PolyP qry[200005];
bool del[200005];
void getrt(int u,int f)
{
sz[u]=1,mx[u]=0;
for(int v:G[u])
{
if(v==f || del[v]) continue;
getrt(v,u);
sz[u]+=sz[v];
mx[u]=max(mx[u],sz[v]);
}
mx[u]=max(mx[u],s-sz[u]);
if(mx[u]<mx[rt]) rt=u;
}
int dp[200005];
int cnt[200005];
Poly subt;
int up;
void dfs(int u,int f)
{
++cnt[dp[u]];
up=max(up,dp[u]),subt.push_back(u);
for(int v:G[u])
{
if(v==f || del[v]) continue;
dp[v]=dp[u]+1;
dfs(v,u);
}
}
void solve(int u,int f,int coef)
{
subt.clear(),up=0;
dfs(u,f);
for(int i=1;i<=up;++i) cnt[i]+=cnt[i-1];
for(int p:subt)
{
for(P st:qry[p])
{
int d=st.first,id=st.second;
if(d>=dp[p]) ans[id]+=coef*cnt[min(up,d-dp[p])];
}
}
for(int i=0;i<=up;++i) cnt[i]=0;
}
void solve(int u)
{
// write(u),etr;
// write(s),etr;
del[u]=true,dp[u]=0;
solve(u,0,1);
for(int v:G[u]) if(!del[v]) solve(v,u,-1);
for(int v:G[u])
{
if(del[v]) continue;
s=sz[v],rt=0;
getrt(v,u);
solve(rt);
}
}
void solve()
{
mx[rt=0]=1e9;
s=n,getrt(1,0);
solve(rt);
}
}
namespace subt2
{
PolyP qry[200005];
void add(int u,int v,int d,int id)
{
while(top[u]^top[v])
{
if(son[u]) qry[son[u]].emplace_back(d,-id);
qry[top[u]].emplace_back(d,id);
u=F(top[u]);
}
if(son[u]) qry[son[u]].emplace_back(d,-id);
if(son[v]) qry[son[v]].emplace_back(d,id); // son of v -> u
}
int *f[200005],dp[400005],*now=dp;
int tr[400005];
const int N=4e5;
int ver[400005],vc;
void modify(int x,int w)
{
for(int i=x;i;i^=lowbit(i))
{
if(ver[i]^vc) ver[i]=vc,tr[i]=0;
tr[i]+=w;
}
}
int query(int x)
{
int ans=0;
for(int i=x;i<=N;i+=lowbit(i))
{
if(ver[i]^vc) ver[i]=vc,tr[i]=0;
ans+=tr[i];
}
return ans;
}
void dfs(int u)
{
f[u][0]=1;
if(son[u]) f[son[u]]=f[u]+1,dfs(son[u]);
for(int v:G[u])
{
if(v==F(u) || v==son[u]) continue;
f[v]=now,now+=h[v]+1;
dfs(v);
for(int i=0;i<=h[v];++i) f[u][i+1]+=f[u][i];
}
if(u==top[u])
{
#undef F
vector<PolyP> E(h[u]+1),F(h[u]+1);
int cnt=0;
for(int x=u;x;x=son[x])
{
++cnt;
for(P st:qry[x])
{
int d=st.first,id=st.second;
if(d<=h[x]) E[d].emplace_back(cnt+d,id);
}
F[0].emplace_back(1,cnt);
for(int y:G[x])
{
if(y==son[x] || y==fa[0][x]) continue;
for(int i=0;i<=h[y];++i) F[i+1].emplace_back(f[y][i],cnt+i+1);
}
}
++vc;
for(int i=0;i<=h[u];++i)
{
for(P st:F[i]) modify(st.second,st.first);
for(P st:E[i])
{
int d=st.first,id=st.second;
if(id<0) ans[-id]-=query(d);
else ans[id]+=query(d);
}
}
}
}
inline void solve(){f[1]=now,now+=h[1]+1,dfs(1);}
}
int LCA(int u,int v)
{
if(dep[u]>dep[v]) swap(u,v);
while(dep[u]<dep[v]) v=fa[__lg(dep[v]-dep[u])][v];
if(u==v) return u;
for(int i=18;~i;--i) if(fa[i][u]^fa[i][v]) u=fa[i][u],v=fa[i][v];
return fa[0][u];
}
int main(){
// freopen("data11.in","r",stdin);
n=read();
for(int i=1;i<n;++i)
{
int u=read(),v=read();
G[u].push_back(v);
G[v].push_back(u);
}
q=read();
dfs1(1,0),dfs2(1,1);
for(int i=1;i<=18;++i) for(int j=1;j<=n;++j) fa[i][j]=fa[i-1][fa[i-1][j]];
for(int i=1;i<=q;++i)
{
int u=read(),v=read(),d=read();
int p=LCA(u,v);
subt1::qry[p].emplace_back(d,i);
subt2::add(u,p,d,i),subt2::add(v,p,d,i);
}
subt1::solve();
subt2::solve();
for(int i=1;i<=q;++i) write(ans[i]),etr;
return 0;
}
詳細信息
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 0
Wrong Answer
time: 18ms
memory: 19460kb
input:
4988 1 2 1 3 1 4 4 5 1 6 3 7 3 8 5 9 4 10 6 11 3 12 9 13 11 14 8 15 11 16 1 17 7 18 8 19 18 20 7 21 10 22 15 23 18 24 4 25 24 26 9 27 23 28 3 29 3 30 30 31 11 32 18 33 2 34 32 35 29 36 29 37 19 38 9 39 6 40 25 41 16 42 31 43 6 44 42 45 32 46 27 47 32 48 44 49 7 50 10 51 24 52 46 53 30 54 46 55 39 56...
output:
13082 3877 4988 208 252 17959 17286 3825 4974 2846 308 406 24967 312 4955 4988 4974 1963 4981 12 3713 4918 4974 4974 19 82 5257 8135 208 5166 498 6369 942 2955 213 13617 1727 279 84 4869 14072 70 81 28165 5257 742 12163 4974 113 526 75 163 209 4529 4981 19655 100 11799 232 66 4864 583 5254 390 22812...
result:
wrong answer 1st numbers differ - expected: '3226', found: '13082'
Subtask #2:
score: 8
Accepted
Test #9:
score: 8
Accepted
time: 787ms
memory: 57860kb
input:
199995 1 2 2 3 2 4 1 5 3 6 5 7 6 8 4 9 2 10 5 11 5 12 1 13 1 14 1 15 13 16 1 17 10 18 16 19 11 20 8 21 17 22 4 23 19 24 7 25 22 26 8 27 14 28 1 29 9 30 3 31 3 32 21 33 19 34 26 35 34 36 5 37 29 38 22 39 5 40 13 41 28 42 8 43 35 44 22 45 14 46 12 47 32 48 11 49 8 50 18 51 23 52 18 53 4 54 6 55 10 56 ...
output:
757 69428 2793 181264 91707 182 32496 199183 6399 15975 11640 119051 236 689 15 9532 41 36592 178936 56 45424 193403 90248 3417 949 68 34133 60471 199861 188090 75088 127 1 6 4 3 3 11 61157 199860 199153 155706 196287 192862 53742 51862 179199 428 196282 199989 3613 26 99007 134461 198159 20382 7518...
result:
ok 199996 numbers
Test #10:
score: 0
Accepted
time: 363ms
memory: 56660kb
input:
199993 1 2 1 3 2 4 2 5 3 6 3 7 4 8 4 9 5 10 5 11 6 12 6 13 7 14 7 15 8 16 8 17 9 18 9 19 10 20 10 21 11 22 11 23 12 24 12 25 13 26 13 27 14 28 14 29 15 30 15 31 16 32 16 33 17 34 17 35 18 36 18 37 19 38 19 39 20 40 20 41 21 42 21 43 22 44 22 45 23 46 23 47 24 48 24 49 25 50 25 51 26 52 26 53 27 54 2...
output:
22 31743 62 30 510 6079 94 24063 190 4079 382 30 62 12159 1022 2043 8063 62 4 3063 4079 30 254 46 10 22 6111 12159 16127 22 1 12031 1 94 382 766 4063 254 46 766 1022 62 766 1 22 46 30 8063 8063 254 3063 22 62 30 1 62 254 4 10 15871 1022 46 2039 6079 22 254 1022 16127 30 766 8127 14 14 10 46 1 62 406...
result:
ok 199995 numbers
Test #11:
score: 0
Accepted
time: 1286ms
memory: 79888kb
input:
199993 25163 125238 125238 19096 19096 88864 88864 113505 113505 12722 12722 56225 56225 8736 8736 74926 74926 38529 38529 80231 80231 19719 19719 198784 198784 75213 75213 190174 190174 163340 163340 62363 62363 144160 144160 130912 130912 3919 3919 21218 21218 85281 85281 187312 187312 79930 79930...
output:
97095 57496 116181 132482 144412 69917 174677 96334 37980 80902 148979 22074 166530 153392 43419 163281 148526 62703 79363 199993 153733 152298 5085 156125 117973 61925 36346 95741 124148 102890 20093 5408 77598 176994 177809 169850 144418 43786 189237 69098 5167 199993 103575 105198 197612 38829 20...
result:
ok 199994 numbers
Test #12:
score: 0
Accepted
time: 1069ms
memory: 116768kb
input:
200000 3219 118490 118490 61372 61372 74390 74390 88375 88375 63918 63918 37580 37580 33219 33219 170480 170480 81737 81737 153202 153202 93921 93921 149109 149109 88339 88339 167037 167037 67099 67099 58363 58363 6784 6784 109386 109386 11895 11895 14872 14872 65638 65638 43958 43958 181669 181669 ...
output:
59633 108235 72863 144596 90365 57521 48069 163045 124462 18633 39115 111210 59413 80420 86945 182373 99188 57011 148702 53778 132289 68037 69705 50797 91155 77852 27499 106082 87174 122445 78221 71755 10125 93101 163451 16175 104215 50130 81182 30091 44299 81429 91045 111890 73099 72278 74017 59177...
result:
ok 199992 numbers
Test #13:
score: 0
Accepted
time: 504ms
memory: 72248kb
input:
199992 1 2 1 3 2 4 2 5 4 6 1 7 5 8 5 9 3 10 6 11 4 12 4 13 6 14 5 15 9 16 11 17 17 18 13 19 18 20 14 21 18 22 17 23 21 24 19 25 25 26 25 27 27 28 21 29 20 30 29 31 23 32 31 33 33 34 34 35 28 36 33 37 28 38 38 39 30 40 33 41 33 42 38 43 41 44 44 45 44 46 41 47 45 48 41 49 47 50 49 51 42 52 50 53 44 5...
output:
40732 40074 40815 13444 89657 22422 23494 61358 102922 66209 62228 32272 77095 68562 27799 74336 45129 71632 68525 13022 71347 63735 92178 64200 90446 50728 83632 61441 43695 10496 35481 81587 75266 77943 56182 14188 46302 108160 84166 3192 52959 522 57676 28165 97982 15371 95012 3437 53633 49240 55...
result:
ok 199998 numbers
Test #14:
score: 0
Accepted
time: 386ms
memory: 91700kb
input:
199990 1 2 1 3 4 2 5 2 6 4 7 4 8 6 9 6 10 8 11 8 12 10 13 10 14 12 15 12 16 14 17 14 18 16 19 16 20 18 21 18 22 20 23 20 24 22 25 22 26 24 27 24 28 26 29 26 30 28 31 28 32 30 33 30 34 32 35 32 36 34 37 34 38 36 39 36 40 38 41 38 42 40 43 40 44 42 45 42 46 44 47 44 48 46 49 46 50 48 51 48 52 50 53 50...
output:
59224 71441 128293 104009 42824 136779 12532 93560 81095 108628 176617 63487 103752 175849 36193 178489 73311 34313 46423 75989 76344 145231 20076 127399 81148 17356 39455 99025 44904 3548 78503 135455 28 136931 58140 53161 33288 134084 67877 26048 51868 74301 139992 165315 126781 136117 28112 86333...
result:
ok 199996 numbers
Test #15:
score: 0
Accepted
time: 299ms
memory: 63516kb
input:
199997 1 2 2 3 3 4 4 5 5 6 6 7 7 8 8 9 9 10 10 11 11 12 12 13 13 14 14 15 15 16 16 17 17 18 18 19 19 20 20 21 21 22 22 23 23 24 24 25 25 26 26 27 27 28 28 29 29 30 30 31 31 32 32 33 33 34 34 35 35 36 36 37 37 38 38 39 39 40 40 41 41 42 42 43 43 44 44 45 45 46 46 47 47 48 48 49 49 50 50 51 51 52 52 5...
output:
65710 203 400 304 388 328 441 19 417 49 311 329 193 71968 895 179 152645 282 7600 185 150933 150045 444 3693 56770 34420 8765 335 73751 4665 3 203 380 44479 392 356 113 373 46663 143312 234 265 386 378 339 184360 404 21904 9861 393 445 441 91 299 9 213 24586 65263 22235 121 35761 169 36121 435 40035...
result:
ok 199995 numbers
Test #16:
score: 0
Accepted
time: 1118ms
memory: 59020kb
input:
199997 1 64008 2 4187 3 154904 4 191579 5 107782 6 29053 7 123085 8 191601 9 95335 10 164039 11 171804 12 145532 13 104884 14 19820 15 74055 16 14172 17 98802 18 144668 19 188276 20 173096 21 62815 22 133749 23 65035 24 161785 25 191028 26 84730 27 176488 28 173295 29 110316 30 121532 31 81037 32 81...
output:
135622 123942 47301 113894 93180 10469 9237 13166 2896 20323 182669 26483 168662 47202 7900 7785 129591 1577 17943 5638 16670 16980 32760 153668 394 142656 30298 1801 167880 25099 10860 39103 28660 158337 55 126816 57661 17387 11147 95051 3 13130 28040 163801 141 109445 110915 13173 56634 20527 6325...
result:
ok 199993 numbers
Subtask #3:
score: 0
Wrong Answer
Dependency #2:
100%
Accepted
Test #17:
score: 0
Wrong Answer
time: 948ms
memory: 66820kb
input:
199996 1 2 2 3 3 4 1 5 1 6 4 7 1 8 5 9 4 10 4 11 7 12 11 13 7 14 10 15 2 16 1 17 9 18 10 19 9 20 13 21 8 22 14 23 21 24 8 25 20 26 23 27 17 28 6 29 9 30 9 31 14 32 14 33 6 34 7 35 35 36 31 37 37 38 2 39 12 40 16 41 18 42 3 43 27 44 4 45 7 46 24 47 16 48 44 49 10 50 11 51 9 52 16 53 39 54 30 55 4 56 ...
output:
190330 676 6 462 40 5 180041 3 9236 4 7780 72 19848 100092 66812 28617 39645 66797 22 12 957 2542 7 68308 382 96 217 50 44 227 12909 1519 54616 1682 27 124101 45 12279 173381 10 33 21516 147537 59 40 5332 183402 67257 4281 7 172420 498 154897 113480 208 174 1 497 172594 1098 788 13628 39540 3716 748...
result:
wrong answer 108th numbers differ - expected: '1555', found: '1559'
Subtask #4:
score: 0
Wrong Answer
Test #25:
score: 0
Wrong Answer
time: 1117ms
memory: 98804kb
input:
199991 1 2 2 3 3 4 3 5 5 6 3 7 1 8 8 9 8 10 10 11 1 12 1 13 13 14 4 15 12 16 13 17 17 18 8 19 3 20 9 21 16 22 10 23 1 24 7 25 6 26 12 27 4 28 21 29 27 30 30 31 21 32 19 33 20 34 17 35 7 36 13 37 24 38 37 39 30 40 31 41 15 42 9 43 32 44 41 45 18 46 38 47 8 48 35 49 13 50 35 51 47 52 35 53 48 54 44 55...
output:
78 1963372 5135952 8555 13713491 755865 8260 9786401 75 30734 149 58 704 309062316 25 377199306 489 400076098 4516964 22399 9329872 572536 99 326633472 239993 481 401133 450976 5018334 290 293395005 719 142 54837618 2996 87451 17544284 147787607 2711 112257565 114478542 383963537 35969 660404 945118...
result:
wrong answer 2nd numbers differ - expected: '107329', found: '1963372'
Subtask #5:
score: 0
Skipped
Dependency #1:
0%
Subtask #6:
score: 0
Skipped
Dependency #1:
0%