Submission #2557780

---

Source Code Expand

#include<iostream>
#include<vector>

using namespace std;
bool visit[100001]={};
long dis[100001];
vector<vector<int>> vec1(100001);
vector<vector<long>> vec2(100001);

int dfs(int x){
  int i;
  visit[x]=true;
  for(i=0;i<vec1[x].size();i++){
    if(visit[vec1[x][i]]==false){
      dis[vec1[x][i]]=dis[x]+vec2[x][i];
      dfs(vec1[x][i]);
    }
  }
}

int main(){
  int n,a,b,q,k,x,y,i;
  long c;

  cin >> n;
  for(i=0;i<n-1;i++){
    cin>>a>>b>>c;
    vec1[a].push_back(b);
    vec1[b].push_back(a);
    vec2[a].push_back(c);
    vec2[b].push_back(c);
  }
  cin>>q>>k;
  dis[k]=0;
  dfs(k);
  for(i=0;i<q;i++){
    cin>>x>>y;
    cout<<dis[x]+dis[y]<<endl;
  }
}

Submission Info

Judge Result