結果
問題 | No.898 tri-βutree |
ユーザー |
![]() |
提出日時 | 2019-10-04 21:50:29 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 622 ms / 4,000 ms |
コード長 | 10,382 bytes |
コンパイル時間 | 3,414 ms |
コンパイル使用メモリ | 210,656 KB |
最終ジャッジ日時 | 2025-01-07 20:28:24 |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 21 |
コンパイルメッセージ
main.cpp: In function ‘void scan(long long int&)’: main.cpp:78:38: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 78 | inline void scan(long long &a){ scanf("%lld", &a); } | ~~~~~^~~~~~~~~~~~
ソースコード
#include <bits/stdc++.h>using namespace std;using ll=long long;using ld=long double;using ull=unsigned long long;using uint=unsigned int;using pcc=pair<char,char>;using pii=pair<int,int>;using pll=pair<ll,ll>;using pdd=pair<double,double>;using tuplis=pair<ll,pll>;using tuplis2=pair<pll,ll>;template<class T> using pq=priority_queue<T,vector<T>,greater<T>>;const ll LINF=0x1fffffffffffffff;const ll MINF=0x7fffffffffff;const int INF=0x3fffffff;const ll MOD=1000000007;const ll MODD=998244353;const ld DINF=numeric_limits<ld>::infinity();const ld EPS=1e-9;const ld PI=3.141592653589793238462643383279;const vector<ll>four{0,1,0,-1,0};#define _overload4(_1,_2,_3,_4,name,...) name#define _overload3(_1,_2,_3,name,...) name#define _rep1(n) for(ll i=0;i<n;++i)#define _rep2(i,n) for(ll i=0;i<n;++i)#define _rep3(i,a,b) for(ll i=a;i<b;++i)#define _rep4(i,a,b,c) for(ll i=a;i<b;i+=c)#define rep(...) _overload4(__VA_ARGS__,_rep4,_rep3,_rep2,_rep1)(__VA_ARGS__)#define _rrep1(n) for(ll i=(n)-1;i>=0;i--)#define _rrep2(i,n) for(ll i=(n)-1;i>=0;i--)#define _rrep3(i,a,b) for(ll i=(b)-1;i>=(a);i--)#define _rrep4(i,a,b,c) for(ll i=a+(b-a-1)/c*c;i>=a;i-=c)#define rrep(...) _overload4(__VA_ARGS__,_rrep4,_rrep3,_rrep2,_rrep1)(__VA_ARGS__)#define each(i,a) for(auto &i:a)#define sum(...) accumulate(range(__VA_ARGS__),0LL)#define dsum(...) accumulate(range(__VA_ARGS__),double(0))#define _range(i) (i).begin(),(i).end()#define _range2(i,k) (i).begin(),(i).begin()+k#define _range3(i,a,b) (i).begin()+a,(i).begin()+b#define range(...) _overload3(__VA_ARGS__,_range3,_range2,_range)(__VA_ARGS__)#define _rrange(i) (i).rbegin(),(i).rend()#define _rrange2(i,k) (i).rbegin(),(i).rbegin()+k#define _rrange3(i,a,b) (i).rbegin()+a,(i).rbegin()+b#define rrange(...) _overload3(__VA_ARGS__,_rrange3,_rrange2,_rrange)(__VA_ARGS__)#define elif else if#define unless(a) if(!(a))#define mp make_pair#define mt make_tuple#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)#define vec(type,name,...) vector<type> name(__VA_ARGS__)#define VEC(type,name,size) vector<type> name(size);in(name)#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))#define VV(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__));in(name)#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))inline constexpr ll gcd(ll a,ll b){if(!a||!b)return 0;while(b){ll c=b;b=a%b;a=c;}return a;}inline constexpr ll lcm(ll a,ll b){if(!a||!b)return 0;return a*b/gcd(a,b);}template<class T> inline constexpr T min(vector<T> &v){return *min_element(range(v));}inline char min(string &v){return *min_element(range(v));}template<class T> inline constexpr T max(vector<T> &v){return *max_element(range(v));}inline char max(string &v){return *max_element(range(v));}inline constexpr ll intpow(ll a,ll b){ll ans=1;for(ll i=1;b;i*=2){if(b&i){b^=i;ans*=a;}a*=a;}return ans;}template<typename T>inline constexpr bool chmin(T &mn,const T &cnt){if(mn>cnt){mn=cnt;return 1;}else return 0;}template<typename T>inline constexpr bool chmax(T &mx,const T &cnt){if(mx<cnt){mx=cnt;return 1;}else return 0;}template<class T> unordered_map<T,ll> press(vector<T> &a){ auto b = a; sort(range(b)); b.erase(unique(range(b)), b.end()); unordered_map<T,ll> ans;rep(b.size()) ans[b[i]] = i; each(i, a) i = ans[i]; return ans; }template<class T> map<T,ll> press_map(vector<T> &a){ auto b = a; sort(range(b)); b.erase(unique(range(b)), b.end()); map<T,ll> ans; rep(b.size())ans[b[i]] = i; each(i, a) i = ans[i]; return ans; }inline int scan(){ return getchar(); }inline void scan(int &a){ scanf("%d", &a); }inline void scan(unsigned &a){ scanf("%u", &a); }inline void scan(long &a){ scanf("%ld", &a); }inline void scan(long long &a){ scanf("%lld", &a); }inline void scan(unsigned long long &a){ scanf("%llu", &a); }inline void scan(char &a){ cin >> a; }inline void scan(float &a){ scanf("%f", &a); }inline void scan(double &a){ scanf("%lf", &a); }inline void scan(long double &a){ scanf("%Lf", &a); }inline void scan(vector<bool> &vec){ for(unsigned i = 0; i < vec.size(); i++) { int a; scan(a); vec[i] = a; } }inline void scan(char a[]){ scanf("%s", a); }inline void scan(string &a){ cin >> a; }template<class T> inline void scan(vector<T> &vec);template<class T, size_t size> inline void scan(array<T, size> &vec);template<class T, class L> inline void scan(pair<T, L> &p);template<class T, size_t size> inline void scan(T (&vec)[size]);template<class T> inline void scan(vector<T> &vec){ for(auto &i : vec) scan(i); }template<class T, size_t size> inline void scan(array<T, size> &vec){ for(auto &i : vec) scan(i); }template<class T, class L> inline void scan(pair<T, L> &p){ scan(p.first); scan(p.second); }template<class T, size_t size> inline void scan(T (&vec)[size]){ for(auto &i : vec) scan(i); }template<class T> inline void scan(T &a){ cin>>a; }inline void in(){}template <class Head, class... Tail> inline void in(Head &head, Tail&... tail){ scan(head); in(tail...); }inline void print(){ putchar(' '); }inline void print(const bool &a){ printf("%d", a); }inline void print(const int &a){ printf("%d", a); }inline void print(const unsigned &a){ printf("%u", a); }inline void print(const long &a){ printf("%ld", a); }inline void print(const long long &a){ printf("%lld", a); }inline void print(const unsigned long long &a){ printf("%llu", a); }inline void print(const char &a){ printf("%c", a); }inline void print(const char a[]){ printf("%s", a); }inline void print(const float &a){ printf("%.15f", a); }inline void print(const double &a){ printf("%.15f", a); }inline void print(const long double &a){ printf("%.15Lf", a); }template<class T> void print(const vector<T> &vec);template<class T, size_t size> void print(const array<T, size> &vec);template<class T, class L> void print(const pair<T, L> &p);template<class T, size_t size> inline void print(const T (&vec)[size]);template<class T> void print(const vector<T> &vec){ if(vec.empty()) return; print(vec[0]); for(auto i = vec.begin(); ++i != vec.end(); ){ putchar(' '); print(*i); } }template<class T, size_t size> void print(const array<T, size> &vec){ print(vec[0]); for(auto i = vec.begin(); ++i != vec.end(); ){ putchar(' ');print(*i); } }template<class T, class L> void print(const pair<T, L> &p){ print(p.first); putchar(' '); print(p.second); }template<class T, size_t size> inline void print(const T (&vec)[size]){ print(vec[0]); for(auto i = vec; ++i != end(vec); ){ putchar(' '); print(*i);} }template<class T> inline void print(const T &a){ cout << a; }inline int out(){ putchar('\n'); return 0; }template<class T> inline int out(const T &t){ print(t); putchar('\n'); return 0; }template<class Head, class... Tail> inline int out(const Head &head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }template <class T> inline void err(T t){cerr<<t<<'\n';}template<class Head, class... Tail> inline void err(const Head &head, const Tail&... tail){ cerr<<head<<' '; err(tail...); }inline void err(){cerr<<'\n';}inline int first(const bool &i){return out(i?"first":"second");}inline int yes(const bool &i){return out(i?"yes":"no");}inline int Yes(const bool &i){return out(i?"Yes":"No");}inline int YES(const bool &i){return out(i?"YES":"NO");}inline int Yay(const bool &i){return out(i?"Yay!":":(");}inline int Possible(const bool &i){return out(i?"Possible":"Impossible");}inline int POSSIBLE(const bool &i){return out(i?"POSSIBLE":"IMPOSSIBLE");}inline void Case(ll i){printf("Case #%lld: ",i);}template< typename T >struct edge {int src, to;T cost;edge(int to, T cost) : src(-1), to(to), cost(cost) {}edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}edge &operator=(const int &x) {to = x;return *this;}operator int() const { return to; }};template< typename T >using Edges = vector< edge< T > >;template< typename T >using WeightedGraph = vector< Edges< T > >;using UnWeightedGraph = vector< vector< int > >;template< typename T >using Matrix = vector< vector< T > >;template< typename G >struct DoublingLowestCommonAncestor {const int LOG;vector< int > dep;const G &g;vector< vector< int > > table;DoublingLowestCommonAncestor(const G &g) : g(g), dep(g.size()), LOG(32 - __builtin_clz(g.size())) {table.assign(LOG, vector< int >(g.size(), -1));}void dfs(int idx, int par, int d) {table[0][idx] = par;dep[idx] = d;for(auto &to : g[idx]) {if(to != par) dfs(to, idx, d + 1);}}void build() {dfs(0, -1, 0);for(int k = 0; k + 1 < LOG; k++) {for(int i = 0; i < table[k].size(); i++) {if(table[k][i] == -1) table[k + 1][i] = -1;else table[k + 1][i] = table[k][table[k][i]];}}}int query(int u, int v) {if(dep[u] > dep[v]) swap(u, v);for(int i = LOG - 1; i >= 0; i--) {if(((dep[v] - dep[u]) >> i) & 1) v = table[i][v];}if(u == v) return u;for(int i = LOG - 1; i >= 0; i--) {if(table[i][u] != table[i][v]) {u = table[i][u];v = table[i][v];}}return table[0][u];}};ll n=100000;WeightedGraph<ll> G(n);ll sum[100001];void dfs(int idx, int par) {for(auto &to : G[idx]) {if(to != par) sum[to] += sum[idx] + to.cost, dfs(to, idx);}}signed main(){in(n);UnWeightedGraph g(n);rep(n-1){LL(u,v,w);g[u].push_back(v);g[v].push_back(u);G[u].emplace_back(u,v,w);G[v].emplace_back(v,u,w);}DoublingLowestCommonAncestor< UnWeightedGraph > lca(g);lca.build();dfs(0, -1);LL(q);rep(_,q){LL(x,y,z);ll xy=lca.query(x,y),yz=lca.query(y,z),zx=lca.query(z,x);out(sum[x]+sum[y]+sum[z]-sum[xy]-sum[yz]-sum[zx]);}}