Submission #880615

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
880615	2023-11-29T17:36:16 Z	DylanSmith	Harbingers (CEOI09_harbingers)	C++17	60 / 100	1000 ms	38404 KB

harbingers

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x),end(x)
#define lb(x,y) lower_bound(all(x),y)-begin(x)

mt19937 rng;

struct Line {
    mutable ll k, m, p;
    bool operator<(const Line& o) const { return k < o.k; }
    bool operator<(ll x) const { return p < x; }
};

struct LineContainer : multiset<Line, less<>> {
    // (for doubles, use inf = 1/.0, div(a,b) = a/b)
    static const ll inf = LLONG_MAX;
    ll div(ll a, ll b) { // floored division
        return a / b - ((a ^ b) < 0 && a % b); }
    stack<Line> st; stack<int> type;
    int getTime() { return sz(type); }
    void setTime(int t) {
        while (sz(type) > t) {
            int t = type.top(); type.pop();
            Line p = st.top(); st.pop();
            if (t == 0) {
                insert(p);
            } else if (t == 1) {
                erase(p);
            } else {
                Line q = st.top(); st.pop();
                lower_bound(p)->p = q.p;
            }
        }
    }
    bool isect(iterator x, iterator y) {
        if (y == end()) return x->p = inf, 0;
        if (x->k == y->k) x->p = x->m > y->m ? inf : -inf;
        else x->p = div(y->m - x->m, x->k - y->k);
        return x->p >= y->p;
    }
    bool isectR(iterator x, iterator y) {
        st.push(*x);
        bool res = isect(x, y);
        type.push(2); st.push(*x);
        return res;
    }
    iterator eraseR(iterator x) {
        type.push(0);
        st.push(*x);
        return erase(x);
    }
    void add(ll k, ll m) {
        type.push(1);
        st.push({k, m, 0});
        auto z = insert({k, m, 0}), y = z++, x = y;
        while (isectR(y, z)) z = eraseR(z);
        if (x != begin() && isectR(--x, y)) isectR(x, y = eraseR(y));
        while ((y = x) != begin() && (--x)->p >= y->p)
            isectR(x, eraseR(y));
    }
    ll query(ll x) {
        assert(!empty());
        auto l = *lower_bound(x);
        return l.k * x + l.m;
    }
};

vector<vector<pair<int, int>>> adj;
LineContainer lc;
vector<ll> res;
vector<int> s, v;
vector<bool> vis;
void dfs(int u, int p) {
    vis[u] = true;
    if (u > 0) {
        res[u] = -lc.query(v[u]) + s[u] + (ll)v[u] * p;
        lc.add(p, -res[u]);
    }
    for (auto &edge : adj[u]) {
        int v = edge.first, k = edge.second;
        if (vis[v]) continue;
        int t = lc.getTime();
        dfs(v, p + k);
        lc.setTime(t);
    }
}

void solve() {
    int N; cin >> N;
    adj = vector<vector<pair<int, int>>>(N);
    for (int i = 0; i < N - 1; i++) {
        int u, v, k; cin >> u >> v >> k; u--; v--;
        adj[u].pb({v, k});
        adj[v].pb({u, k});
    }
    s = vector<int>(N);
    v = vector<int>(N);
    for (int i = 1; i < sz(s); i++) cin >> s[i] >> v[i];
    lc.add(0, 0);
    res = vector<ll>(N);
    vis = vector<bool>(N, 0);
    dfs(0, 0);
    for (int i = 1; i < sz(res); i++) {
        cout << res[i] << (i == sz(res) - 1 ? "\n" : " ");
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    rng = mt19937(chrono::steady_clock::now().time_since_epoch().count());

    solve();

    return 0;
}

Subtask #1

60.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	2 ms	1372 KB	Output is correct
3	Correct	39 ms	16100 KB	Output is correct
4	Correct	57 ms	23172 KB	Output is correct
5	Correct	72 ms	31240 KB	Output is correct
6	Runtime error	89 ms	38404 KB	Memory limit exceeded
7	Correct	51 ms	14672 KB	Output is correct
8	Execution timed out	1059 ms	23888 KB	Time limit exceeded
9	Execution timed out	1063 ms	14416 KB	Time limit exceeded
10	Execution timed out	1025 ms	26916 KB	Time limit exceeded