結果
問題 | No.1637 Easy Tree Query |
ユーザー |
![]() |
提出日時 | 2021-08-06 21:26:50 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 79 ms / 2,000 ms |
コード長 | 3,142 bytes |
コンパイル時間 | 2,502 ms |
コンパイル使用メモリ | 200,272 KB |
最終ジャッジ日時 | 2025-01-23 14:33:57 |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 33 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:136:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 136 | scanf("%d%d", &n, &q); | ~~~~~^~~~~~~~~~~~~~~~ main.cpp:140:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 140 | scanf("%d%d", &a, &b); | ~~~~~^~~~~~~~~~~~~~~~ main.cpp:152:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 152 | scanf("%d%d", &p, &x); | ~~~~~^~~~~~~~~~~~~~~~
ソースコード
#include <bits/stdc++.h> #include <vector> template <class T = int> struct Edge { int from, to; T cost; int idx; Edge() = default; Edge(int from, int to, T cost = 1, int idx = 0) : from(from), to(to), cost(cost), idx(idx) {} }; template <class T = int> struct Graph { std::vector<std::vector<Edge<T>>> es; int edge_num; Graph(int n) : edge_num(0) { es.resize(n); } int size() { return es.size(); } void add_edge(int from, int to, T cost = 1, int idx = 0) { es[from].emplace_back(from, to, cost, idx); ++edge_num; } std::vector<Edge<T>> edges() { std::vector<Edge<T>> tmp; for (int v = 0; v < (int)es.size(); ++v) { for (auto& e : es[v]) { tmp.push_back(e); } } if (tmp.size() >= 2 && tmp[0].idx == tmp[1].idx) { return tmp; } std::vector<Edge<T>> res(edge_num); for (auto& e : tmp) res[e.idx] = e; return res; } std::vector<Edge<T>>& operator[](int i) { return es[i]; } }; #include <algorithm> #include <cassert> #include <vector> template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; } template <class T> bool chmin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; } template <class T> T div_floor(T a, T b) { if (b < 0) a *= -1, b *= -1; return a >= 0 ? a / b : (a + 1) / b - 1; } template <class T> T div_ceil(T a, T b) { if (b < 0) a *= -1, b *= -1; return a > 0 ? (a - 1) / b + 1 : a / b; } template <typename T> struct CoordComp { std::vector<T> v; bool sorted; CoordComp() : sorted(false) {} int size() { return v.size(); } void add(T x) { v.push_back(x); } void build() { std::sort(v.begin(), v.end()); v.erase(std::unique(v.begin(), v.end()), v.end()); sorted = true; } int get_idx(T x) { assert(sorted); return lower_bound(v.begin(), v.end(), x) - v.begin(); } T &operator[](int i) { return v[i]; } }; #define For(i, a, b) for (int i = (int)(a); (i) < (int)(b); ++(i)) #define rFor(i, a, b) for (int i = (int)(a)-1; (i) >= (int)(b); --(i)) #define rep(i, n) For(i, 0, n) #define rrep(i, n) rFor(i, n, 0) #define fi first #define se second using namespace std; using lint = long long; using pii = pair<int, int>; using pll = pair<lint, lint>; int dfs(Graph<int> &gr, int v, int pv, vector<int> &sz) { for (auto &e : gr[v]) { if (e.to != pv) { sz[v] += dfs(gr, e.to, v, sz); } } return sz[v]; } int main() { int n, q; scanf("%d%d", &n, &q); Graph<int> gr(n); rep(i, n - 1) { int a, b; scanf("%d%d", &a, &b); --a; --b; gr.add_edge(a, b, 1); gr.add_edge(b, a, 1); } vector<int> sz(n, 1); dfs(gr, 0, -1, sz); lint ans = 0; rep(i, q) { int p, x; scanf("%d%d", &p, &x); --p; ans += (lint)sz[p] * x; printf("%lld\n", ans); } }