#669400 (C++14) No.1637 Easy Tree Query

• 問題: No.1637 Easy Tree Query
• ユーザー: milkcoffee
• 提出日時: 2021-06-25 11:41:59
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 199 ms / 2,000 ms
• コード長: 1,897 bytes
• コンパイル時間: 3,915 ms
• コンパイル使用メモリ: 234,232 KB
• 実行使用メモリ: 14,080 KB
• 最終ジャッジ日時: 2024-09-17 03:18:04
• 合計ジャッジ時間: 9,930 ms
• ジャッジサーバーID （参考情報）: judge1 / judge5

ファイルパターン	結果
sample	AC * 2
other	AC * 33

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define ll long long
#define forin(in ,n) for(ll i=0; i<n; i++) cin>>in[i]
#define forout(out) for(ll i=0; i<(ll)out.size(); i++) cout<<out[i]<<endl
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep_up(i, a, n) for (ll i = a; i < n; ++i)
#define rep_down(i, a, n) for (ll i = a; i >= n; --i)
#define P pair<ll, ll>
#define all(v) v.begin(), v.end()
#define fi first
#define se second
#define vvvll vector<vector<vector<ll>>>
#define vvll vector<vector<ll>>
#define vll vector<ll>
#define pqll priority_queue<ll>
#define pqllg priority_queue<ll, vector<ll>, greater<ll>>
constexpr ll INF = (1ll << 60);
//constexpr ll mod = 1000000007;
constexpr ll mod = 998244353;
vll seen(100001);
vll cnt(100001);
void dfs(vvll &G, ll v){
    ll res=1;
    seen[v]=1;
    for(auto e:G[v]){
        if(seen[e]==1) continue;
        dfs(G,e);
        res+=cnt[e];
    }
    cnt[v]=res;
}
void solve(){
    ll n,q,sum=0,ans=0;
    cin>>n>>q;
    if(n<2||n>100000||q<1||q>100000){
        cout<<"Error"<<endl;
        return;
    }
    vvll G(n);
    rep(i,n-1){
        ll a,b;
        cin>>a>>b;
        if(a>n||a<1||b>n||b<1){
            cout<<"Error"<<endl;
            return;
        }
        a--;b--;
        G[a].push_back(b);
        G[b].push_back(a);
    }
    dfs(G,0);
    rep(i,q){
        ll p,x;
        cin>>p>>x;
        if(p<1||p>n||x<1||x>100000000){
            cout<<"Error"<<endl;
            return;
        }
        p--;
        sum+=cnt[p]*x;
        cout<<sum<<endl;
    }
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    // cout << fixed << setprecision(16);
    //ll T;
    //cin>>T;
    //rep(ca,T) 
    solve();
    
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX