結果
問題 | No.898 tri-βutree |
ユーザー |
![]() |
提出日時 | 2019-10-04 21:44:52 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 726 ms / 4,000 ms |
コード長 | 1,503 bytes |
コンパイル時間 | 2,020 ms |
コンパイル使用メモリ | 166,648 KB |
実行使用メモリ | 34,560 KB |
最終ジャッジ日時 | 2024-11-08 21:59:45 |
合計ジャッジ時間 | 13,263 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 21 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:46:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 46 | scanf("%lld",&N); | ~~~~~^~~~~~~~~~~ main.cpp:49:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 49 | scanf("%lld%lld%lld",&a,&b,&c); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp:62:20: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 62 | int Q;scanf("%lld",&Q); | ~~~~~^~~~~~~~~~~ main.cpp:65:30: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 65 | rep(i,3)scanf("%lld",&x[i]); | ~~~~~^~~~~~~~~~~~~~
ソースコード
#include<bits/stdc++.h>using namespace std;#define int long long#define rep(i,n) for(int i=0;i<(n);i++)#define pb push_back#define all(v) (v).begin(),(v).end()#define fi first#define se secondtypedef vector<int>vint;typedef pair<int,int>pint;typedef vector<pint>vpint;template<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}template<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}int N;int par[20][111111];vector<pint>G[111111];int dep[111111],cost[111111];void dfs(int v,int p,int d,int c){dep[v]=d;par[0][v]=p;cost[v]=c;for(auto e:G[v]){if(e.fi==p)continue;dfs(e.fi,v,d+1,c+e.se);}}int lca(int u,int v){if(dep[u]<dep[v])swap(u,v);rep(i,20)if((dep[u]-dep[v])>>i&1)u=par[i][u];if(u==v)return u;for(int i=19;i>=0;i--)if(par[i][u]!=par[i][v])u=par[i][u],v=par[i][v];return par[0][u];}inline int calc(int x,int y){int l=lca(x,y);return cost[x]+cost[y]-2*cost[l];}signed main(){scanf("%lld",&N);rep(i,N-1){int a,b,c;scanf("%lld%lld%lld",&a,&b,&c);G[a].pb({b,c});G[b].pb({a,c});}dfs(0,-1,0,0);rep(i,19){rep(j,N){if(par[i][j]==-1)par[i+1][j]=-1;else par[i+1][j]=par[i][par[i][j]];}}int Q;scanf("%lld",&Q);while(Q--){vint x(3);rep(i,3)scanf("%lld",&x[i]);vpint ls;rep(i,3)for(int j=i+1;j<3;j++){int l=lca(x[i],x[j]);ls.pb({dep[l],l});}sort(all(ls));int l=ls[2].se;int ans=0;rep(i,3)ans+=calc(x[i],l);printf("%lld\n",ans);}return 0;}