結果
| 問題 | No.898 tri-βutree |
| ユーザー |
 yuruhiya
|
| 提出日時 | 2020-01-20 16:38:52 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
CE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 10,396 bytes |
| コンパイル時間 | 2,004 ms |
| コンパイル使用メモリ | 202,444 KB |
| 最終ジャッジ日時 | 2024-11-14 22:03:37 |
| 合計ジャッジ時間 | 3,384 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge2 |
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
main.cpp: In function 'int gc()':
main.cpp:61:26: error: '_getchar_nolock' was not declared in this scope; did you mean 'getchar_unlocked'?
61 | #define getchar_unlocked _getchar_nolock
| ^~~~~~~~~~~~~~~
main.cpp:64:34: note: in expansion of macro 'getchar_unlocked'
64 | inline int gc()noexcept { return getchar_unlocked(); }
| ^~~~~~~~~~~~~~~~
ソースコード
#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#define rep(i, n) for(int i=0; i<(n); ++i)
#define FOR(i, m, n) for(int i=(m); i<(n); ++i)
#define rrep(i, n) for(int i=(n)-1; i>=0; --i)
#define rfor(i, m, n) for(int i=(m); i>=(n); --i)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define mp make_pair
#define pb push_back
#define eb emplace_back
using namespace std;
using LL = long long; using ld = long double;
using VB = vector<bool>; using VVB = vector<VB>;
using VI = vector<int>; using VVI = vector<VI>;
using VL = vector<LL>; using VVL = vector<VL>;
using VS = vector<string>; using VD = vector<double>;
using PII = pair<int, int>; using VP = vector<PII>;
using PLL = pair<LL, LL>; using VPL = vector<PLL>;
template<class T>using pq = priority_queue<T>;
template<class T>using pqs = priority_queue<T, vector<T>, greater<T>>;
constexpr int inf = (int)1e9;
constexpr LL inf_ll = (LL)1e18, MOD = 1000000007;
const ld PI = acosl(-1.0), EPS = 1e-12;
template<class T>inline void Sort(T& a)noexcept { sort(all(a)); }
template<class T>inline void RSort(T& a)noexcept { sort(rall(a)); }
template<class T>inline void Reverse(T& a)noexcept { reverse(all(a)); }
template<class T>inline void Unique(T& a)noexcept { a.erase(unique(all(a)), a.end()); }
template<class T>inline T Sorted(T a)noexcept { Sort(a); return a; }
template<class T>inline T RSorted(T a)noexcept { RSort(a); return a; }
template<class T>inline T Reversed(T a)noexcept { Reverse(a); return a; }
template<class T>inline T Uniqued(T a)noexcept { Unique(a); return a; }
template<class T>inline auto Max(const T& a)noexcept { return *max_element(all(a)); }
template<class T>inline auto Min(const T& a)noexcept { return *min_element(all(a)); }
template<class T>inline int MaxPos(const T& a)noexcept { return max_element(all(a)) - a.begin(); }
template<class T>inline int MinPos(const T& a)noexcept { return min_element(all(a)) - a.begin(); }
template<class T, class U>inline int Count(const T& a, const U& v)noexcept { return count(all(a), v); }
template<class T, class U>inline int Find(const T& a, const U& v)noexcept { auto pos = find(all(a), v); return pos == a.end() ? -1 : pos - a.begin(); }
template<class T, class U>inline U Sum(const T& a, const U& v)noexcept { return accumulate(all(a), v); }
template<class T, class U>inline int Lower(const T& a, const U& v)noexcept { return lower_bound(all(a), v) - a.begin(); }
template<class T, class U>inline int Upper(const T& a, const U& v)noexcept { return upper_bound(all(a), v) - a.begin(); }
template<class T, class P>inline void RemoveIf(T& a, P f)noexcept { a.erase(remove_if(all(a), f), a.end()); }
template<class T>inline T Age(T n, T m)noexcept { return (n + m - 1) / m; }
template<class T>inline T Age2(T n, T m)noexcept { return Age(n, m) * m; }
template<class T>inline T Tri(T n)noexcept { return (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1); }
template<class T = long long>inline T BIT(int b)noexcept { return T{ 1 } << b; }
template<class T>inline T Gcd(T n, T m)noexcept { return m ? Gcd(m, n % m) : n; }
template<class T>inline T Lcm(T n, T m)noexcept { return n / Gcd(n, m) * m; }
template<class T>inline T Pow(T a, T n)noexcept { T r = 1; while (n > 0) { if (n & 1)r *= a; a *= a; n /= 2; }return r; }
template<class T>inline T Powmod(T a, T n, T m = MOD)noexcept { T r = 1; while (n > 0) { if (n & 1)r = r * a % m, n--; else a = a * a % m, n /= 2; }return r; }
template<class T>inline bool chmax(T& a, const T& b)noexcept { if (a < b) { a = b; return true; } return false; }
template<class T>inline bool chmin(T& a, const T& b)noexcept { if (a > b) { a = b; return true; } return false; }
template<class T>inline bool inRange(const T& v, const T& min, const T& max)noexcept { return min <= v && v <= max; }
inline string operator*(string s, int n)noexcept { string ret; rep(i, n)ret += s; return ret; }
// --- input --- //
#if defined(_MSC_VER) || defined(ONLINE_JUDGE)
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
inline int gc()noexcept { return getchar_unlocked(); }
template<class T>inline void InputF(T& v)noexcept { cin >> v; }
inline void InputF(char& v)noexcept { while (isspace(v = gc())); }
inline void InputF(string& v)noexcept {
char c; for (InputF(c); !isspace(c); c = gc())v += c;
}
inline void InputF(int& v)noexcept {
bool neg = false; v = 0; char c; InputF(c);
if (c == '-') { neg = true; c = gc(); }
for (; isdigit(c); c = gc())v = v * 10 + (c - '0');
if (neg)v = -v;
}
inline void InputF(long long& v)noexcept {
bool neg = false; v = 0; char c; InputF(c);
if (c == '-') { neg = true; c = gc(); }
for (; isdigit(c); c = gc())v = v * 10 + (c - '0');
if (neg)v = -v;
}
inline void InputF(double& v)noexcept {
double dp = 1; bool neg = false, adp = false; v = 0; char c; InputF(c);
if (c == '-') { neg = true; c = gc(); }
for (; isdigit(c) || c == '.'; c = gc()) {
if (c == '.')adp = true;
else if (adp)v += (c - '0') * (dp *= 0.1);
else v = v * 10 + (c - '0');
}
if (neg)v = -v;
}
template<class T, class U>inline void InputF(pair<T, U>& v)noexcept {
InputF(v.first); InputF(v.second);
}
template<class T>inline void InputF(vector<T>& v)noexcept {
for (auto& e : v)InputF(e);
}
template<class T>inline T input() { T v; InputF(v); return v; }
struct InputV {
int n, m;
InputV(int N) :n(N), m(0) {}
InputV(pair<int, int> N) :n(N.first), m(N.second) {}
template<class T>operator vector<T>()noexcept {
vector<T> v(n); InputF(v); return v;
}
template<class T>operator vector<vector<T>>()noexcept {
vector<vector<T>> v(n, vector<T>(m)); InputF(v); return v;
}
};
struct Input {
template<class T>operator T()noexcept { return input<T>(); }
int operator--(int) { int v; InputF(v); v--; return v; }
InputV operator[](int n)noexcept { return InputV(n); }
InputV operator[](pair<int, int> n)noexcept { return InputV(n); }
void operator()() {}
template<class H, class...T>void operator()(H&& h, T&& ...t) {
InputF(h); operator()(forward<T>(t)...);
}
template<class T, size_t W>array<vector<T>, W> get(int H) {
array<vector<T>, W> ret;
rep(i, H)rep(j, W) { T x = *this; ret[j].push_back(x); }
return ret;
}
}in;
// --- output --- //
struct BoolStr {
const char* t, * f; BoolStr(const char* _t, const char* _f) :t(_t), f(_f) {}
}Yes("Yes", "No"), yes("yes", "no"), YES("YES", "NO"), Int("1", "0");
struct DivStr {
const char* d, * l; DivStr(const char* _d, const char* _l) :d(_d), l(_l) {}
}spc(" ", "\n"), no_spc("", "\n"), end_line("\n", "\n"), comma(",", "\n"), no_endl(" ", "");
class Output {
BoolStr B{ Yes }; DivStr D{ spc }; bool isPrint = true;
void p(double v) { printf("%.20f", v); } void p(long double v) { printf("%.20Lf", v); }
void p(int v) { printf("%d", v); } void p(LL v) { printf("%lld", v); }
void p(char v) { putchar(v); } void p(bool v) { printf("%s", v ? B.t : B.f); }
template<class T>void p(const T& v) { cout << v; }
template<class T, class U>void p(const pair<T, U>& v) { p(v.first); printf("%s", D.d); p(v.second); }
template<class T>void p(const vector<T>& v) { rep(i, sz(v)) { if (i)printf("%s", D.d); p(v[i]); } }
template<class T>void p(const vector<vector<T>>& v) { rep(i, sz(v)) { if (i)printf("%s", D.l); p(v[i]); } }
void p(const BoolStr& v) { B = v; isPrint = false; } void p(const DivStr& v) { D = v; isPrint = false; }
public:
void operator()() { printf("%s", D.l); }
template<class H>void operator()(H&& h) {
p(h); if (isPrint)printf("%s", D.l); isPrint = true; B = Yes; D = spc;
}
template<class H, class...T>void operator()(H&& h, T&& ...t) {
p(h); if (isPrint)printf("%s", D.d); isPrint = true; operator()(forward<T>(t)...);
}
template<class...T>void exit(T&& ...t) {
operator()(forward<T>(t)...); std::exit(EXIT_SUCCESS);
}
}out;
// --- dump --- //
#if __has_include("dump.hpp")
#include "dump.hpp"
#else
#define dump(...) (void(0))
#endif
// ---------------------------------------------------------------- //
using Weight = long long;
constexpr Weight INF = numeric_limits<Weight>::max();
struct Edge {
int to; Weight cost;
Edge() :to(-1), cost(-1) {}
Edge(int _to, Weight _cost = 1) :to(_to), cost(_cost) {}
};
bool operator>(const Edge& e1, const Edge& e2) { return e1.cost > e2.cost; }
ostream& operator<<(ostream& os, const Edge& e) {
return os << "->" << e.to << '(' << e.cost << ')';
}
struct Edge2 {
int u, v; Weight cost;
Edge2() :u(-1), v(-1), cost(0) {}
Edge2(int _u, int _v, Weight _cost) :u(_u), v(_v), cost(_cost) {}
};
ostream& operator<<(ostream& os, const Edge2& e) {
return os << e.u << "->" << e.v << '(' << e.cost << ')';
}
using Edges = vector<Edge>;
using Graph = vector<Edges>;
using Array = vector<Weight>;
using Matrix = vector<Array>;
using UnWeightedGraph = vector<vector<int>>;
struct LCA {
const int V, LOG;
vector<int> dist;
vector<vector<int>> table;
LCA(const Graph& g, const int root)
: V(g.size()), LOG(log2(V) + 1)
, dist(V), table(LOG, vector<int>(V)) {
dfs(g, root, -1, 0);
for (int k = 0; k + 1 < LOG; ++k) {
for (int v = 0; v < V; ++v) {
if (table[k][v] < 0) {
table[k + 1][v] = -1;
} else {
table[k + 1][v] = table[k][table[k][v]];
}
}
}
}
void dfs(const Graph& g, int v, int p, int d) {
table[0][v] = p;
dist[v] = d;
for (auto e : g[v])if (e.to != p) {
dfs(g, e.to, v, d + 1);
}
}
int operator()(int u, int v) {
if (dist[u] > dist[v])swap(u, v);
for (int k = 0; k < LOG; ++k) {
if ((dist[v] - dist[u]) >> k & 1) {
v = table[k][v];
}
}
if (u == v)return u;
for (int k = LOG - 1; k >= 0; --k) {
if (table[k][u] != table[k][v]) {
u = table[k][u];
v = table[k][v];
}
}
return table[0][u];
}
};
vector<Weight> ShortestPath(const Graph& g, int s) {
int V = g.size();
vector<Weight> dist(V);
function<void(int, int, Weight)> dfs = [&](int v, int p, Weight depth) {
dist[v] = depth;
for (auto e : g[v])if (e.to != p) {
dfs(e.to, v, depth + e.cost);
}
};
dfs(s, -1, 0);
return dist;
}
int main() {
int n = in;
Graph g(n);
rep(i, n - 1) {
int u = in, v = in; LL w = in;
g[u].eb(v, w);
g[v].eb(u, w);
}
auto dist = ShortestPath(g, 0);
LCA lca(g, 0);
auto calc = [&](int x, int y) {
return dist[x] + dist[y] - dist[lca(x, y)] * 2;
};
int q = in;
rep(i, q) {
int x = in, y = in, z = in;
out((calc(x, y) + calc(y, z) + calc(x, z)) / 2);
}
}