結果
問題 | No.1098 LCAs |
ユーザー |
![]() |
提出日時 | 2020-06-26 21:41:42 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 53 ms / 2,000 ms |
コード長 | 4,618 bytes |
コンパイル時間 | 2,398 ms |
コンパイル使用メモリ | 213,272 KB |
最終ジャッジ日時 | 2025-01-11 11:06:56 |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 28 |
ソースコード
#pragma GCC optimize ("Ofast")#include<bits/stdc++.h>using namespace std;void *wmem;char memarr[96000000];template<class T> inline void walloc1d(T **arr, int x, void **mem = &wmem){static int skip[16] = {0, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1};(*mem) = (void*)( ((char*)(*mem)) + skip[((unsigned long long)(*mem)) & 15] );(*arr)=(T*)(*mem);(*mem)=((*arr)+x);}inline int my_getchar_unlocked(){static char buf[1048576];static int s = 1048576;static int e = 1048576;if(s == e && e == 1048576){e = fread_unlocked(buf, 1, 1048576, stdin);s = 0;}if(s == e){return EOF;}return buf[s++];}inline void rd(int &x){int k;int m=0;x=0;for(;;){k = my_getchar_unlocked();if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){x=k-'0';break;}}for(;;){k = my_getchar_unlocked();if(k<'0'||k>'9'){break;}x=x*10+k-'0';}if(m){x=-x;}}struct MY_WRITER{char buf[1048576];int s;int e;MY_WRITER(){s = 0;e = 1048576;}~MY_WRITER(){if(s){fwrite_unlocked(buf, 1, s, stdout);}}};MY_WRITER MY_WRITER_VAR;void my_putchar_unlocked(int a){if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);MY_WRITER_VAR.s = 0;}MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;}inline void wt_L(char a){my_putchar_unlocked(a);}inline void wt_L(long long x){int s=0;int m=0;char f[20];if(x<0){m=1;x=-x;}while(x){f[s++]=x%10;x/=10;}if(!s){f[s++]=0;}if(m){my_putchar_unlocked('-');}while(s--){my_putchar_unlocked(f[s]+'0');}}struct graph{int N;int *es;int **edge;void setEdge(int N__, int M, int A[], int B[], void **mem = &wmem){int i;N = N__;walloc1d(&es, N, mem);walloc1d(&edge, N, mem);for(i=(0);i<(N);i++){es[i] = 0;}for(i=(0);i<(M);i++){es[A[i]]++;es[B[i]]++;}for(i=(0);i<(N);i++){walloc1d(&edge[i], es[i], mem);}for(i=(0);i<(N);i++){es[i] = 0;}for(i=(0);i<(M);i++){edge[A[i]][es[A[i]]++] = B[i];edge[B[i]][es[B[i]]++] = A[i];}}void getDist(int root, int res[], void *mem = wmem){int i;int j;int k;int*q;int s;int z;walloc1d(&q, N, &mem);for(i=(0);i<(N);i++){res[i]=-1;}res[root]=0;s=0;z=1;q[0]=root;while(z){i=q[s++];z--;for(j=(0);j<(es[i]);j++){k=edge[i][j];if(res[k]>=0){continue;}res[k]=res[i]+1;q[s+z++]=k;}}}void SubTreeSize(int root, int res[], void *mem = wmem){int i;int j;int k;int m;int *q;int qs = 0;int qe = 1;walloc1d(&q,N,&mem);for(i=(0);i<(N);i++){res[i] = -1;}res[root] = 0;q[0] = root;while(qs < qe){i = q[qs++];for(j=(0);j<(es[i]);j++){k = edge[i][j];if(res[k]==0){continue;}res[k] = 0;q[qe++] = k;}}for(m=(N)-1;m>=(0);m--){i = q[m];res[i] = 1;for(j=(0);j<(es[i]);j++){k = edge[i][j];res[i] += res[k];}}}};int N;int A[200000];int B[200000];graph g;int sz[200000];int dis[200000];long long res[200000];int main(){int i;wmem = memarr;rd(N);{int Lj4PdHRW;for(Lj4PdHRW=(0);Lj4PdHRW<(N-1);Lj4PdHRW++){rd(A[Lj4PdHRW]);A[Lj4PdHRW] += (-1);rd(B[Lj4PdHRW]);B[Lj4PdHRW] += (-1);}}g.setEdge(N,N-1,A,B);g.getDist(0, dis);g.SubTreeSize(0, sz);for(i=(0);i<(N);i++){int RZTsC2BF;res[i] = (long long) sz[i] * sz[i];for(RZTsC2BF=(0);RZTsC2BF<(g.es[i]);RZTsC2BF++){auto &j = g.edge[i][RZTsC2BF];if(dis[j] < dis[i]){continue;}res[i] -= (long long) sz[j] * sz[j];}}{int WYIGIcGE;for(WYIGIcGE=(0);WYIGIcGE<(N);WYIGIcGE++){wt_L(res[WYIGIcGE]);wt_L('\n');}}return 0;}// cLay varsion 20200509-1// --- original code ---// int N, A[2d5], B[2d5];// graph g;// int sz[2d5], dis[2d5];// ll res[2d5];// {// rd(N,(A--,B--)(N-1));// g.setEdge(N,N-1,A,B);// g.getDist(0, dis);// g.SubTreeSize(0, sz);// rep(i,N){// res[i] = (ll) sz[i] * sz[i];// rep[g.edge[i]](j,g.es[i]){// if(dis[j] < dis[i]) continue;// res[i] -= (ll) sz[j] * sz[j];// }// }// wtLn(res(N));// }