제출 #1123737

#제출 시각아이디문제언어결과실행 시간메모리
1123737math_rabbit_1028트리 (IOI24_tree)C++20
10 / 100
2096 ms27040 KiB
#include "tree.h" using namespace std; typedef long long ll; typedef pair<ll, ll> pll; int n; int par[202020]; vector<int> child[202020]; ll w[202020]; void init(vector<int> P, vector<int> W) { n = (int)P.size(); for (int i = 0; i < n; i++) { par[i] = P[i]; child[par[i]].push_back(i); } for (int i = 0; i < n; i++) w[i] = W[i]; } ll dp[202020], sum[202020]; ll minabs(ll l, ll r) { if (l <= 0 && r >= 0) return 0; if (r < 0) return r; if (l > 0) return l; } void solve(int v, ll L, ll R) { for (int u : child[v]) { solve(u, L, R); dp[v] += dp[u]; sum[v] += sum[u]; } ll now = minabs(L - sum[v], R - sum[v]); sum[v] += now; dp[v] += abs(now) * w[v]; } long long query(int L, int R) { for (int i = 0; i < n; i++) sum[i] = dp[i] = 0; solve(0, L, R); return dp[0]; }

컴파일 시 표준 에러 (stderr) 메시지

tree.cpp: In function 'll minabs(ll, ll)':
tree.cpp:26:1: warning: control reaches end of non-void function [-Wreturn-type]
   26 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...