結果
問題 | No.1637 Easy Tree Query |
ユーザー | shu8Cream |
提出日時 | 2022-03-24 12:51:14 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,013 bytes |
コンパイル時間 | 2,482 ms |
コンパイル使用メモリ | 212,088 KB |
実行使用メモリ | 15,740 KB |
最終ジャッジ日時 | 2024-10-12 20:34:04 |
合計ジャッジ時間 | 9,149 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | WA | - |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
ソースコード
/*** author: shu8Cream* created: 24.03.2022 12:31:26**/#include <bits/stdc++.h>using namespace std;#define overload3(a,b,c,d,...) d#define rep1(i,n) for (int i=0; i<(n); i++)#define rep2(i,a,n) for (int i=(a); i<(n); i++)#define rep(...) overload3(__VA_ARGS__, rep2, rep1)(__VA_ARGS__)#define rrep1(i,n) for (int i=(n-1); i>=0; i--)#define rrep2(i,a,n) for (int i=(n-1); i>=(a); i--)#define rrep(...) overload3(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__)#define all(x) (x).begin(), (x).end()#define rall(x) (x).rbegin(), (x).rend()#define sz(x) int((x).size())using ll = long long;using P = pair<ll,ll>;template<typename T> using vc = vector<T>;template<typename T> using vv = vc<vc<T>>;using vi = vc<ll>;using vvi = vv<ll>;const ll INF = 8e18;template<typename T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;}template<typename T>string join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}template<typename T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v," ");return o;}template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.first>>v.second;}template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.first<<","<<v.second;}template<class T> inline bool chmax(T& a, T b) {if (a < b) { a = b; return true; }return false;}template<class T> inline bool chmin(T& a, T b) {if (a > b) { a = b; return true; }return false;}template <class T> string to_string(T s);template <class S, class T> string to_string(pair<S, T> p);string to_string(char c) { return string(1, c); }string to_string(string s) { return s; }string to_string(const char s[]) { return string(s); }template <class T>string to_string(T v) {if (v.empty()) return "{}";string ret = "{";for (auto x : v) ret += to_string(x) + ",";ret.back() = '}';return ret;}template <class S, class T>string to_string(pair<S, T> p) {return "{" + to_string(p.first) + ":" + to_string(p.second) + "}";}void debug_out() { cout << endl; }template <typename Head, typename... Tail>void debug_out(Head H, Tail... T) {cout << to_string(H) << " ";debug_out(T...);}#ifdef _DEBUG#define debug(...) debug_out(__VA_ARGS__)#else#define debug(...)#endifint main() {cin.tie(nullptr);ios::sync_with_stdio(false);ll n,q; cin >> n >> q;vvi to(n);rep(i,n-1){int a,b; cin >> a >> b;a--; b--;to[a].push_back(b);to[b].push_back(a);}vi cnt(n);auto dfs = [&](auto dfs,int s, int p=-1)->void{if(sz(to[s])) cnt[s]++;for(auto nv : to[s]){if(nv==p) continue;dfs(dfs,nv,s);cnt[s] += cnt[nv];}};dfs(dfs,0);cout << cnt << endl;ll ans = 0;rep(_,q){int p; ll x; cin >> p >> x;p--;ans += x*cnt[p];cout << ans << endl;}}