oj.uz

답안 #666200

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
666200 2022-11-27T17:35:54 Z bojackduy Harbingers (CEOI09_harbingers) C++14
70 / 100
 1000 ms 24012 KB 
#include <iostream>
#include <queue>
#include <stack>
#include <algorithm>
#include <string.h>
#include <functional>
#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx2")
#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<long long, 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;
int b[N], c[N];
ll dp[N], d[N];
pll q[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);
    }
}
long double intersect(pll a, pll b) {
    return (long double) (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]);
    vll bck;
    while (ed - st > 1 && intersect(tmp, q[ed - 1]) <= intersect(q[ed - 1], q[ed - 2])) {
        bck.pb(q[ed - 1]);
        ed--;
    }
    q[ed++] = tmp;
    for (auto v: a[u]) if (v.se ^ p) {
        dfs1(v.se, u);
    }
    ed--;
    reverse(all(bck));
    for (auto x: bck) q[ed++] = x;
    vll().swap(bck);
}
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:66:22: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   66 |         int mid = lo + hi >> 1;
      |                   ~~~^~~~

Subtask #1
70.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 4 ms 3156 KB Output is correct
3 Correct 44 ms 11480 KB Output is correct
4 Correct 64 ms 15692 KB Output is correct
5 Correct 71 ms 19940 KB Output is correct
6 Correct 120 ms 24012 KB Output is correct
7 Correct 56 ms 11296 KB Output is correct
8 Execution timed out 1081 ms 16196 KB Time limit exceeded
9 Execution timed out 1072 ms 12620 KB Time limit exceeded
10 Execution timed out 1085 ms 17684 KB Time limit exceeded