bzoj 4326运输计划

 二分+树上倍增

先放一个用倍增法求解树上距离的方法，我最开始又犯了那个错误

这段我最开始上下又写反了。。。。（记性他就是不进脑子啊。。。再错我TM是dog）

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef int lint;
typedef pair<lint,lint> pii;
typedef pair<lint,pii> piii;
const lint maxn = 300005;
const lint maxm = 600005;
lint he[maxn],ver[maxm],ne[maxm],tot,cost[maxm],n,m;
void init(){
    //memset( he,0,sizeof( he ) );
    tot = 1;
}
void add( lint x,lint y,lint w ){
    ver[++tot] = y;
    ne[tot] = he[x];
    he[x] = tot;
    cost[tot] = w;
}
queue<lint> que;
lint d[maxn],f[maxn][21],dis[maxn][21];
lint build(){
    que.push(1);
    d[1] = 0;
    while( que.size() ){
        lint x = que.front();
        que.pop();
        for( lint cure = he[x];cure;cure = ne[cure] ){
            lint y = ver[cure];
            if( y == f[x][0] ) continue;
            que.push(y);
            f[y][0] = x;dis[y][0] = cost[cure];
            d[y] = d[x] + 1;
            for( lint i = 1;(1<<i) <= d[y];i++ ){
                f[y][i] = f[ f[y][i-1] ][i-1];
                dis[y][i] =  dis[y][i-1]+ dis[ f[y][i-1] ][i-1];
            }
        }
    }
}
lint lca( lint x,lint y,lint& c  ){
    if( d[x] < d[y] ) swap( x,y );
    c = 0;
    for( lint i = 20;i >= 0;i-- ){
        if( f[x][i] && d[ f[x][i] ] >= d[y] ) {
            c += dis[x][i];
            x = f[x][i];
        }
    }
    if( x == y ) return x;
    for( lint i = 20;i >= 0;i-- ){
        if( f[x][i] == f[y][i] ) continue;
        c += dis[x][i];
        c += dis[y][i];
        x = f[x][i];y = f[y][i];
    }
    c += dis[x][0] + dis[y][0] ;
    return f[x][0];
}
vector<piii> ve;
lint val[maxn],num,res = 0;
lint dfs( lint x,lint f,lint c ){
    lint sum = val[x];
    for( lint cure = he[x];cure;cure = ne[cure] ){
        lint y = ver[cure];
        if( y ==f ) continue;
        sum += dfs( y,x,cost[cure] );
    }
    if( sum == num ){
        res = max( res,c );
    }
    return sum;
}
bool judge( lint mid ){
    memset( val,0,sizeof( val ) );
    lint p = upper_bound( ve.begin(),ve.end(),piii( mid,pii( n+1,n+1 ) ) ) - ve.begin() ;
    num = ve.size()-p;
    res = 0;
    if( p == ve.size() ) return true;
    for( lint  i = p;i < ve.size();i++ ){
        lint x = ve[i].second.first;
        lint y = ve[i].second.second;
        lint w;
        val[x]++;val[y]++;val[lca(x,y,w)] -= 2;
    }
    dfs( 1,0,0 );
    if( ve.back().first - res <= mid ) return true;
    else return false;
}
int main(){
    scanf("%d%d",&n,&m);
    init();
    lint r = -1;
    for( lint x,y,w,i = 1;i <= n-1;i++ ){
        scanf("%d%d%d",&x,&y,&w);
        add( x,y,w );add( y,x,w );
    }
    build();
    //sort( ve.begin(),ve.end() );
    for( lint x,y,i = 1;i <= m;i++ ){
        scanf("%d%d",&x,&y);
        lint dist;
        lint z = lca( x,y,dist );
        r = max( r,dist );
        ve.push_back( piii( dist,pii( x,y ) ) );
    }
    sort( ve.begin(),ve.end() );
    lint l = 0;
    while( l != r-1 ){
        lint mid = l + r>> 1;
        if( judge(mid) ){
            r = mid;
        }else{
            l = mid;
        }
    }
    printf("%d", r );
    return 0;
}

 

正常求树上距离的代码

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef int lint;
typedef pair<lint,lint> pii;
typedef pair<lint,pii> piii;
const lint maxn = 300005;
const lint maxm = 600005;
lint he[maxn],ver[maxm],ne[maxm],tot,cost[maxm],n,m;
void init(){
    //memset( he,0,sizeof( he ) );
    tot = 1;
}
void add( lint x,lint y,lint w ){
    ver[++tot] = y;
    ne[tot] = he[x];
    he[x] = tot;
    cost[tot] = w;
}
queue<lint> que;
lint d[maxn],f[maxn][21],dis[maxn];
lint build(){
    que.push(1);
    d[1] = 0;
    dis[1] = 0;
    while( que.size() ){
        lint x = que.front();
        que.pop();
        for( lint cure = he[x];cure;cure = ne[cure] ){
            lint y = ver[cure];
            if( y == f[x][0] ) continue;
            que.push(y);
            f[y][0] = x;
            d[y] = d[x] + 1;
            dis[y] = dis[x] + cost[cure];
            for( lint i = 1;(1<<i) <= d[y];i++ ){
                f[y][i] = f[ f[y][i-1] ][i-1];
            }
        }
    }
}
lint lca( lint x,lint y  ){
    if( d[x] < d[y] ) swap( x,y );
    for( lint i = 20;i >= 0;i-- ){
        if( f[x][i] && d[ f[x][i] ] >= d[y] ) {
            x = f[x][i];
        }
    }
    if( x == y ) return x;
    for( lint i = 20;i >= 0;i-- ){
        if( f[x][i] == f[y][i] ) continue;
        x = f[x][i];y = f[y][i];
    }
    return f[x][0];
}
vector<piii> ve;
lint val[maxn],num,res = 0;
lint dfs( lint x,lint f,lint c ){
    lint sum = val[x];
    for( lint cure = he[x];cure;cure = ne[cure] ){
        lint y = ver[cure];
        if( y ==f ) continue;
        sum += dfs( y,x,cost[cure] );
    }
    if( sum == num ){
        res = max( res,c );
    }
    return sum;
}
bool judge( lint mid ){
    memset( val,0,sizeof( val ) );
    lint p = upper_bound( ve.begin(),ve.end(),piii( mid,pii( n+1,n+1 ) ) ) - ve.begin() ;
    num = ve.size()-p;
    res = 0;
    if( p == ve.size() ) return true;
    for( lint  i = p;i < ve.size();i++ ){
        lint x = ve[i].second.first;
        lint y = ve[i].second.second;
        lint w;
        val[x]++;val[y]++;val[lca(x,y)] -= 2;
    }
    dfs( 1,0,0 );
    if( ve.back().first - res <= mid ) return true;
    else return false;
}
int main(){
    scanf("%d%d",&n,&m);
    init();
    lint r = -1;
    for( lint x,y,w,i = 1;i <= n-1;i++ ){
        scanf("%d%d%d",&x,&y,&w);
        add( x,y,w );add( y,x,w );
    }
    build();
    //sort( ve.begin(),ve.end() );
    for( lint x,y,i = 1;i <= m;i++ ){
        scanf("%d%d",&x,&y);
        lint z = lca( x,y );
        lint dist = dis[x] + dis[y] - 2*dis[z];
        r = max( r,dist );
        ve.push_back( piii( dist,pii( x,y ) ) );
    }
    sort( ve.begin(),ve.end() );
    lint l = 0;
    while( l != r-1 ){
        lint mid = l + r>> 1;
        if( judge(mid) ){
            r = mid;
        }else{
            l = mid;
        }
    }
    printf("%d", r );
    return 0;
}