oj.uz

Submission #869171

# Submission time Handle Problem Language Result Execution time Memory
869171 2023-11-03T11:05:20 Z sleepntsheep Harbingers (CEOI09_harbingers) C++17
50 / 100
 58 ms 19024 KB 
#include <cstdio>
#include <stack>
#include <cstring>
#include <cassert>
#include <string>
#include <deque>
#include <vector>
#include <map>
#include <queue>
#include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
using ll = long long;
using ld = long double;
#define ShinLena cin.tie(nullptr)->sync_with_stdio(false)


#define N 100005
#define ALL(x) x.begin(), x.end()

struct line
{
    int m, c;
    line(ll m, ll c) : m(m), c(c) {}
    line() : m(0), c(0) {}
    inline ll operator[](ll x) { return m*x+c; }
    inline ld intersect(line &l) { return (ld)(c-l.c)/(l.m-m); }
};

int n, s[N], v[N];
ll rt[N], dp[N];
vector<pair<int, int>> g[N];
line cht[N]; int sz;

inline int add(line k)
{
    if (sz > 1 && cht[sz].intersect(k) >= cht[sz].intersect(cht[sz-1])) return sz+1;
    int l = 2, r = sz, z = sz+1;
    for (; l <= r;)
    {
        int m = (l+r)/2;
        if (cht[m].intersect(cht[m-1]) > cht[m].intersect(k)) z = m, r = m - 1;
        else l = m + 1;
    }
    return z;
}

inline ll qry(ll x)
{
    int l = 1, r = sz - 1;
    for (;l <= r;)
    {
        int m = (l+r)/2;
        if (cht[m].intersect(cht[m+1]) <= x) l = m + 1;
        else r = m - 1;
    }
    return cht[l][x];
}

void dfs(int u, int p)
{
    int at, psz = sz;
    if (u != 1) dp[u] = s[u] + 1ll*v[u]*rt[u] - qry(v[u]);
    line nw{rt[u], -dp[u]}, overwrote = cht[at = add(nw)];
    cht[at] = nw, sz = at;
    for (auto [w, v] : g[u]) if (v != p) rt[v] = rt[u] + w, dfs(v, u);
    sz = psz; cht[at] = overwrote;
}

int main()
{
    ShinLena;
    cin >> n;
    for (int u, v, w, i = 1; i < n; ++i) cin >> u >> v >> w, g[u].emplace_back(w, v), g[v].emplace_back(w, u);
    for (int i = 2; i <= n; ++i) cin >> s[i] >> v[i];
    dfs(1, 1);
    for (int i = 2; i <= n; ++i) cout << dp[i] << ' ';

    return 0;
}

Subtask #1
50.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Incorrect 24 ms 10356 KB Output isn't correct
4 Incorrect 33 ms 13404 KB Output isn't correct
5 Correct 47 ms 16240 KB Output is correct
6 Correct 54 ms 19024 KB Output is correct
7 Correct 40 ms 10836 KB Output is correct
8 Incorrect 56 ms 14028 KB Output isn't correct
9 Incorrect 58 ms 15896 KB Output isn't correct
10 Incorrect 57 ms 15052 KB Output isn't correct