#871305 (C++17) No.399 動的な領主

• 問題: No.399 動的な領主
• ユーザー: eQe
• 提出日時: 2023-05-22 21:05:37
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 380 ms / 2,000 ms
• コード長: 20,363 bytes
• コンパイル時間: 2,926 ms
• コンパイル使用メモリ: 188,472 KB
• 実行使用メモリ: 14,976 KB
• 最終ジャッジ日時: 2024-06-02 00:08:30
• 合計ジャッジ時間: 7,029 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,812 KB
testcase_01	AC	2 ms; 6,944 KB
testcase_02	AC	2 ms; 6,944 KB
testcase_03	AC	2 ms; 6,940 KB
testcase_04	AC	3 ms; 6,944 KB
testcase_05	AC	27 ms; 6,944 KB
testcase_06	AC	380 ms; 14,976 KB
testcase_07	AC	369 ms; 14,976 KB
testcase_08	AC	348 ms; 14,848 KB
testcase_09	AC	356 ms; 14,976 KB
testcase_10	AC	5 ms; 6,940 KB
testcase_11	AC	18 ms; 6,940 KB
testcase_12	AC	216 ms; 14,976 KB
testcase_13	AC	217 ms; 14,976 KB
testcase_14	AC	62 ms; 14,848 KB
testcase_15	AC	176 ms; 14,848 KB
testcase_16	AC	207 ms; 14,848 KB
testcase_17	AC	335 ms; 14,848 KB
testcase_18	AC	339 ms; 14,976 KB

ソースコード

//#include<atcoder/all>
//#include<bits/stdc++.h>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<bitset>
#include<cmath>
#include<queue>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<numeric>
#include<cassert>
#include<functional>

#define bgn(a) begin(a)
#define rbg(a) rbegin(a)
#define al(a) bgn(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 el else
#define wh(...) while(__VA_ARGS__)
#define lb(...) lower_bound(__VA_ARGS__)
#define ub(...) upper_bound(__VA_ARGS__)
#define srt(...) sort(al(__VA_ARGS__))
#define rv(...) reverse(al(__VA_ARGS__))
#define rsr(a) srt(a),rv(a)
#define uq(a) srt(a),a.erase(unique(al(a)),end(a))
#define ov4(a,b,c,d,e,...) e
#define ov5(a,b,c,d,e,f,...) f
#define fo1(b) for(ll ii=0;ii<(ll)(b);++ii)
#define fo2(i,b) for(ll i=0;i<(ll)(b);++i)
#define fo3(i,a,b) for(ll i=(ll)(a);i<(ll)(b);++i)
#define fo4(i,a,b,c) for(ll i=(ll)(a);i<(ll)(b);i+=(ll)(c))
#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;i>=(ll)(b);--i)
#define of4(i,a,b,c) for(ll i=(ll)(a)-1;i>=(ll)(b);i-=(ll)(c))
#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 fe5(a,b,c,d,v) for(au&&[a,b,c,d]:v)
#define fe(...) ov5(__VA_ARGS__,fe5,fe4,fe3,fe2)(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;li(__VA_ARGS__)
#define DD(...) dd __VA_ARGS__;li(__VA_ARGS__)
#define CH(...) char __VA_ARGS__;li(__VA_ARGS__)
#define ST(...) str __VA_ARGS__;li(__VA_ARGS__)
#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 U2(h,w,a) u2 a(h,w);li(a)
#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 ll=int64_t;uu ul=uint64_t;uu dd=long double;uu i128=__int128_t;uu u8=uint8_t;
//uu ml=modint998244353;
i128 inv(i128 a,i128 m);
i128 pow(i128 x,i128 n,i128 m);
I<ll m>struct modint{
  ll x;
  modint(ll x=0):x((x%m+m)%m){}
  ll val()const{rr x;}
  modint O-()const{rr modint(-x);}
  modint&O++(){x++;if(x==m)x=0;rr*this;}modint O++(int){modint r=*this;++*this;rr r;}
  modint&O--(){if(x==0)x=m;x--;rr*this;}modint O--(int){modint r=*this;--*this;rr r;}
  modint&O+=(const modint&a){if((x+=a.x)>=m)x-=m;rr*this;}
  modint&O-=(const modint&a){if((x+=m-a.x)>=m)x-=m;rr*this;}
  modint&O*=(const modint&a){(x*=a.x)%=m;rr*this;}
  modint&O/=(const modint&a){rr*this*=a.inv();}
  modint O+(const modint&a)const{rr modint(*this)+=a;}
  modint O-(const modint&a)const{rr modint(*this)-=a;}
  modint O*(const modint&a)const{rr modint(*this)*=a;}
  modint O/(const modint&a)const{rr modint(*this)/=a;}
  bool O==(const modint&a)const{rr val()==a.val();}bool O!=(const modint&a)const{rr !(*this==a);}
  modint pow(ll n)const{rr my::pow(x,n,m);}
  modint inv()const{rr my::inv(x,m);}
  static ll mod(){rr m;}
};
uu ml=modint<998244353>;
//uu ml=modint<1000000007>;
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=T{}){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=T{}){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=T{}){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=T{}){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(A{}),b(B{}){}cp(A a,B b):a(a),b(b){}cp(pair<A,B>p):a(p.first),b(p.second){}
  cp&O+=(cs cp&c){a+=c.a,b+=c.b;rr*this;}cp O+(cs cp&c)cs{rr cp{*this}+=c;}
  cp&O-=(cs cp&c){a-=c.a,b-=c.b;rr*this;}cp O-(cs cp&c)cs{rr cp{*this}-=c;}cp O-()cs{rr cp(-a,-b);}
  I<J T>cp&O+=(cs T&x){a+=x,b+=x;rr*this;}I<J T>cp O+(cs T&x)cs{rr cp{*this}+=x;}
  I<J T>cp&O-=(cs T&x){a-=x;b-=x;rr*this;}I<J T>cp O-(cs T&x)cs{rr cp{*this}-=x;}
  I<J T>cp&O*=(cs T&x){a*=x;b*=x;rr*this;}I<J T>cp O*(cs T&x)cs{rr cp{*this}*=x;}
  au abs()cs{rr std::abs(a)+std::abs(b);}au abs(cs cp&c)cs{rr(*this-c).abs();}
  bo O==(cs cp&c)cs{rr a==c.a&&b==c.b;}bo O!=(cs cp&c)cs{rr!(*this==c);}
  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);}
  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;}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(A{}),b(B{}),c(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;}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;}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 A,J B=A,J C=A,J D=A>struct qu{
  A a;B b;C c;D d;qu():a(A{}),b(B{}),c(C{}),d(D{}){}qu(A a,B b,C c,D d):a(a),b(b),c(c),d(d){}
  bo O==(cs qu&q)cs{rr a==q.a&&b==q.b&&c==q.c&&d==q.d;}
  bo O<(cs qu&q)cs{rr a!=q.a?a<q.a:b!=q.b?b<q.b:c!=q.c?c<q.c:d<q.d;}
  bo O>(cs qu&q)cs{rr a!=q.a?a>q.a:b!=q.b?b>q.b:c!=q.c?c>q.c:d>q.d;}
  friend os&O<<(os&o,cs qu&q){rr o<<q.a<<sp<<q.b<<sp<<q.c<<sp<<q.d;}
};uu ql=qu<ll>;uu qls=v1<ql>;

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);}bo erase(cs T&x){bo c=this->count(x);if(c)multiset<T>::erase(this->find(x));rr c;}};
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};

bo odd(ll x){rr x&1;}bo eve(ll x){rr !odd(x);}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 l2(i128 x){if(x<0)rr 0;x|=1;ll r=0;wh(x)x>>=1,++r;rr r;}ll l10(i128 x){if(x<0)rr 0;x|=1;ll r=0;wh(x)x/=10,++r;rr r;}
ll msb(ll x){rr x?l2(x)-1:-1;}ll lsb(ll x){rr x?__builtin_ctzll(x):-1;}
u1 io(ll n,ll x=0){u1 a(n);fo(i,n)a[i]=i+x;rr a;}
I<J T,J U,J V>au sum(T a,U d,V n){rr n*(a*2+(n-1)*d)/2;}
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>ll sgn(cs T&a){rr(a>ee)-(a<-ee);}I<J T,J U>ll sgn(cs T&a,cs U&b){rr sgn(a-b);}
I<J T,J U>T cei(T x,U y){assert(y);rr(y<0?cei(-x,-y):(x>0?(x+y-1)/y:x/y));}
I<J T,J U>T flo(T x,U y){assert(y);rr(y<0?flo(-x,-y):(x>0?x/y:x/y-(x%y!=0)));}
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 slice(cs v1<T>&a,ll l,ll r){rr v1<T>(bgn(a)+l,bgn(a)+r);}
I<J T,J U=T>vo af(v1<T>&v,U e=U{}){v.ep(bgn(v),e);}I<J T>vo df(v1<T>&v){v.erase(bgn(v));}
I<J T>decltype(au)bg(T&a){rr*bgn(a);}I<J T>decltype(au)rb(T&a){rr*rbg(a);}
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 pop(qmin<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 pob(deque<T>&q){T r=rb(q);q.pop_back();rr r;}
I<J T>au&O^=(v1<T>&v,cs v1<T>u){copy(al(u),back_inserter(v));rr v;}I<J T>au O^(v1<T>v,cs v1<T>&u){rr v^=u;}
I<J T>au&O+=(v1<T>&v,cs v1<T>&u){fo(i,len(v))v[i]+=u[i];rr v;}I<J T>au O+(v1<T>v,cs v1<T>&u){rr v+=u;}
I<J T>au&O-=(v1<T>&v,cs v1<T>&u){fo(i,len(v))v[i]-=u[i];rr v;}I<J T>au O-(v1<T>v,cs v1<T>&u){rr v-=u;}
I<J T>au&O++(v1<T>&v){fe(e,v)++e;rr v;}I<J T>au O++(v1<T>&v,int){au r=v;++v;rr r;}
I<J T>au&O--(v1<T>&v){fe(e,v)--e;rr v;}I<J T>au O--(v1<T>&v,int){au r=v;--v;rr r;}I<J T>au O-(v1<T>v){fe(e,v)e*=-1;rr v;}
I<J T,J U>au&O+=(v1<T>&v,cs U a){fe(e,v)e+=a;rr v;}I<J T,J U>au O+(v1<T>v,cs U&a){rr v+=a;}
I<J T,J U>au&O-=(v1<T>&v,cs U a){fe(e,v)e-=a;rr v;}I<J T,J U>au O-(v1<T>v,cs U&a){rr v-=a;}
I<J T,J U>au&O*=(v1<T>&v,cs U a){fe(e,v)e*=a;rr v;}I<J T,J U>au O*(v1<T>v,cs U&a){rr v*=a;}
I<J T,J U>au&O/=(v1<T>&v,cs U a){fe(e,v)e/=a;rr v;}I<J T,J U>au O/(v1<T>v,cs U&a){rr v/=a;}
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(al(a));}I<J T>au max(cs v2<T>&a){rr max(*max_element(al(a)));}
I<J T>T min(cs v1<T>&a){rr*min_element(al(a));}I<J T>au min(cs v2<T>&a){rr min(*min_element(al(a)));}
I<J T>T sum(cs v1<T>&a){rr accumulate(al(a),T{});}I<J T>T sum(cs v2<T>&a){T r{};fe(e,a)r+=sum(e);rr r;}
I<J T,J U>ll lbs(cs v1<T>&a,cs U&b){rr lb(al(a),b)-bgn(a);}I<J T,J U>ll ubs(cs v1<T>&a,cs U&b){rr ub(al(a),b)-bgn(a);}

struct fio{fio(){cin.tie(0);ios::sync_with_stdio(0);cout<<fixed<<std::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');}
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,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,qmin<T>q){wh(len(q))o<<pop(q)<<sp;rr o;}I<J T,J U>os&O<<(os&o,cs umap<T,U>&m){fe(p,m)o<<p<<nl;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>is&O>>(is&i,v1<T>&v){fe(e,v)i>>e;rr i;}
I<J T>os&O<<(os&o,cs v2<T>&v){fe(e,v)o<<e<<(&e==&rb(v)?nc:nl);rr o;}
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();}
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...);}

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 mgi(graph&g,ll m){UV(m,a,b,c);--a,--b;fo(i,m)g[a[i]].eb(b[i],c[i]),g[b[i]].eb(a[i],c[i]);rr tuple(a,b,c);}
au ygi(graph&g,ll m){UV(m,a,b,c);--a,--b;fo(i,m)g[a[i]].eb(b[i],c[i]);rr tuple(a,b,c);}
au ti(u2&g){rr mgi(g,len(g)-1);}au ti(graph&g){rr mgi(g,len(g)-1);}

au de(cs u1&a,cs char&b='a'){str r{};fe(e,a)r+=e+b;rr r;}
au de(cs u2&a,cs char&b='a'){ll n=len(a);strs r(n);fo(i,n)r[i]=de(a[i],b);rr r;}
au de(cs u1&a,cs str&b){ll n=len(a);str r(n,'$');fo(i,n)fo(j,len(b))if(a[i]==j){r[i]=b[j];break;}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;}
u1 en(cs str&s,cs char&b='a'){u1 r;fe(c,s)r.eb(c-b);rr r;}
u2 en(cs strs&s,cs char&b='a'){u2 r;fe(e,s)r.eb(en(e,b));rr r;}
u1 en(cs str&s,cs str&b){ll n=len(s);u1 r(n,-1);fo(i,n)fo(j,len(b))if(s[i]==b[j]){r[i]=j;break;}rr r;}
u2 en(cs strs&s,cs str&b){u2 r;fe(e,s)r.eb(en(e,b));rr r;}
str ins(){str s;li(s);rr s;}strs ins2(ll n){strs s(n);li(s);rr s;}u1 abc(){rr en(ins());}u2 abcs(ll n){rr en(ins2(n));}

I<J F>struct rec:F{rec(F&&f):F(std::forward<F>(f)){}I<J...T>decltype(au)O()(T&&...a)cs{rr F::O()(*this,std::forward<T>(a)...);}};
I<J T,J...A>au tzp(A&...a){v1<T>v;fe(e,{a...})v^=e;uq(v);rr v;}
vo pz(cs u1&v,u1&h){fe(e,h)e=lbs(v,e);}I<J...T>vo pz(cs u1&v,u1&h,T&...t){pz(v,h);pz(v,t...);}
I<J...T>u1 zp(T&...a){u1 v=tzp<ll>(a...);pz(v,a...);rr v;}u1 zp(u2&a){u1 v;fe(e,a)v^=e;uq(v);fe(e,a)fe(x,e)x=lbs(v,x);rr v;}
I<J T>vo sv(cs u1&o,v1<T>&a){au c=a;fo(i,len(a))a[i]=c[o[i]];}I<J T,J...A>vo sv(cs u1&o,v1<T>&a,A&...b){sv(o,a);sv(o,b...);}
I<J T>u1 vs(cs fn<bo(ll,ll)>&f,v1<T>&a){u1 o=io(len(a));sort(al(o),f);sv(o,a);rr o;}
I<J T,J...A>u1 vs(cs fn<bo(ll,ll)>&f,v1<T>&a,A&...b){u1 o=io(len(a));sort(al(o),f);sv(o,a);sv(o,b...);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){wh(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;}I<J T>au zt(v2<T>a){fe(v,a)v=zt(v);fo(i,1,len(a))a[i]+=a[i-1];rr a;}
I<J T>au mb(v1<T>a){of(i,len(a),1)a[i]-=a[i-1];rr a;}I<J T>au mb(v2<T>a){fe(v,a)v=mb(v);of(i,len(a),1)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 uq(r),r;}
u1 divs(ll n){u1 r;fo(i,1,n/i+1)if(n%i==0)r.eb(i),r.eb(n/i);rr uq(r),r;}
mp fact(ll n){ump m;fo(i,2,n/i+1)wh(n%i==0)++m[i],n/=i;if(n>1)++m[n];rr mp(al(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){assert(n>=0);i128 r=1;wh(n){if(n&1)r*=x;x*=x,n>>=1;}rr r;}
i128 pow(i128 x,i128 n,i128 m){if(n<0)n=-n,x=inv(x,m);i128 r=1;wh(n){if(n&1)r*=x,r%=m;x*=x,x%=m,n>>=1;}rr r;}

I<J S>struct link_cut_node{
  ll ind;//頂点番号
  ll size;
  S val,acc;
  bo rev;
  link_cut_node *par,*left,*righ;
  link_cut_node(ll i,S x){
    ind=i;
    size=1;
    val=acc=x;
    rev=0;
    par=left=righ=nullptr;
  }
};

I<J S,J F>struct link_cut_lazy_node{
  ll ind;//頂点番号
  ll size;
  S val,acc;
  F lz;
  bo rev;
  link_cut_lazy_node *par,*left,*righ;
  link_cut_lazy_node(ll i,S x,F f=F()){
    ind=i;
    size=1;
    val=acc=x;
    lz=f;
    rev=0;
    par=left=righ=nullptr;
  }
};

I<J S,S op(S,S),S e(),vo reverse_prod(S&),J link_cut_node>struct link_cut_tree{
  uu node_ptr=link_cut_node*;
  
  v1<node_ptr>ptr;
  link_cut_tree(ll n=0):link_cut_tree(v1<S>(n)){}
  link_cut_tree(cs v1<S>&a){
    ptr.resize(len(a));
    fo(i,len(a))ptr[i]=create_node(i,a[i]);
  }
  
  decltype(au)O[](ll u){rr ptr[u];}
  
  virtual node_ptr create_node(ll i,cs S&x){
    rr new link_cut_node(i,x);
  }
  
  inline vo set(ll u,cs S&x){set(ptr[u],x);}
  vo set(cs node_ptr&me,cs S&x){
    access(me);
    me->val=x;
    update(me);
  }
  
  int state(cs node_ptr&me)cs{
    if(!me->par)rr 0;
    ef(me->par->left==me)rr-1;
    ef(me->par->righ==me)rr 1;
    rr 0;//パス上の根の場合ここに来る．
  }
  
  vo rotate(cs node_ptr&me)cs{
    node_ptr p=me->par,pp=p->par,c;
    if(state(me)<0)c=me->righ,me->righ=p,p->left=c;
    el             c=me->left,me->left=p,p->righ=c;
    
    if(pp&&pp->left==p)pp->left=me;
    if(pp&&pp->righ==p)pp->righ=me;
    me->par=pp;
    p->par=me;
    if(c)c->par=p;
  }
  
  node_ptr splay(cs node_ptr&me){
    push(me);
    wh(state(me)){
      node_ptr p=me->par,pp=p->par;
      if(pp)push(pp);
      push(p);
      push(me);
      
      if(state(p)==0)rotate(me);//zig
      ef(state(me)==state(p))rotate(p),rotate(me);//zig-zig
      el rotate(me),rotate(me);//zig-zag
      
      if(pp)update(pp);
      update(p);
      update(me);
    }
    rr update(me);
  }
  
  vo toggle(cs node_ptr&me){
    swap(me->left,me->righ);
    reverse_prod(me->acc);
    me->rev^=1;
  }
  
  virtual vo push(cs node_ptr&me){
    if(me->rev){
      if(me->left)toggle(me->left);
      if(me->righ)toggle(me->righ);
      me->rev=0;
    }
  }
  
  node_ptr update(cs node_ptr&me){
    me->size=1;
    me->acc=me->val;
    if(me->left){
      me->size+=me->left->size;
      me->acc=op(me->left->acc,me->acc);
    }
    if(me->righ){
      me->size+=me->righ->size;
      me->acc=op(me->acc,me->righ->acc);
    }
    rr me;
  }
  
  inline ll access(ll u){rr access(ptr[u])->ind;}
  node_ptr access(cs node_ptr&me){
    node_ptr pre=nullptr;
    for(node_ptr cu=me;cu;cu=cu->par){
      splay(cu);
      cu->righ=pre;
      pre=update(cu);
    }
    splay(me);
    rr pre;
  }
  
  inline vo link(ll u,ll v){link(ptr[u],ptr[v]);}
  vo link(cs node_ptr&me,cs node_ptr&you){
    evert(me);
    access(you);
    me->par=you;
  }
  
  inline vo cut(ll u,ll v){cut(ptr[u],ptr[v]);}
  vo cut(cs node_ptr&me,cs node_ptr&you){
    evert(me);
    access(you);
    assert(you->left==me);
    me->par=you->left=nullptr;
    update(you);
  }
  
  inline u1 path(ll u){rr path(ptr[u]);}
  u1 path(cs node_ptr&me){//me→元の木の根のパス
    access(me);
    u1 res;
    rec([&](au&&dfs,node_ptr cu)->vo{
      if(!cu)rr;
      dfs(cu->righ);
      res.eb(cu->ind);
      dfs(cu->left);
    })(me);
    rr res;
  }
  
  inline vo evert(ll u){rr evert(ptr[u]);}
  vo evert(cs node_ptr&me){//accessすることで根からmeのパスの反転だけで済む．
    access(me);
    toggle(me);
    push(me);
  }
  
  inline ll root(ll u){rr root(ptr[u])->ind;}
  node_ptr root(cs node_ptr&me){
    access(me);
    node_ptr cu=me;
    wh(cu->left)cu=cu->left;
    rr splay(cu);
  }
  
  ll lca(ll u,ll v){rr lca(ptr[u],ptr[v])->ind;}
  node_ptr lca(cs node_ptr&me,cs node_ptr&you){
    rr access(me),access(you);
  }
  
  bo same(ll u,ll v){rr same(ptr[u],ptr[v]);}
  bo same(cs node_ptr&me,cs node_ptr&you){
    rr root(me)==root(you);
  }
  
  inline S prod(ll u,ll v){rr prod(ptr[u],ptr[v]);}
  S prod(cs node_ptr&me,cs node_ptr&you){//me→youまでのパスの集約値
    evert(me);
    access(you);
    rr you->acc;
  }
};

I<J S,S op(S,S),S e(),vo reverse_prod(S&),J F,S mapping(F,S),F composition(F,F),F(*id)(),J link_cut_lazy_node>
struct link_cut_lazy_tree:link_cut_tree<S,op,e,reverse_prod,link_cut_lazy_node>{
  uu base=link_cut_tree<S,op,e,reverse_prod,link_cut_lazy_node>;
  uu node_ptr=link_cut_lazy_node*;
  
  link_cut_lazy_tree(ll n=0):link_cut_lazy_tree(v1<S>(n)){}
  link_cut_lazy_tree(cs v1<S>&a){
    base::ptr.resize(len(a));
    fo(i,len(a))base::ptr[i]=create_node(i,a[i]);
  }
  
  node_ptr create_node(ll i,cs S&x)override{
    rr new link_cut_lazy_node(i,x,id());
  }
  
  vo push(cs node_ptr&me)override{
    if(me->left){
      me->left->val=mapping(me->lz,me->left->val);
      me->left->acc=mapping(me->lz,me->left->acc);
      me->left->lz=composition(me->lz,me->left->lz);
    }
    if(me->righ){
      me->righ->val=mapping(me->lz,me->righ->val);
      me->righ->acc=mapping(me->lz,me->righ->acc);
      me->righ->lz=composition(me->lz,me->righ->lz);
    }
    if(me->rev){
      if(me->left)base::toggle(me->left);
      if(me->righ)base::toggle(me->righ);
      me->rev=0;
    }
    me->lz=id();
  }
  
  inline vo apply(ll u,ll v,F f){apply(base::ptr[u],base::ptr[v],f);}
  vo apply(cs node_ptr&me,cs node_ptr&you,F f){//me→youまでのパスに作用
    base::evert(me);
    base::access(you);
    you->val=mapping(f,you->val);
    you->acc=mapping(f,you->acc);
    you->lz=composition(f,you->lz);
  }
};

uu S=cl;
uu F=ll;
S e(){rr{};}
F id(){rr 0;}
S op(S a,S b){rr a+b;}
S mapping(F f,S x){rr S(x.a+f*x.b,x.b);}
F composition(F f,F g){rr f+g;}
vo reverse_prod(S&x){}

vo main(){ll T=1;fo(T)solve();}
vo solve(){
  LL(N);
  
  link_cut_lazy_tree<S,op,e,reverse_prod,F,mapping,composition,id,link_cut_lazy_node<S,F>>lt(N);
  fo(i,N)lt.set(i,{0,1});
  
  fo(N-1){
    LL(u,v);u--,v--;
    lt.link(u,v);
  }
  
  ll su=0;
  LL(Q);
  fo(Q){
    LL(s,t);s--,t--;
    lt.apply(s,t,1);
    su+=lt.prod(s,t).a;
  }
  pp(su);
}}