oj.uz

Submission #666343

# Submission time Handle Problem Language Result Execution time Memory
666343 2022-11-28T08:41:17 Z bojackduy Harbingers (CEOI09_harbingers) C++14
10 / 100
 1000 ms 21328 KB 
#include <iostream>
#include <queue>
#include <stack>
#include <algorithm>
#include <string.h>
#include <functional>
#pragma GCC optimize ("03")
#define task ""
#define size() size() * 1ll 
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define pii pair<int, int>
#define pll pair<int, long long>
#define fi first
#define se second
#define MASK(x) (1LL << (x))
#define BIT(x,i) (((x) >> (i)) & 1)
#define numbit(x) __builtin_popcountll(x)
 
using namespace std;
 
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef long long ll;
 
template<class t>
bool mini(t &x,t y) {
    if (y < x) {
       x = y;
       return 1;
    }
return 0;
}
template<class t>
bool maxi(t &x,t y) {
    if (x < y) {
       x = y;
       return 1;
    }
return 0;
}
 
const int N = 1e5 + 1;
 
int n, st, ed, sz;
int b[N], c[N];
ll dp[N], d[N];
pll q[N], bck[N];
vii a[N];
void dfs(int u, int p) {
    for (auto v: a[u]) if (v.se ^ p) {
        d[v.se] = d[u] + v.fi;
        dfs(v.se, u);
    }
}
ll divi(ll a, ll b) { // floored division
    return a / b - ((a ^ b) < 0 && a % b);
}
ll intersect(pll a, pll b) {
    return divi(b.se - a.se, a.fi - b.fi);
}
 
// dp[v] = - d[u] * b[v] + dp[u] + d[v] * b[v] + c[v];
void dfs1(int u, int p) {
    int lo = st, hi = ed - 2;
    while (lo <= hi) {
        int mid = lo + hi >> 1;
        if (intersect(q[mid], q[mid + 1]) <= b[u]) lo = mid + 1; else hi = mid - 1;
    }
    hi++;
    dp[u] = q[hi].fi * b[u] + q[hi].se + d[u] * b[u] + c[u];
    pll tmp = pll(-d[u], dp[u]);
    int old_sz = sz;
    while (ed - st > 1 && intersect(tmp, q[ed - 1]) <= intersect(q[ed - 1], q[ed - 2])) {
        bck[sz++] = q[ed - 1];
        ed--;
    }
    q[ed++] = tmp;
    for (auto v: a[u]) if (v.se ^ p) {
        dfs1(v.se, u);
    }
    ed--;
    while (sz > old_sz) {
        sz--;
        q[ed++] = bck[sz];
    }
}
void solve(int test = -1) {
    cin >> n;
    for (int i = 1; i < n; i++) {
        int x, y, z;
        cin >> x >> y >> z;
        a[x].pb(pii(z, y));
        a[y].pb(pii(z, x));
    }
    for (int i = 2; i <= n; i++) {
        cin >> c[i] >> b[i];
    }
    dfs(1, 0);
    q[ed++] = pll(0, 0);
    for (auto v: a[1]) {
        dfs1(v.se, 1);
    }
    for (int i = 2; i <= n; i++) cout << dp[i] << ' ';
}
 
int32_t main()  {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    // freopen(task".inp", "r", stdin);
    // freopen(task".out", "w", stdout);
 
    int T = 1;
    // cin >> T;
    for (int i = 1; i <= T; i++) {
        solve(i);
    }
return 0;
}
/*
 
*/

Compilation message

harbingers.cpp: In function 'void dfs1(int, int)':
harbingers.cpp:68:22: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   68 |         int mid = lo + hi >> 1;
      |                   ~~~^~~~

Subtask #1
10.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Incorrect 3 ms 3156 KB Output isn't correct
3 Incorrect 47 ms 10508 KB Output isn't correct
4 Incorrect 56 ms 14180 KB Output isn't correct
5 Incorrect 82 ms 18112 KB Output isn't correct
6 Incorrect 92 ms 21328 KB Output isn't correct
7 Incorrect 48 ms 10700 KB Output isn't correct
8 Incorrect 143 ms 14608 KB Output isn't correct
9 Incorrect 203 ms 17048 KB Output isn't correct
10 Execution timed out 1091 ms 14768 KB Time limit exceeded