BZOJ2286: [Sdoi2011]消耗战

虚树上DP

我$O(1)LCA$但是关于树上的链最小值不知道怎么做。。。只能$O(lgn)$倍增了
时间大的吓人

建虚树的方法我是sort两边

细节看代码

一开始$INF$设小了 WA到死都不知道

#include<cstdio>
#include<iostream>
#include<cstring>
#include<set>
#include<algorithm>
using namespace std;
#define ll long long
ll n,m;
ll ans;

inline ll min(ll a,ll b){return a<b?a:b;}
struct Chain
{
    ll u,len;
    Chain *next;
}*Head[250001],*Head2[250001];
const
   ll INF=1ll<<51;
namespace LC
{
ll Len[600001];
ll Dep[600001];
ll ST[900001][20];
ll In[600001];
ll Block[600001];
ll tot;
inline ll L(ll x,ll y){return Dep[x]<Dep[y]?x:y;}
inline ll LCA(ll a,ll b)
{
    if(!(a^b))return a;
    ll x=In[a],y=In[b];
    if(x>y)swap(x,y);
    ll Len=y-x+1,Bl=Block[Len];
    return L(ST[x][Bl],ST[y-(1<<Bl)+1][Bl]);
}

ll Dis(ll u,ll v){return Len[u]+Len[v]-2*Len[LCA(u,v)];}
ll Co[300001][20];
ll  f[300001][20];
inline void Bg()
{
    Len[0]=1ll<<29;
    Dep[0]=1ll<<29;
    ll base;
      for(ll i=1,base=1;i<=19;i++,base<<=1)
         for(ll j=1;j<=tot;j++)
             ST[j][i]=L(ST[j][i-1],ST[j+base][i-1]);
    for(ll i=1;i<=19;i++)
      for(ll j=1;j<=n;j++)
       f[j][i]=f[f[j][i-1]][i-1],
       Co[j][i]=min(Co[j][i-1],Co[f[j][i-1]][i-1]);
    ll con=0;
    for(ll i=1;i<=tot;i++)
      if(i^(i&-i))Block[i]=con-1;
      else Block[i]=con++;
}

ll Cost(ll a,ll b)
{
     ll j,res=INF;
     if(Dep[a]<Dep[b])swap(a,b);
     while(a^b)
     {
        for(j=0;Dep[f[a][j+1]]>Dep[b];j++)
         j++,j--;
        res=min(res,Co[a][j]);
        a=f[a][j];
     }
     return res;
}

void DFS(ll u,ll fa,ll len,ll dep)
{
    Dep[u]=dep;
   f[u][0]=fa;
    ST[In[u]=++tot][0]=u;
    Len[u]=len;
    for(Chain*tp=Head[u];tp;tp=tp->next)
      if(tp->u^fa)
       {
         DFS(tp->u,u,min(len,tp->len),dep+1);
         ST[++tot][0]=u;
         Co[tp->u][0]=tp->len;
       } 
    if(u^fa)return ;
    Co[u][0]=INF,Bg(); 
}
}
inline void Add(ll u,ll v,ll len){Chain *tp=new Chain;tp->len=len;tp->u=v;tp->next=Head[u];Head[u]=tp;}
inline void Link(ll u,ll v,ll len){Chain *tp=new Chain;tp->len=len;tp->u=v;tp->next=Head2[u];Head2[u]=tp;}
#define  LCA(a,b)   LC::LCA(a,b)
#define Cost(a,b)  LC::Cost(a,b)
#define In LC::In

bool Val[300001];

char c;
inline void read(ll &a)
{
    a=0;do c=getchar();while(c<'0'||c>'9');
    while(c<='9'&&c>='0')a=(a<<3)+(a<<1)+c-'0',c=getchar();
}
inline bool cmp(ll a,ll b){return In[a]<In[b];}
ll Cache[300001],T;
bool Has[300001];
inline void MadeTree()
{


    ll k;
    for(ll i=1;i<T;i++)
      {
      if(!Has[Cache[i]])Has[Cache[i]]=true;
       if(!Has[k=LCA(Cache[i],Cache[i+1])])
       Cache[++T]=k,Has[k]=true;
      }
    sort(Cache+1,Cache+1+T,cmp);
    for(ll i=1;i<T;i++)
      Link(LCA(Cache[i],Cache[i+1]),Cache[i+1],0);

}

#define it set<Side>::iterator
ll DFS(ll u,ll f)
{
    ll Ned;
    if(u^f)Ned=Cost(u,f);
    else
      Ned=INF;
    if(Val[u])
       return Cost(u,f);
    ll Ot=0;
    for(Chain *tp=Head2[u];tp;tp=tp->next)
       Ot+=DFS(tp->u,u);
    return min(Ot,Ned);
}

int main()
{

    ll i,j,k,l;
    read(n);
    for(i=1;i<n;i++)
       read(j),read(k),read(l),Add(j,k,l),Add(k,j,l);
    LC::DFS(1,1,INF,1);
    read(m);
    for(i=1;i<=m;i++)
    {
        read(T);
        for(j=1;j<=T;j++)
          read(Cache[j]);
        sort(Cache+1,Cache+1+T,cmp);
        for(j=1;j<=T;j++)
         Val[Cache[j]]=true;
        MadeTree();
        if(Cache[1]!=1)
          ans=Cost(1,Cache[1]);
        else ans=INF;
        ans=min(ans,DFS(Cache[1],1));
        for(j=1;j<=T;j++)
         Val[Cache[j]]=false;   
        for(j=1;j<=T;j++)
         Has[Cache[j]]=false,Head2[Cache[j]]=NULL;
        printf("%lld\n",ans);
    }
    return 0;
}