結果
問題 | No.2337 Equidistant |
ユーザー |
![]() |
提出日時 | 2023-06-02 21:41:17 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 830 ms / 4,000 ms |
コード長 | 8,540 bytes |
コンパイル時間 | 1,918 ms |
コンパイル使用メモリ | 149,416 KB |
最終ジャッジ日時 | 2025-02-13 17:53:14 |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 28 |
ソースコード
#include <string>#include <vector>#include<iostream>#include<cstdio>#include<cstdlib>#include<stack>#include<queue>#include<cmath>#include<algorithm>#include<functional>#include<list>#include<deque>#include<bitset>#include<set>#include<map>#include<unordered_map>#include<unordered_set>#include<cstring>#include<sstream>#include<complex>#include<iomanip>#include<numeric>#include<cassert>#include<random>#define X first#define Y second#define pb push_back#define rep(X,Y) for (int X = 0;X < (int)(Y);++X)#define reps(X,S,Y) for (int X = (int)(S);X < (int)(Y);++X)#define rrep(X,Y) for (int X = (int)(Y)-1;X >=0;--X)#define rreps(X,S,Y) for (int X = (int)(Y)-1;X >= (int)(S);--X)#define repe(X,Y) for (X = 0;X < (Y);++X)#define peat(X,Y) for (;X < (Y);++X)#define all(X) X.begin(),X.end()#define rall(X) X.rbegin(),X.rend()#define eb emplace_back#define UNIQUE(X) X.erase(unique(all(X)),X.end())#define Endl endl#define NL <<"\n"#define cauto const autousing namespace std;using ll=long long;using pii=pair<int,int>;using pll=pair<ll,ll>;template<class T> using vv=vector<vector<T>>;template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}//#undef NUIP#ifdef NUIP#include "benri.h"#else#define out(args...)#endifvoid ouT(ll x,int d=3){auto re=to_string(x);if((int)re.size()>d) re=x>0?"oo":"-oo";cout<<string(d-re.size(),' ')<<re<<",";}#ifdef __cpp_init_capturestemplate<typename T>vector<T> table(int n, T v){ return vector<T>(n, v);}template <class... Args> auto table(int n, Args... args){auto val = table(args...); return vector<decltype(val)>(n, move(val));}#endiftemplate<class A,class B> pair<A,B> operator+(const pair<A,B> &p,const pair<A,B> &q){ return {p.X+q.X,p.Y+q.Y};}template<class A,class B,class C,class D> pair<A,B>& operator+=(pair<A,B> &p,const pair<C,D> &q){ p.X+=q.X; p.Y+=q.Y; return p;}template<class A,class B> pair<A,B> operator-(const pair<A,B> &p,const pair<A,B> &q){ return {p.X-q.X,p.Y-q.Y};}template<class A,class B,class C,class D> pair<A,B>& operator-=(pair<A,B> &p,const pair<C,D> &q){ p.X-=q.X; p.Y-=q.Y; return p;}template<class A,class B> istream& operator>>(istream &is, pair<A,B> &p){ is>>p.X>>p.Y; return is;}template<class T=ll> T read(){ T re; cin>>re; return re;}template<class T=ll> T read(const T &dec){ T re; cin>>re; return re-dec;}template<class T=ll> vector<T> readV(const int sz){ vector<T> re(sz); for(auto &x:re) x=read<T>(); return re;}template<class T=ll> vector<T> readV(const int sz, const T &dec){ vector<T> re(sz); for(auto &x:re) x=read<T>(dec); return re;}vv<int> readG(const int &n,const int &m){ vv<int> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); g[a].pb(b); g[b].pb(a);} return g;}vv<int> readG(const int &n){ return readG(n,n-1);}vv<int> readD(const int &n,const int &m){ vv<int> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); g[a].pb(b); } return g;}vv<int> readD(const int &n){ return readD(n,n-1);}template<class T> vv<pair<int,T>> readG(const int &n,const int &m){ vv<pair<int,T>> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); cauto c=read<T>(); g[a].eb(b,c); g[b].eb(a,c);} return g;}template<class T> vv<pair<int,T>> readG(const int &n){ return readG<T>(n,n-1);}template<class T> vv<pair<int,T>> readD(const int &n,const int &m){ vv<pair<int,T>> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); cauto c=read<T>(); g[a].eb(b,c); } return g;}template<class T> vv<pair<int,T>> readD(const int &n){ return readD<T>(n,n-1);}#ifdef __cpp_deduction_guidestemplate<typename T> vector<T> readT(int n, T v){ return readV(n,v);}template <class... Args> auto readT(int n, Args... args){ vector re(1,readT(args...));rep(_,n-1) re.eb(readT(args...)); return re;}template<class Tuple, size_t... Is> void read_tuple_impl(istream &is, Tuple& t, index_sequence<Is...>){((is >> get<Is>(t)), ...);}template<class... Args> auto& operator>>(istream &is, tuple<Args...>& t){ read_tuple_impl(is, t, index_sequence_for<Args...>{}); return is;}template<class T> bool erase(multiset<T> &st, const T &v){if(cauto it=st.find(v); it==st.end()) return false; else{ st.erase(it); return true;}}#endif#ifdef __cpp_init_capturestemplate<typename T, size_t... Is> void addadd(T& t1, const T& t2, integer_sequence<size_t, Is...>){ cauto l = { (get<Is>(t1) += get<Is>(t2), 0)... }; (void)l;}template <typename...T>tuple<T...>& operator += (tuple<T...>& lhs, const tuple<T...>& rhs){ addadd(lhs, rhs, index_sequence_for<T...>{}); returnlhs;}template <typename...T>tuple<T...> operator +(tuple<T...> lhs, const tuple<T...>& rhs){ return lhs += rhs;}template<typename T, size_t... Is> void subsub(T& t1, const T& t2, integer_sequence<size_t, Is...>){ cauto l = { (get<Is>(t1) -= get<Is>(t2), 0)... }; (void)l;}template <typename...T>tuple<T...>& operator -= (tuple<T...>& lhs, const tuple<T...>& rhs){ subsub(lhs, rhs, index_sequence_for<T...>{}); returnlhs;}template <typename...T>tuple<T...> operator - (tuple<T...> lhs, const tuple<T...>& rhs){ return lhs -= rhs;}#endif#ifdef NUIP#define TT cauto TTT=read();rep(kase,TTT)if(cerr<<"Case #"<<kase<<endl)#else#define TT cauto TTT=read();rep(kase,TTT)#endifstruct sorted_impl{template<class T>friend vector<T>operator-(vector<T>a,sorted_impl){sort(all(a));return a;}friend string operator-(string a,sorted_impl){sort(all(a));return a;}}sorted;struct reversed_impl{template<class T>friend vector<T>operator-(vector<T> a,reversed_impl){reverse(all(a));return a;}friend string operator-(string a,reversed_impl){reverse(all(a));return a;}}reversed;struct distinct_impl{template<class T>friend vector<T>operator-(vector<T> a,distinct_impl){sort(all(a));UNIQUE(a);return a;}}distinct;template<class S>struct sortedWith{const S f;sortedWith(const S &f):f(f){}template<class T>friend vector<T>operator-(vector<T> a,const sortedWith&b){sort(all(a),[&](cauto&i,cauto&j){returnb.f(i)<b.f(j);});return a;}};template<class T>int operator/(const T&v,const vector<T>&vs){return lower_bound(all(vs),v)-vs.begin();}vector<int> Inds(const int n){vector<int> inds(n);iota(all(inds),0);return inds;}const ll MOD=1e9+7; //998244353;typedef vv<int> Graph;class Lca{public:vector<int> dep,cld;vector<ll> wdep;vv<int> par;const int LOGN=20;int weighted;vv<int> wei;void dfs(const Graph &g,int root){int n=g.size();vector<int> vst(n);stack<int> st; st.push(root);while(!st.empty()){int v=st.top(); st.pop();if(vst[v]==1){vst[v]=2;rep(i,g[v].size())if(g[v][i]!=par[v][0])cld[v]+=cld[g[v][i]]+1;}else if(vst[v]==0){st.push(v);vst[v]=1;rep(i,g[v].size())if(!vst[g[v][i]]){dep[g[v][i]]=dep[v]+1;wdep[g[v][i]]=wdep[v]+(weighted?wei[v][i]:1);par[g[v][i]][0]=v;st.push(g[v][i]);}}}}Lca(const Graph &g):weighted(0){int n=g.size();par.resize(n,vector<int>(LOGN,-1));dep.resize(n); wdep.resize(n); cld.resize(n); dfs(g,0);rep(i,LOGN-1)rep(v,n)par[v][i+1]=par[v][i]<0?-1:par[par[v][i]][i];}Lca(const vv<pii> &h):weighted(1){int n=h.size();vv<int> g(n);wei.resize(n);rep(i,n) for(pii x:h[i]){g[i].pb(x.X);wei[i].pb(x.Y);}par.resize(n,vector<int>(LOGN,-1));dep.resize(n); wdep.resize(n); cld.resize(n); dfs(g,0);rep(i,LOGN-1)rep(v,n)par[v][i+1]=par[v][i]<0?-1:par[par[v][i]][i];}int anc(int v,int n){rep(i,LOGN)if(n>>i&1)if((v=par[v][i])<0)break;return v;}int LCA(int v,int w){if(dep[v]>dep[w]) swap(v,w);w=anc(w,dep[w]-dep[v]);rrep(i,LOGN)if(par[v][i]!=par[w][i]){v=par[v][i];w=par[w][i];}return v==w?v:par[v][0];}ll dist(int v,int w){return wdep[v]+wdep[w]-2*wdep[LCA(v,w)];}};int main(){ios_base::sync_with_stdio(false); cin.tie(0);cout<<fixed<<setprecision(0);cauto n=read(0);cauto q=read(0);cauto g=readG(n);cauto qs=readV(q,pii(1,1));Lca h(g);vector<int> szs(n,1);{cauto dfs=[&](auto &&dfs, int v, int p)->int{for(cauto &u:g[v])if(u!=p) szs[v]+=dfs(dfs,u,v);return szs[v];};dfs(dfs,0,-1);}for(cauto &[u,v]:qs){cauto d=h.dist(u,v);if(d%2){cout<<0 NL;continue;}else if(h.dep[u]==h.dep[v]){cauto pu=h.anc(u,d/2-1);cauto pv=h.anc(v,d/2-1);cout<<n-szs[pu]-szs[pv] NL;}else{cauto c=(h.dep[u]>h.dep[v]?u:v);cauto b=h.anc(c,d/2-1);cauto a=h.par[b][0];cout<<szs[a]-szs[b] NL;}}return 0;}