#437669 (C++17) No.901 K-ary εxtrεεmε

• 問題: No.901 K-ary εxtrεεmε
• ユーザー: beet
• 提出日時: 2020-03-04 20:20:57
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 355 ms / 3,000 ms
• コード長: 5,146 bytes
• コンパイル時間: 3,075 ms
• コンパイル使用メモリ: 238,276 KB
• 実行使用メモリ: 41,336 KB
• 最終ジャッジ日時: 2024-10-14 00:26:01
• 合計ジャッジ時間: 11,781 ms
• ジャッジサーバーID （参考情報）: judge3 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	178 ms; 41,336 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	5 ms; 5,248 KB
testcase_03	AC	5 ms; 5,248 KB
testcase_04	AC	5 ms; 5,248 KB
testcase_05	AC	4 ms; 5,248 KB
testcase_06	AC	4 ms; 5,248 KB
testcase_07	AC	274 ms; 37,076 KB
testcase_08	AC	284 ms; 37,076 KB
testcase_09	AC	274 ms; 37,072 KB
testcase_10	AC	286 ms; 36,948 KB
testcase_11	AC	287 ms; 37,072 KB
testcase_12	AC	303 ms; 37,076 KB
testcase_13	AC	317 ms; 37,072 KB
testcase_14	AC	301 ms; 37,076 KB
testcase_15	AC	294 ms; 37,076 KB
testcase_16	AC	293 ms; 36,948 KB
testcase_17	AC	249 ms; 37,072 KB
testcase_18	AC	246 ms; 37,076 KB
testcase_19	AC	247 ms; 37,076 KB
testcase_20	AC	247 ms; 37,060 KB
testcase_21	AC	258 ms; 37,072 KB
testcase_22	AC	343 ms; 39,764 KB
testcase_23	AC	347 ms; 39,632 KB
testcase_24	AC	355 ms; 39,784 KB
testcase_25	AC	344 ms; 39,764 KB
testcase_26	AC	341 ms; 39,588 KB
testcase_27	AC	226 ms; 37,072 KB
testcase_28	AC	228 ms; 36,892 KB
testcase_29	AC	239 ms; 37,060 KB

ソースコード

#define PROBLEM "https://yukicoder.me/problems/3407"

#include<bits/stdc++.h>
using namespace std;

#define call_from_test
#ifndef call_from_test
#include<bits/stdc++.h>
using namespace std;
#endif
//BEGIN CUT HERE
struct FastIO{
  FastIO(){
    cin.tie(0);
    ios::sync_with_stdio(0);
  }
}fastio_beet;
//END CUT HERE
#ifndef call_from_test
signed main(){
  return 0;
}
#endif

#ifndef call_from_test
#include<bits/stdc++.h>
using namespace std;
#endif
//BEGIN CUT HERE
class EulerTourForVertex{
private:
  vector<int> ls,rs;
  int pos;

  void dfs(int v,int p){
    ls[v]=pos++;
    for(int u:G[v])
      if(u!=p) dfs(u,v);
    rs[v]=pos;
  }

public:
  vector< vector<int> > G;

  EulerTourForVertex(){}
  EulerTourForVertex(int n):ls(n),rs(n),G(n){}

  void add_edge(int u,int v){
    G[u].emplace_back(v);
    G[v].emplace_back(u);
  }

  void build(int r=0){
    pos=0;
    dfs(r,-1);
  }

  int idx(int v){return ls[v];}

  template<typename F>
  void exec(int v,F f){
    f(ls[v],rs[v]);
  }
};
//END CUT HERE
#ifndef call_from_test
signed main(){
  return 0;
}
#endif

#ifndef call_from_test
#include<bits/stdc++.h>
using namespace std;
#endif
//BEGIN CUT HERE
struct LowestCommonAncestor{
  int n,h;
  vector< vector<int> > G,par;
  vector<int> dep;
  LowestCommonAncestor(){}
  LowestCommonAncestor(int n):n(n),G(n),dep(n){
    h=1;
    while((1<<h)<=n) h++;
    par.assign(h,vector<int>(n,-1));
  }

  void add_edge(int u,int v){
    G[u].emplace_back(v);
    G[v].emplace_back(u);
  }

  void dfs(int v,int p,int d){
    par[0][v]=p;
    dep[v]=d;
    for(int u:G[v])
      if(u!=p) dfs(u,v,d+1);
  }

  void build(int r=0){
    dfs(r,-1,0);
    for(int k=0;k+1<h;k++)
      for(int v=0;v<n;v++)
        if(~par[k][v])
          par[k+1][v]=par[k][par[k][v]];
  }

  int lca(int u,int v){
    if(dep[u]>dep[v]) swap(u,v);
    for(int k=0;k<h;k++)
      if((dep[v]-dep[u])>>k&1)
        v=par[k][v];

    if(u==v) return u;

    for(int k=h-1;k>=0;k--)
      if(par[k][u]!=par[k][v])
        u=par[k][u],v=par[k][v];

    return par[0][u];
  }

  int distance(int u,int v){
    return dep[u]+dep[v]-dep[lca(u,v)]*2;
  }
};
//END CUT HERE
#ifndef call_from_test
signed main(){
  return 0;
}
#endif

#ifndef call_from_test
#include<bits/stdc++.h>
using namespace std;

#define call_from_test
#include "eulertourforvertex.cpp"
#include "lowestcommonancestor.cpp"
#undef call_from_test

#endif
//BEGIN CUT HERE
struct AuxiliaryTree : EulerTourForVertex{
  using super = EulerTourForVertex;
  LowestCommonAncestor lca;
  AuxiliaryTree(){}
  AuxiliaryTree(int n):super(n),lca(n){}

  void build(int r=0){
    super::build(r);
    lca.G=super::G;
    lca.build(r);
  }

  using super::idx;
  decltype(auto) query(vector<int> &vs){
    assert(!vs.empty());
    sort(vs.begin(),vs.end(),
         [&](int a,int b){return idx(a)<idx(b);});

    map<int, vector<int>> H;

    int k=vs.size();
    stack<int> st;
    st.emplace(vs[0]);
    H[vs[0]];
    for(int i=0;i+1<k;i++){
      int w=lca.lca(vs[i],vs[i+1]);
      if(w!=vs[i]){
        int l=st.top();st.pop();
        while(!st.empty()&&lca.dep[w]<lca.dep[st.top()]){
          H[st.top()].emplace_back(l);
          l=st.top();st.pop();
        }
        if(st.empty()||st.top()!=w){
          st.emplace(w);
          vs.emplace_back(w);
        }
        H[w].emplace_back(l);
      }
      st.emplace(vs[i+1]);
      H[vs[i+1]];
    }

    while(st.size()>1){
      int c=st.top();st.pop();
      H[st.top()].emplace_back(c);
    }

    return make_pair(st.top(),H);
  }
};
//END CUT HERE
#ifndef call_from_test

signed main(){
  int n;
  cin>>n;

  AuxiliaryTree G(n);
  vector<map<int, int>> ws(n);
  for(int i=1;i<n;i++){
    int u,v,w;
    cin>>u>>v>>w;
    G.add_edge(u,v);
    ws[u][v]=ws[v][u]=w;
  }
  G.build();

  using ll = long long;
  vector<ll> dep(n,-1);
  queue<int> que;
  dep[0]=0;
  que.emplace(0);
  while(!que.empty()){
    int v=que.front();que.pop();
    for(int u:G.G[v]){
      if(~dep[u]) continue;
      dep[u]=dep[v]+ws[v][u];
      que.emplace(u);
    }
  }

  int q;
  cin>>q;
  for(int i=0;i<q;i++){
    int k;
    cin>>k;
    vector<int> vs(k);
    for(int j=0;j<k;j++) cin>>vs[j];

    auto H=G.query(vs).second;
    ll ans=0;
    for(int v:vs)
      for(int u:H[v])
        ans+=dep[u]-dep[v];

    cout<<ans<<"\n";
  }
  cout<<flush;
  return 0;
}
#endif

#undef call_from_test

signed main(){
  int n;
  cin>>n;

  AuxiliaryTree G(n);
  vector<map<int, int>> ws(n);
  for(int i=1;i<n;i++){
    int u,v,w;
    cin>>u>>v>>w;
    G.add_edge(u,v);
    ws[u][v]=ws[v][u]=w;
  }
  G.build();

  using ll = long long;
  vector<ll> dep(n,-1);
  queue<int> que;
  dep[0]=0;
  que.emplace(0);
  while(!que.empty()){
    int v=que.front();que.pop();
    for(int u:G.G[v]){
      if(~dep[u]) continue;
      dep[u]=dep[v]+ws[v][u];
      que.emplace(u);
    }
  }

  int q;
  cin>>q;
  for(int i=0;i<q;i++){
    int k;
    cin>>k;
    vector<int> vs(k);
    for(int j=0;j<k;j++) cin>>vs[j];

    auto H=G.query(vs).second;
    ll ans=0;
    for(int v:vs)
      for(int u:H[v])
        ans+=dep[u]-dep[v];

    cout<<ans<<"\n";
  }
  cout<<flush;
  return 0;
}