JZOJ4864. Dash Speed

题目大意

给定一个$n$个节点的树，树上每条边有一个存在的时间$[L_i,R_i]$，有$m$个询问，第$i$个询问是查询$v_i$这个时刻图中最大直径的长度。

Data Constraint
$n,m\leq70000$

题解

这题与JZOJ4769. graph类似，都是CDQ分治的思路。

先按时间分治，然后在并查集上维护联通块的直径即可。

时间复杂度：$O(nlog^2n)$

SRC

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
using namespace std ;

#define N 70000 + 10
const int MAXN = 19 ;
struct Edge {
    int u , v , l , r ;
} ;
struct Note {
    int d , x , y ;
    Note ( int D = 0 , int X = 0 , int Y = 0 ) { d = D , x = X , y = Y ; }
} DL[N] ;
struct Stack {
    bool flag ;
    int fx , fy ;
    Note ori ;
} Sta[N] ;

vector < int > G[N] ;
vector < Edge > E[4*N] ;

int fa[N] , Rank[N] ;
int RMQ[2*N][MAXN] , Tab[2*N] ;
int Node[2*N] , Next[2*N] , Head[N] , tot ;
int Q[N] , S[2*N] , P[2*N] , Fir[N] , Deep[N] , ans[N] ;
int n , m , Cnt , now , top ;

inline int Read() {
    int ret = 0 ;
    char ch = getchar() ;
    while ( ch < '0' || ch > '9' ) ch = getchar() ;
    while ( ch >= '0' && ch <= '9' ) ret = ret * 10 + ch - '0' , ch = getchar() ;
    return ret ;
}

inline Note Nmax( Note a , Note b ) {
    if ( a.d > b.d ) return a ;
    return b ;
}

inline void link( int u , int v ) {
    Node[++tot] = v ;
    Next[tot] = Head[u] ;
    Head[u] = tot ;
}

inline int LCA( int x , int y ) {
    x = Fir[x] , y = Fir[y] ;
    if ( x > y ) swap( x , y ) ;
    int k = Tab[y-x+1] ;
    if ( P[RMQ[x][k]] < P[RMQ[y-(1<<k)+1][k]] ) return S[RMQ[x][k]] ;
    return S[RMQ[y-(1<<k)+1][k]] ;
}

inline int Dist( int x , int y ) {
    return Deep[x] + Deep[y] - 2 * Deep[LCA( x , y )] ;
}

inline Note Merge( Note a , Note b ) {
    Note ret = Nmax( a , b ) ;
    ret = Nmax( ret , Note( Dist( a.x , b.x ) , a.x , b.x ) ) ;
    ret = Nmax( ret , Note( Dist( a.x , b.y ) , a.x , b.y ) ) ;
    ret = Nmax( ret , Note( Dist( a.y , b.x ) , a.y , b.x ) ) ;
    ret = Nmax( ret , Note( Dist( a.y , b.y ) , a.y , b.y ) ) ;
    return ret ;
}

void DFS( int x , int F ) {
    S[++Cnt] = x ;
    P[Cnt] = Deep[x] ;
    Fir[x] = Cnt ;
    for (int p = Head[x] ; p ; p = Next[p] ) {
        if ( Node[p] == F ) continue ;
        Deep[Node[p]] = Deep[x] + 1 ;
        DFS( Node[p] , x ) ;
        S[++Cnt] = x ;
        P[Cnt] = Deep[x] ;
    }
}

int Get( int x ) { return fa[x] == x ? x : Get(fa[x]) ; }

inline void Insert( Edge a ) {
    int fx = Get(a.u) ;
    int fy = Get(a.v) ;
    if ( fx == fy ) return ;
    if ( Rank[fx] > Rank[fy] ) swap(fx,fy) ;
    top ++ ;
    Sta[top].flag = 0 ;
    Sta[top].fx = fx , Sta[top].fy = fy ;
    Sta[top].ori = DL[fy] ;
    fa[fx] = fy ;
    if ( Rank[fx] == Rank[fy] ) Rank[fy] ++ , Sta[top].flag = 1 ;
    DL[fy] = Merge( DL[fy] , DL[fx] ) ;
    now = max( now , DL[fy].d ) ;
}

inline void ReSet( int k ) {
    while ( top > k ) {
        int x = Sta[top].fx ;
        int y = Sta[top].fy ;
        fa[x] = x ;
        if ( Sta[top].flag ) Rank[y] -- ;
        DL[y] = Sta[top].ori ;
        top -- ;
    }
}

void Solve( int v , int l , int r , int D ) {
    now = D ;
    int mid = (l + r) / 2 , Size = E[v].size() , Origin = top ;
    for (int i = 0 ; i < Size ; i ++ ) {
        Edge e = E[v][i] ;
        if ( e.l == l && e.r == r ) Insert(e) ;
        else {
            if ( e.r <= mid ) E[v+v].push_back(e) ;
            else if ( e.l > mid ) E[v+v+1].push_back(e) ;
            else {
                int t = e.r ;
                e.r = mid ;
                E[v+v].push_back(e) ;
                e.r = t , e.l = mid + 1 ;
                E[v+v+1].push_back(e) ;
            }
        }
    }
    D = now ;
    if ( l == r ) {
        int Num = G[l].size() ;
        for (int i = 0 ; i < Num ; i ++ ) ans[G[l][i]] = D ;
        ReSet( Origin ) ;
        return ;
    }
    Solve( v + v , l , mid , D ) ;
    Solve( v + v + 1 , mid + 1 , r , D ) ;
    ReSet( Origin ) ;
}

int main() {
    freopen( "speed.in" , "r" , stdin ) ;
    freopen( "speed.out" , "w" , stdout ) ;
    n = Read() , m = Read() ;
    for (int i = 1 ; i <= n ; i ++ ) {
        Rank[i] = 1 ;
        fa[i] = i ;
        DL[i] = Note( 0 , i , i ) ;
    }
    for (int i = 1 ; i < n ; i ++ ) {
        Edge now ;
        now.u = Read() , now.v = Read() , now.l = Read() , now.r = Read() ;
        link( now.u , now.v ) ;
        link( now.v , now.u ) ;
        E[1].push_back( now ) ;
    }
    for (int i = 1 ; i <= m ; i ++ ) Q[i] = Read() , G[Q[i]].push_back(i) ;
    Deep[1] = 1 ;
    DFS( 1 , 0 ) ;
    for (int i = 1 ; i <= Cnt ; i ++ ) RMQ[i][0] = i , Tab[i] = log(i) / log(2) ;
    for (int j = 1 ; j < MAXN ; j ++ ) {
        for (int i = 1 ; i <= Cnt ; i ++ ) {
            RMQ[i][j] = RMQ[i][j-1] ;
            if ( i + (1 << (j-1)) <= Cnt && P[RMQ[i+(1<<(j-1))][j-1]] < P[RMQ[i][j-1]] ) RMQ[i][j] = RMQ[i+(1<<(j-1))][j-1] ;
        }
    }
    Solve( 1 , 1 , n , 0 ) ;
    for (int i = 1 ; i <= m ; i ++ ) printf( "%d\n" , ans[i] ) ;
    return 0 ;
}

以上.