oj.uz

Submission #473724

# Submission time Handle Problem Language Result Execution time Memory
473724 2021-09-16T01:19:56 Z jalsol Harbingers (CEOI09_harbingers) C++17
20 / 100
 1000 ms 14584 KB 
// looking to shine brighter in this world...

#define TASK "harbingers"

#ifdef LOCAL
#include "local.h"
#else
#include <bits/stdc++.h>
#define debug(...)
#define DB(...)
#endif

using namespace std;

using ll = long long;
using ld = long double;

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second

#define For(i, l, r) for (int i = (l); i <= (r); ++i)
#define Ford(i, r, l) for (int i = (r); i >= (l); --i)
#define Rep(i, n) For (i, 0, (n) - 1)
#define Repd(i, n) Ford (i, (n) - 1, 0)
#define Fe(...) for (auto __VA_ARGS__)

template <class C> inline int isz(const C& c) { return static_cast<int>(c.size()); }
template <class T> inline bool chmin(T& a, const T& b) { return (a > b) ? a = b, true : false; }
template <class T> inline bool chmax(T& a, const T& b) { return (a < b) ? a = b, true : false; }

const bool __initialization = []() {
    cin.tie(nullptr)->sync_with_stdio(false);
    if (fopen(TASK".inp", "r")) {
        (void)(!freopen(TASK".inp", "r", stdin));
        (void)(!freopen(TASK".out", "w", stdout)); }
    cout << setprecision(12) << fixed;
    return true;
}();

constexpr ld eps = 1e-9;
constexpr int inf = 1e9;
constexpr ll linf = 1e18;

// =============================================================================

constexpr int maxn = 1e5 + 5;

struct Data {
    int v; ll c;

    Data() : v(0), c(0) {}
    Data(int _v, ll _c) : v(_v), c(_c) {}
};

struct Town {
    ll init, speed;

    Town() : init(0), speed(0) {}
    Town(ll _i, ll _s) : init(_i), speed(_s) {}
};

int n;
vector<Data> g[maxn];
Town a[maxn];

int par[maxn];
ll dist[maxn];
ll dp[maxn];

void Dfs(int u) {
    for (int v = par[u]; v; v = par[v]) {
        chmin(dp[u], dp[v] + a[u].init + a[u].speed * (dist[u] - dist[v]));
    }

    Fe (&[v, c] : g[u]) {
        if (par[v] != -1) continue;

        par[v] = u;
        dist[v] = dist[u] + c;

        Dfs(v);
    }
}

signed main() {
    cin >> n;

    Rep (_, n - 1) {
        int u, v; ll c; cin >> u >> v >> c;
        g[u].emplace_back(v, c);
        g[v].emplace_back(u, c);
    }

    For (i, 2, n) cin >> a[i].init >> a[i].speed;

    memset(par + 1, -1, 4 * n);
    memset(dp + 1, 0x3f, 8 * n);

    par[1] = 0;
    dp[1] = 0;

    Dfs(1);

    For (i, 2, n) {
        cout << dp[i] << " \n"[i == n];
    }

    return 0;
}

Subtask #1
20.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4172 KB Output is correct
2 Correct 19 ms 4556 KB Output is correct
3 Execution timed out 1093 ms 9380 KB Time limit exceeded
4 Execution timed out 1057 ms 11028 KB Time limit exceeded
5 Execution timed out 1052 ms 13016 KB Time limit exceeded
6 Execution timed out 1083 ms 14584 KB Time limit exceeded
7 Execution timed out 1088 ms 11256 KB Time limit exceeded
8 Execution timed out 1083 ms 14448 KB Time limit exceeded
9 Execution timed out 1085 ms 14392 KB Time limit exceeded
10 Execution timed out 1079 ms 13840 KB Time limit exceeded