zcmimi's blog
avatar
zc
2020-01-28 21:26:00
  • 本文总阅读量
查看原题

点击跳转

#include<bits/stdc++.h>
namespace ZDY{
    #pragma GCC optimize(3)
    #define il __inline__ __attribute__ ((always_inline))
    #define register
    #define ll long long
    #define ull unsigned long long
    #define db double
    #define sht short
    #define MB template <class T>il
    #define Fur(i,x,y) for(int i(x);i<=y;++i)
    #define Fdr(i,x,y) for(int i(x);i>=y;--i)
    #define fl(i,x) for(int i(head[x]),to;to=e[i].to,i;i=e[i].nxt)
    #define FL(i,x) for(int i(HEAD[x]),to;to=e[i].to,i;i=e[i].nxt)
    #define clr(x,y) memset(x,y,sizeof(x))
    #define cpy(x,y) memcpy(x,y,sizeof(x))
    #define fin(s) freopen(s".in","r",stdin)
    #define fout(s) freopen(s".out","w",stdout)
    #define fcin ios::sync_with_stdio(false)
    #define l2(n) ((int)(log2(n)))
    #define inf 2122219134
    MB T ABS(T x){return x>0?x:-x;}
    MB T MAX(T x,T y){return x>y?x:y;}
    MB T MIN(T x,T y){return x<y?x:y;}
    MB T GCD(T x,T y){return y?GCD(y,x%y):x;}
    MB void SWAP(T &x,T &y){T t=x;x=y;y=t;}
}using namespace ZDY;using namespace std;
namespace IO{const int str=1<<20;static char in_buf[str],*in_s,*in_t;bool __=0;il char gc(){return (in_s==in_t)&&(in_t=(in_s=in_buf)+fread(in_buf,1,str,stdin)),in_s==in_t?__=1,EOF:*in_s++;}il void in(string &ch){ch.clear();if(__)return;char c;while((c=gc())!=EOF&&isspace(c));if(c==EOF){__=1;return;}ch+=c;while((c=gc())!=EOF&&!isspace(c))ch+=c;if(c==EOF)__=1;}il void in(char &ch){if(__)return;char c;while((c=gc())!=EOF&&isspace(c));if(c==EOF)__=1;else ch=c;}il void in(char *ch){*ch='\0';if(__)return;char c;while((c=gc())!=EOF&&isspace(c));if(c==EOF){__=1;return;}*ch=c;ch++;while((c=gc())!=EOF&&!isspace(c))*ch=c,ch++;if(c==EOF)__=1;*ch='\0';}template<typename T>il void in(T &x){if(__)return;char c=gc();bool f=0;while(c!=EOF&&(c<'0'||c>'9'))f^=(c=='-'),c=gc();if(c==EOF){__=1;return;}x=0;while(c!=EOF&&'0'<=c&&c<='9')x=x*10+c-48,c=gc();if(c==EOF)__=1;if(f)x=-x;}template<typename T,typename ... arr>il void in(T &x,arr & ... y){in(x),in(y...);}const char ln='\n';static char out_buf[str],*out_s=out_buf,*out_t=out_buf+str;il void flush(){fwrite(out_buf,1,out_s-out_buf,stdout);out_s=out_buf;}il void pt(char c){(out_s==out_t)?(fwrite(out_s=out_buf,1,str,stdout),*out_s++=c):(*out_s++=c);}il void out(const char* s){while(*s)pt(*s++);}il void out(char* s){while(*s)pt(*s++);}il void out(char c){pt(c);}il void out(string s){for(int i=0;s[i];i++)pt(s[i]);}template<typename T>il void out(T x){if(!x){pt('0');return;}if(x<0)pt('-'),x=-x;char a[50],t=0;while(x)a[t++]=x%10,x/= 10;while(t--)pt(a[t]+'0');}template<typename T,typename ... arr>il void out(T x,arr & ... y){out(x),out(y...);}}using namespace IO;
const int N=250011;
int n,cnt=0,head[N],a[N],HEAD[N];
struct edge{int to,nxt,w;}e[N<<1];
il void add(int x,int y,int w){e[++cnt].to=y;e[cnt].nxt=head[x];head[x]=cnt;e[cnt].w=w;}
il void ADD(int x,int y){e[++cnt].to=y;e[cnt].nxt=HEAD[x];HEAD[x]=cnt;}
int dfn[N],sz=0,d[N],siz[N],top[N],f[N];
ll mi[N];
void dfs(int x){
    dfn[x]=++sz;
    siz[x]=1;
    fl(i,x)if(!dfn[to])
        f[to]=x,
        d[to]=d[x]+1,
        mi[to]=MIN(mi[x],1ll*e[i].w),
        dfs(to),
        siz[x]+=siz[to];
}
void bt(int x,int tp){
    top[x]=tp;int k=0;
    fl(i,x)if(to!=f[x]&&siz[to]>siz[k])k=to;
    if(k)bt(k,tp);
    fl(i,x)if(!top[to])bt(to,to);
}
int lca(int x,int y){
    while(top[x]!=top[y])
        d[top[x]]>d[top[y]]?x=f[top[x]]:y=f[top[y]];
    return d[x]<d[y]?x:y;
}
bool cmp(int x,int y){return dfn[x]<dfn[y];}
int st[N],tp;
void ins(int x){
    if(!tp)return void(st[++tp]=x);
    int t=lca(x,st[tp]);
    if(t==st[tp])return;
    while(tp&&dfn[st[tp-1]]>=dfn[t])ADD(st[tp-1],st[tp]),--tp;
    if(t!=st[tp])ADD(t,st[tp]),st[tp]=t;
    st[++tp]=x;
}
ll dp(int x){
    if(!HEAD[x])return mi[x];
    ll sum=0;
    FL(i,x)sum+=dp(to);
    HEAD[x]=0;
    return MIN(sum,mi[x]);
}
int main(){
    in(n);
    int k,x,y,w,q;
    Fur(i,1,n-1)in(x,y,w),add(x,y,w),add(y,x,w);
    mi[1]=1ll<<62;
    d[1]=1;
    dfs(1);bt(1,1);
    in(q);
    while(q--){
        cnt=0;
        in(k);
        Fur(i,1,k)in(a[i]);
        sort(a+1,a+k+1,cmp);
        st[tp=0]=1;
        Fur(i,1,k)ins(a[i]);
        while(tp)ADD(st[tp-1],st[tp]),--tp;
        out(dp(1),ln);
    }
    flush();
}
LG 2495 [SDOI2011]消耗战
comment评论
Search
search