結果

問題 No.2337 Equidistant
ユーザー eQeeQe
提出日時 2023-06-02 22:16:26
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 12,979 bytes
コンパイル時間 7,110 ms
コンパイル使用メモリ 319,004 KB
実行使用メモリ 79,052 KB
最終ジャッジ日時 2024-06-08 23:33:44
合計ジャッジ時間 18,694 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 WA -
testcase_02 AC 2 ms
5,376 KB
testcase_03 WA -
testcase_04 WA -
testcase_05 AC 2 ms
5,376 KB
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 AC 596 ms
73,496 KB
testcase_22 AC 482 ms
78,224 KB
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define all(a) begin(a),end(a)
#define fin(...) rr vo(pp(__VA_ARGS__))
#define ep(...) emplace(__VA_ARGS__)
#define eb(...) emplace_back(__VA_ARGS__)
#define ef(...) else if(__VA_ARGS__)
#define wh(...) while(__VA_ARGS__)
#define lb(...) lower_bound(__VA_ARGS__)
#define ub(...) upper_bound(__VA_ARGS__)
#define ov4(a,b,c,d,e,...) e
#define ov5(a,b,c,d,e,f,...) f
#define fo1(b) for(ll ii=0,bb=(ll)(b);ii<bb;++ii)
#define fo2(i,b) for(ll i=0,bb=(ll)(b);i<bb;++i)
#define fo3(i,a,b) for(ll i=(ll)(a),bb=(ll)(b);i<bb;++i)
#define fo4(i,a,b,c) for(ll i=(ll)(a),bb=(ll)(b),cc=(ll)(c);i<bb;i+=cc)
#define fo(...) ov4(__VA_ARGS__,fo4,fo3,fo2,fo1)(__VA_ARGS__)
#define of2(i,a) for(ll i=(ll)(a)-1;i>=0;--i)
#define of3(i,a,b) for(ll i=(ll)(a)-1,bb=(ll)(b);i>=bb;--i)
#define of4(i,a,b,c) for(ll i=(ll)(a)-1,bb=(ll)(b),cc=(ll)(c);i>=bb;i-=cc)
#define of(...) ov4(__VA_ARGS__,of4,of3,of2)(__VA_ARGS__)
#define fe2(a,v) for(au&&a:v)
#define fe3(a,b,v) for(au&&[a,b]:v)
#define fe4(a,b,c,v) for(au&&[a,b,c]:v)
#define fe(...) ov4(__VA_ARGS__,fe4,fe3,fe2)(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;li(__VA_ARGS__)
#define DD(...) dd __VA_ARGS__;li(__VA_ARGS__)
#define ST(...) str __VA_ARGS__;li(__VA_ARGS__)
#define SS(n,a) strs a(n);li(a)
#define U2(h,w,a) u2 a(h,w);li(a)
#define UL2(n,a) u1 a(n);li(a)
#define UL3(n,a,b) u1 a(n),b(n);li(a,b)
#define UL4(n,a,b,c) u1 a(n),b(n),c(n);li(a,b,c)
#define UL5(n,a,b,c,d) u1 a(n),b(n),c(n),d(n);li(a,b,c,d)
#define UL(...) ov5(__VA_ARGS__,UL5,UL4,UL3,UL2)(__VA_ARGS__)
#define UV3(n,a,b) u1 a(n),b(n);vi(a,b)
#define UV4(n,a,b,c) u1 a(n),b(n),c(n);vi(a,b,c)
#define UV5(n,a,b,c,d) u1 a(n),b(n),c(n),d(n);vi(a,b,c,d)
#define UV(...) ov5(__VA_ARGS__,UV5,UV4,UV3)(__VA_ARGS__)
#define I template
#define J typename
#define O operator
#define rr return
#define uu using
#define au auto
#define cs const
namespace atcoder{}namespace my{void main();void solve();}int main(){my::main();}
namespace my{uu namespace std;uu namespace atcoder;
uu is=istream;uu os=ostream;uu vo=void;uu bo=bool;uu dd=long double;uu u8=uint8_t;
uu ll=long long;uu i64=ll;uu i128=__int128_t;uu ul=unsigned long long;uu u64=ul;uu u128=__uint128_t;
uu ml=modint998244353;is&O>>(is&i,ml&x){ll t;i>>t;x=t;rr i;}os&O<<(os&o,cs ml&x){rr o<<x.val();}
I<J T>uu v1=vector<T>;
I<J T>struct v2:v1<v1<T>>{uu v1<v1<T>>::v1;v2(ll a,ll b,T x={}){this->resize(a,v1<T>(b,x));}};
I<J T>struct v3:v1<v2<T>>{uu v1<v2<T>>::v1;v3(ll a,ll b,ll c,T x={}){this->resize(a,v2<T>(b,c,x));}};
I<J T>struct v4:v1<v3<T>>{uu v1<v3<T>>::v1;v4(ll a,ll b,ll c,ll d,T x={}){this->resize(a,v3<T>(b,c,d,x));}};
I<J T>struct v5:v1<v4<T>>{uu v1<v4<T>>::v1;v5(ll a,ll b,ll c,ll d,ll e,T x={}){this->resize(a,v4<T>(b,c,d,e,x));}};
uu u1=v1<ll>;uu u2=v2<ll>;uu u3=v3<ll>;uu u4=v4<ll>;uu m1=v1<ml>;uu m2=v2<ml>;uu m3=v3<ml>;uu m4=v4<ml>;uu m5=v5<ml>;
uu str=string;uu strs=v1<str>;str sp=" ",nc="",nl="\n";str Yes(bo y=1){rr y?"Yes":"No";}str No(){rr Yes(0);}

I<J A,J B=A>struct cp{
  A a;B b;cp():a(),b(){}cp(A a,B b):a(a),b(b){}cp(pair<A,B>p):a(p.first),b(p.second){}cp O-()cs{rr cp(-a,-b);}
  cp&O+=(cs cp&c){a+=c.a,b+=c.b;rr*this;}cp O+(cs cp&c)cs{rr cp{*this}+=c;}bo O==(cs cp&c)cs{rr a==c.a&&b==c.b;}
  cp&O-=(cs cp&c){a-=c.a,b-=c.b;rr*this;}cp O-(cs cp&c)cs{rr cp{*this}-=c;}bo O!=(cs cp&c)cs{rr a!=c.a||b!=c.b;}
  bo O<(cs cp&c)cs{rr a!=c.a?a<c.a:b<c.b;}bo O>=(cs cp&c)cs{rr!(*this<c);}friend is&O>>(is&i,cp&c){rr i>>c.a>>c.b;}
  bo O>(cs cp&c)cs{rr a!=c.a?a>c.a:b>c.b;}bo O<=(cs cp&c)cs{rr!(*this>c);}friend os&O<<(os&o,cs cp&c){rr o<<c.a<<sp<<c.b;}
};uu cl=cp<ll>;uu cls=v1<cl>;
I<J A,J B=A,J C=A>struct tr{
  A a;B b;C c;tr():a(),b(),c(){}tr(A a,B b,C c):a(a),b(b),c(c){}bo O==(cs tr&t)cs{rr a==t.a&&b==t.b&&c==t.c;}
  bo O<(cs tr&t)cs{rr a!=t.a?a<t.a:b!=t.b?b<t.b:c<t.c;}friend is&O>>(is&i,tr&t){rr i>>t.a>>t.b>>t.c;}
  bo O>(cs tr&t)cs{rr a!=t.a?a>t.a:b!=t.b?b>t.b:c>t.c;}friend os&O<<(os&o,cs tr&t){rr o<<t.a<<sp<<t.b<<sp<<t.c;}
};uu tl=tr<ll>;uu tls=v1<tl>;
I<J T>struct set:std::set<T>{set(){}set(cs v1<T>&a){fe(e,a)this->ep(e);}};
I<J T>struct uset:unordered_set<T>{uset(){}uset(cs v1<T>&a){fe(e,a)this->ep(e);}};
I<J T>struct mset:multiset<T>{mset(){}mset(cs v1<T>&a){fe(e,a)this->ep(e);}
  vo erase(cs T&x){if(this->count(x))multiset<T>::erase(this->find(x));}};
uu mp=map<ll,ll>;I<J T,J U>uu umap=unordered_map<T,U>;uu ump=umap<ll,ll>;uu sl=set<ll>;uu usl=uset<ll>;uu msl=mset<ll>;
I<J T>uu qmax=priority_queue<T>;I<J T>uu qmin=priority_queue<T,v1<T>,greater<T>>;uu dl=deque<ll>;I<J T>uu fn=function<T>;
ll oo=3e18;dd ee=1e-12,pi=acosl(-1);u1 dx{-1,0,1,0,-1,1,1,-1},dy{0,-1,0,1,-1,-1,1,1};
ul rnd(){static ul x=98,y=67,z=12,w=81;ul t=(x^(x<<11));x=y,y=z,z=w;rr(w=(w^(w>>19))^(t^(t>>8)));}
ll rnd_rng(ll r){rr rnd()%r;}ll rnd_rng(ll l,ll r){rr rnd()%(r-l)+l;}

bo odd(ll x){rr x&1;}bo eve(ll x){rr~x&1;}ll pm1(ll x){rr 1-2*(x&1);}ll pw2(ll n){rr 1LL<<n;}
ll rng1(ll l,ll r){rr pw2(r)-pw2(l);}ll rngbit(ll x,ll l,ll r){rr rng1(l,r)&x;}//[l,r)
ll ppc(ll x,ll l=0,ll r=63){rr __builtin_popcountll(rngbit(x,l,r));}
ll sqr(ll x){if(x<=1)rr x;ll r=sqrtl(x)-1;wh(r+1<=x/(r+1))++r;rr r;}I<J T>T sq(cs T&a){rr a*a;}
ll cbr(ll x){if(x<=1)rr x;ll r=cbrtl(x)-1;wh(r+1<=x/(r+1)/(r+1))++r;rr r;}I<J T>T cb(cs T&a){rr a*a*a;}
ll msb(ll x){rr x?63-__builtin_clzll(x):-1;}ll lsb(ll x){rr x?__builtin_ctzll(x):-1;}
ll l2(u128 x){x|=1;ll r=0;wh(x)x>>=1,++r;rr r;}ll l10(u128 x){x|=1;ll r=0;wh(x)x/=10,++r;rr r;}
u1 io(ll n,ll x=0){u1 a(n);fo(i,n)a[i]=i+x;rr a;}bo in(ll l,ll m,ll r){rr l<=m&&m<r;}
I<J T>ll len(cs T&a){rr a.size();}I<J T>bo mu(cs T&a){rr !len(a);}
I<J T>bo at(T S,ll i){rr S>>i&1;}I<J T>T at(cs v1<T>&v,ll i){ll n=len(v);rr v[(i%n+n)%n];}
I<J T>T flo(T x,T y){rr(y<0?flo(-x,-y):(x>=0?x/y:(x+1)/y-1));}I<J T>ll sgn(cs T&a){rr(a>ee)-(a<-ee);}
I<J T>T cei(T x,T y){rr(y<0?cei(-x,-y):(x<=0?x/y:(x-1)/y+1));}I<J T,J U>ll sgn(cs T&a,cs U&b){rr sgn(a-b);}
I<J T>T rect(cs v1<T>&s,ll l,ll r){assert(0<=l&&l<=r&&r<=len(s));T t{};if(r)t+=s[r-1];if(l)t-=s[l-1];rr t;}

I<J T>au&srt(v1<T>&a){sort(all(a));rr a;}I<J T>au&rv(v1<T>&a){reverse(all(a));rr a;}
I<J T>au&rsr(v1<T>&a){srt(a),rv(a);rr a;}I<J T>au&uq(v1<T>&a){srt(a),a.erase(unique(all(a)),end(a));rr a;}
I<J T>au slice(cs v1<T>&a,ll l,ll r){rr v1<T>(begin(a)+l,begin(a)+r);}
I<J T>decltype(au)bg(T&a){rr*begin(a);}I<J T,J U=T>vo af(v1<T>&v,U e=U{}){v.ep(begin(v),e);}
I<J T>decltype(au)rb(T&a){rr*rbegin(a);}I<J T>vo df(v1<T>&v){v.erase(begin(v));}
I<J T>T pop(v1<T>&v){T r=rb(v);v.pop_back();rr r;}
I<J T>T pop(qmax<T>&q){T r=q.top();q.pop();rr r;}I<J T>T pof(deque<T>&q){T r=bg(q);q.pop_front();rr r;}
I<J T>T pop(qmin<T>&q){T r=q.top();q.pop();rr r;}I<J T>T pob(deque<T>&q){T r=rb(q);q.pop_back();rr r;}
I<J T>au&O++(v1<T>&v,int){fe(e,v)++e;rr v;}I<J T>au&O--(v1<T>&v,int){fe(e,v)--e;rr v;}
I<J T>au&O^=(v1<T>&v,cs v1<T>u){copy(all(u),back_inserter(v));rr v;}I<J T>au O^(v1<T>v,cs v1<T>&u){rr v^=u;}
I<J T,J U>bo amax(T&a,cs U&b){rr a<b?a=b,1:0;}I<J...T>au max(T...a){rr max(initializer_list<common_type_t<T...>>{a...});}
I<J T,J U>bo amin(T&a,cs U&b){rr a>b?a=b,1:0;}I<J...T>au min(T...a){rr min(initializer_list<common_type_t<T...>>{a...});}
I<J T>T max(cs v1<T>&a){rr*max_element(all(a));}I<J T>au max(cs v2<T>&a){T r=bg(bg(a));fe(v,a)amax(r,max(v));rr r;}
I<J T>T min(cs v1<T>&a){rr*min_element(all(a));}I<J T>au min(cs v2<T>&a){T r=bg(bg(a));fe(v,a)amin(r,min(v));rr r;}
I<J T,J U>ll lbs(cs v1<T>&a,cs U&b){rr lb(all(a),b)-begin(a);}I<J T>T sum(cs v1<T>&a){rr accumulate(all(a),T{});}
I<J T,J U>ll ubs(cs v1<T>&a,cs U&b){rr ub(all(a),b)-begin(a);}I<J T>T sum(cs v2<T>&a){T r{};fe(e,a)r+=sum(e);rr r;}

struct fio{fio(){cin.tie(0);ios::sync_with_stdio(0);cout<<fixed<<setprecision(12);}}fio;
os&O<<(os&o,cs i128&x){if(x<0)rr o<<"-"<<-x;if(x<10)rr o<<(char)(x+'0');rr o<<x/10<<(char)(x%10+'0');}
os&O<<(os&o,cs u128&x){if(x<10)rr o<<(char)(x+'0');rr o<<x/10<<(char)(x%10+'0');}
I<J T,J U>os&O<<(os&o,cs pair<T,U>&p){rr o<<p.first<<sp<<p.second;}
I<J T>os&O<<(os&o,qmax<T>q){wh(len(q))o<<pop(q)<<sp;rr o;}I<J T>os&O<<(os&o,cs set<T>&v){fe(e,v)o<<e<<(&e==&rb(v)?nc:sp);rr o;}
I<J T>os&O<<(os&o,qmin<T>q){wh(len(q))o<<pop(q)<<sp;rr o;}I<J T>os&O<<(os&o,cs mset<T>&v){fe(e,v)o<<e<<(&e==&rb(v)?nc:sp);rr o;}
I<J T>os&O<<(os&o,cs v1<T>&v){fe(e,v)o<<e<<(&e==&rb(v)?nc:sp);rr o;}I<J T,J U>os&O<<(os&o,cs map<T,U>&m){fe(p,m)o<<p<<nl;rr o;}
I<J T>os&O<<(os&o,cs v2<T>&v){fe(e,v)o<<e<<(&e==&rb(v)?nc:nl);rr o;}
I<J T>is&O>>(is&i,v1<T>&v){fe(e,v)i>>e;rr i;}I<J...T>ll li(T&...a){(cin>>...>>a);rr 0;}
I<J...T>vo vi(ll i,T&...a){(cin>>...>>a[i]);}I<J T,J...A>vo vi(v1<T>&a,A&...b){fo(i,len(a))vi(i,a,b...);}
ll pp(){cout<<nl;rr 0;}I<J T,J...A>ll pp(cs T&a,cs A&...b){cout<<a;((cout<<sp<<b),...);rr pp();}

struct edg{ll t,w;edg(){}edg(ll t,ll w=1):t(t),w(w){}};uu graph=v2<edg>;
u2 tou(cs graph&g){ll n=len(g);u2 a(n);fo(u,n)fe(v,w,g[u])a[u].eb(v);rr a;}
graph tog(cs u2&a){ll n=len(a);graph g(n);fo(u,n)fe(v,a[u])g[u].eb(v);rr g;}
au mgi(u2&g,ll m){UV(m,a,b);a--,b--;fo(i,m)g[a[i]].eb(b[i]),g[b[i]].eb(a[i]);rr tuple(a,b);}
au ygi(u2&g,ll m){UV(m,a,b);a--,b--;fo(i,m)g[a[i]].eb(b[i]);rr tuple(a,b);}au ti(u2&g){rr mgi(g,len(g)-1);}

u1 en(cs str&s,cs str&b="a"){ll n=len(s);u1 r(n,-1);fo(i,n)if(len(b)==1)r[i]=s[i]-b[0];else fo(j,len(b))if(s[i]==b[j])r[i]=j;rr r;}
au de(cs u1&a,cs str&b){ll n=len(a);str r(n,'$');fo(i,n)if(len(b)==1)r[i]=a[i]+b[0];else fo(j,len(b))if(a[i]==j)r[i]=b[j];rr r;}
u2 en(cs strs&s,cs str&b="a"){u2 r;fe(e,s)r.eb(en(e,b));rr r;}
au de(cs u2&a,cs str&b){ll n=len(a);strs r(n);fo(i,n)r[i]=de(a[i],b);rr r;}
str ins(){str s;li(s);rr s;}strs inss(ll n){strs s(n);li(s);rr s;}u1 abc(){rr en(ins());}u2 abcs(ll n){rr en(inss(n));}

I<J F>struct rec:F{rec(F&&f):F(forward<F>(f)){}I<J...T>decltype(au)O()(T&&...a)cs{rr F::O()(*this,std::forward<T>(a)...);}};
I<J...A>u1 zp(A&...a){u1 v;fe(e,{a...})v^=e;uq(v);(vo)initializer_list<u1>{(vo([&](u1&a){fe(e,a)e=lbs(v,e);}(a)),u1())...};rr v;}
I<J F,J...A>u1 vs(cs F&f,A&...a){ll n;fe(e,{a...})n=len(e);u1 o=io(n);sort(all(o),f);
  (vo)initializer_list<u1>{(vo([&](u1&a){u1 c=a;fo(i,n)a[i]=c[o[i]];}(a)),u1())...};rr o;}
ll bsl(cs fn<bo(ll)>&j,ll o,ll n){wh(abs(o-n)>1)(j((o+n)/2)?o:n)=(o+n)/2;rr o;}
dd bsd(cs fn<bo(dd)>&j,dd o,dd n){fo(l2(abs(o-n)/ee))(j((o+n)/2)?o:n)=(o+n)/2;rr o;}
I<J T>au zt(v1<T>a){fo(i,1,len(a))a[i]+=a[i-1];rr a;}
au rle(cs u1&a){cls r;fe(e,a)len(r)&&e==rb(r).a?++rb(r).b,0:(r.eb(e,1),0);rr r;}
au rce(cs u1&a){cls r;ump m;fe(e,a)++m[e];fe(k,v,m)r.eb(k,v);rr srt(r);}
u1 divs(ll n){u1 r;for(ll i=1;i*i<=n;i++)if(n%i==0)r.eb(i),r.eb(n/i);rr uq(r);}
mp fact(ll n){ump m;for(ll i=2;i*i<=n;i++)wh(n%i==0)++m[i],n/=i;if(n>1)++m[n];rr mp(all(m));}
i128 inv(i128 a,i128 m){a=(a%m+m)%m;i128 b=m,u=1,v=0;wh(b)u-=a/b*v,swap(u,v),a-=a/b*b,swap(a,b);rr(u%m+m)%m;}
i128 pow(i128 x,i128 n,i128 m=0){if(n<0)n=-n,x=inv(x,m);i128 r=1;wh(n){if(n&1)r*=x;x*=x;if(m)r%=m,x%=m;n>>=1;}rr r;}

struct lca_doubling{
  graph g;
  ll n,L,r;
  u2 pa;
  u1 dep,dst;
  
  lca_doubling(cs u2&g,ll r=0):lca_doubling(tog(g),r){}
  lca_doubling(cs graph&g,ll r=0):g(g),n(len(g)),L(l2(n)),r(r),pa(l2(n),n),dep(n),dst(n){
    build();
  }
  
  vo build(){
    pa[0][r]=-1;
    dep[r]=dst[r]=0;
    deque<cl>q;
    q.eb(r,-1);
    wh(len(q)){
      au[u,p]=pof(q);
      fe(v,w,g[u])if(v!=p){
        pa[0][v]=u;
        dep[v]=dep[u]+1;
        dst[v]=dst[u]+w;
        q.eb(v,u);
      }
    }
    
    fo(k,L-1){
      fo(i,n){
        if(pa[k][i]==-1)pa[k+1][i]=-1;
        else pa[k+1][i]=pa[k][pa[k][i]];
      }
    }
  }
  
  ll par(ll u,ll k=1){//uのk個上の祖先
    if(dep[u]<k)rr-1;
    fo(i,L)if(at(k,i))u=pa[i][u];
    rr u;
  }
  
  inline ll O()(ll u,ll v){rr q(u,v);}
  ll q(ll u,ll v){//uとvのlca
    if(dep[u]<dep[v])swap(u,v);
    ll D=dep[u]-dep[v];
    u=par(u,D);
    if(u==v)rr u;
    
    //降順でないと失敗するケースあり
    of(i,L)if(pa[i][u]!=pa[i][v])u=pa[i][u],v=pa[i][v];
    rr par(u);
  };
  
  ll dist(ll u,ll v){rr dst[u]+dst[v]-dst[q(u,v)]*2;}
  
  u1 path(ll u,ll v){//u→vのパス上の頂点
    u1 pu,pv;
    ll p=q(u,v);
    wh(u!=p)pu.eb(u),u=par(u);pu.eb(u);
    wh(v!=p)pv.eb(v),v=par(v);rv(pv);
    pu^=pv;
    rr pu;
  }
};

tuple<u1,u1,u1>dfs_order(cs u2&g,ll s=0){
  ll n=len(g);
  u1 ord,dep(n),par(n);
  tls st{{s,-1,0}};
  wh(len(st)){
    au[u,p,d]=pop(st);
    ord.eb(u),dep[u]=d,par[u]=p;
    fe(v,g[u])if(v!=p)st.eb(v,u,d+1);
  }
  rr{ord,dep,par};
}

vo main(){ll T=1;fo(T)solve();}
vo solve(){
  LL(N,Q);
  u2 g(N);ti(g);
  
  lca_doubling lca(g);
  
  au[ord,dep,par]=dfs_order(g);
  
  rv(ord);
  u1 sz(N);
  fe(u,ord){
    sz[u]=1;
    fe(v,g[u])if(v!=par[u])sz[u]+=sz[v];
  }
  
  fo(Q){
    LL(u,v);u--,v--;
    ll d=lca.dist(u,v);
    if(d&1){
      pp(0);
      continue;
    }
    
    if(dep[u]>dep[v])swap(u,v);
    
    ll m=lca.par(v,d/2);
    
    ll res=0;
    if(dep[m]<dep[u]){//mが1番浅い
      res=sz[m];
      res-=sz[lca.par(u,d/2-1)];
      res-=sz[lca.par(v,d/2-1)];
    }else{
      res=sz[m];
      res-=sz[lca.par(v,d/2-1)];
    }
    pp(res);
  }
}}
0