結果
問題 | No.1637 Easy Tree Query |
ユーザー | Sumitacchan |
提出日時 | 2021-08-06 21:24:36 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 156 ms / 2,000 ms |
コード長 | 3,181 bytes |
コンパイル時間 | 2,666 ms |
コンパイル使用メモリ | 212,364 KB |
実行使用メモリ | 16,380 KB |
最終ジャッジ日時 | 2023-10-17 04:43:23 |
合計ジャッジ時間 | 8,059 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,348 KB |
testcase_01 | AC | 2 ms
4,348 KB |
testcase_02 | AC | 151 ms
15,060 KB |
testcase_03 | AC | 1 ms
4,348 KB |
testcase_04 | AC | 31 ms
8,472 KB |
testcase_05 | AC | 133 ms
8,196 KB |
testcase_06 | AC | 87 ms
6,876 KB |
testcase_07 | AC | 48 ms
4,348 KB |
testcase_08 | AC | 26 ms
7,396 KB |
testcase_09 | AC | 92 ms
11,364 KB |
testcase_10 | AC | 59 ms
5,820 KB |
testcase_11 | AC | 145 ms
12,420 KB |
testcase_12 | AC | 134 ms
10,836 KB |
testcase_13 | AC | 20 ms
5,748 KB |
testcase_14 | AC | 52 ms
10,964 KB |
testcase_15 | AC | 118 ms
12,684 KB |
testcase_16 | AC | 84 ms
12,976 KB |
testcase_17 | AC | 38 ms
5,820 KB |
testcase_18 | AC | 120 ms
8,196 KB |
testcase_19 | AC | 116 ms
8,724 KB |
testcase_20 | AC | 147 ms
10,836 KB |
testcase_21 | AC | 71 ms
8,988 KB |
testcase_22 | AC | 139 ms
14,004 KB |
testcase_23 | AC | 35 ms
6,348 KB |
testcase_24 | AC | 52 ms
8,724 KB |
testcase_25 | AC | 138 ms
7,932 KB |
testcase_26 | AC | 143 ms
11,100 KB |
testcase_27 | AC | 156 ms
13,740 KB |
testcase_28 | AC | 95 ms
7,404 KB |
testcase_29 | AC | 109 ms
10,044 KB |
testcase_30 | AC | 27 ms
8,988 KB |
testcase_31 | AC | 114 ms
4,764 KB |
testcase_32 | AC | 57 ms
7,140 KB |
testcase_33 | AC | 131 ms
6,876 KB |
testcase_34 | AC | 31 ms
16,380 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; //using namespace atcoder; struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_; #define FOR(i, begin, end) for(int i=(begin);i<(end);i++) #define REP(i, n) FOR(i,0,n) #define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--) #define IREP(i, n) IFOR(i,0,n) #define Sort(v) sort(v.begin(), v.end()) #define Reverse(v) reverse(v.begin(), v.end()) #define all(v) v.begin(),v.end() #define SZ(v) ((int)v.size()) #define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x)) #define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x)) #define chmax(a, b) a = max(a, b) #define chmin(a, b) a = min(a, b) #define bit(n) (1LL<<(n)) #define debug(x) cout << #x << "=" << x << endl; #define vdebug(v) { cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl; } #define mdebug(m) { cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;} } #define pb push_back #define fi first #define se second #define int long long #define INF 1000000000000000000 template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; } template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; } template<typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p){ cout << '(' << p.first << ',' << p.second << ')'; return os; } template<typename T> void Out(T x) { cout << x << endl; } template<typename T1, typename T2> void chOut(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); } using vec = vector<int>; using mat = vector<vec>; using Pii = pair<int, int>; using v_bool = vector<bool>; using v_Pii = vector<Pii>; //int dx[4] = {1,0,-1,0}; //int dy[4] = {0,1,0,-1}; //char d[4] = {'D','R','U','L'}; const int mod = 1000000007; //const int mod = 998244353; template<typename T> struct edge{ int to; T cost; int id; }; template<typename T = long long> struct Graph { int N; vector<vector<edge<T>>> E; vec sz; Graph(int N): N(N){ E = vector<vector<edge<T>>>(N, vector<edge<T>>(0)); sz.resize(N); } void add_Directed_edge(int from, int to, T cost = 1, int id = 0){ E[from].push_back(edge<T>({ to, cost, id })); } void add_Undirected_edge(int v1, int v2, T cost = 1, int id = 0){ add_Directed_edge(v1, v2, cost, id); add_Directed_edge(v2, v1, cost, id); } void dfs(int v, int p = -1){ sz[v] = 1; for(auto e: E[v]) if(e.to != p){ dfs(e.to, v); sz[v] += sz[e.to]; } } }; signed main(){ int N, Q; cin >> N >> Q; Graph G(N); REP(i, N - 1){ int a, b; cin >> a >> b; G.add_Undirected_edge(a - 1, b - 1); } G.dfs(0); int now = 0; vec ans(Q); REP(i, Q){ int p, x; cin >> p >> x; now += G.sz[p - 1] * x; ans[i] = now; } Out(ans); return 0; }