제출 #1124044

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1124044		math_rabbit_1028	트리 (IOI24_tree)	C++20	0 / 100	2096 ms	38532 KiB

tree

#include "tree.h"
#include <queue>
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;
}

typedef priority_queue<pll, vector<pll>, greater<pll>> pq;

pq solve(int v, ll L, ll R) {
    pq plus;
    if (child[v].size() == 0) {
        dp[v] += L * w[v];
        sum[v] = L;
        return plus;
    }
    for (int u : child[v]) {
        pq t = solve(u, L, R);
        if (plus.size() < t.size()) swap(plus, t);
        while (!t.empty()) {
            plus.push(t.top());
            t.pop();
        }
        dp[v] += dp[u];
        sum[v] += sum[u];
    }
    plus.push({w[v], sum[v]-L});
    while (sum[v] > R) {
        pll t = plus.top();
        plus.pop();
        if (sum[v] - R < t.second) {
            dp[v] += (sum[v] - R) * t.first;
            sum[v] -= (sum[v] - R);
            plus.push({t.second - (sum[v] - R), t.first});
        }
        else {
            dp[v] += t.second * t.first;
            sum[v] -= t.second;
        }
    }
    return plus;
}

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:27:1: warning: control reaches end of non-void function [-Wreturn-type]
   27 | }
      | ^

• Subtask 0: 0 / 0
• Subtask 1: 0 / 10
• Subtask 2: 0 / 13
• Subtask 3: 0 / 18
• Subtask 4: 0 / 7
• Subtask 5: 0 / 11
• Subtask 6: 0 / 22
• Subtask 7: 0 / 19