#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>
#include<list>
#include<functional>
#include<cassert>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 2000000005
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const int MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) { ll ret = 1; for (; b; b >>= 1, a = (a*a) % MMM)if (b & 1)ret = (ret*a) % MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };
struct line { // y = a*x + b
ll a, b;
};
vector<line> st[100005];
struct convexhull_trick {
int s = 0, e = 0;
line deq[100005];
double cross(int a, int b) {
return 1.0 * (deq[a].b - deq[b].b) / (deq[b].a - deq[a].a);
}
void insert(int N,line v) {
deq[e] = v;
while (s + 1<e && cross(e - 2, e - 1) > cross(e - 1, e)) {
st[N].pb(deq[e - 1]);
deq[e - 1] = deq[e];
e--;
}
e++;
}
ll query(ll x) {
int l = 0, r = e - 1;
while (l != r) {
int m = (l + r) / 2;
if (cross(m, m + 1) <= x) l = m + 1;
else r = m;
}
return deq[l].a*x + deq[l].b;
}
void roll(int N)
{
e--;
while (!st[N].empty())
{
deq[e++] = st[N].back();
st[N].pop_back();
}
}
void clear() { s = e = 0; }
}cht;
VPll v[100001];
ll dist[100001], s[100001], t[100001], ans[100001];
void dfs(int N, ll D, int p=-1)
{
dist[N] = D;
ans[N] = cht.query(t[N]) + D*t[N] + s[N];
cht.insert(N, { -D,ans[N] });
for (Pll P : v[N])
{
if (P.X == p)continue;
dfs(P.X, D + P.Y, N);
}
cht.roll(N);
}
int main() {
int n;
scanf("%d", &n);
fup(i, 1, n - 1, 1)
{
int x, y, z;
scanf("%d%d%d", &x, &y, &z);
v[x].pb(mp(y, z));
v[y].pb(mp(x, z));
}
fup(i, 2, n, 1)scanf("%lld%lld", s + i, t + i);
cht.insert(1,{ 0,0 });
dfs(1, 0);
fup(i, 2, n, 1)printf("%lld ", ans[i]);
}
Compilation message
harbingers.cpp: In function 'int main()':
harbingers.cpp:120:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &n);
~~~~~^~~~~~~~~~
harbingers.cpp:124:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d", &x, &y, &z);
~~~~~^~~~~~~~~~~~~~~~~~~~~~
harbingers.cpp:128:22: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
fup(i, 2, n, 1)scanf("%lld%lld", s + i, t + i);
~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
5112 KB |
Output is correct |
| 2 |
Correct |
11 ms |
5624 KB |
Output is correct |
| 3 |
Correct |
73 ms |
14456 KB |
Output is correct |
| 4 |
Correct |
99 ms |
18424 KB |
Output is correct |
| 5 |
Correct |
141 ms |
22904 KB |
Output is correct |
| 6 |
Correct |
183 ms |
26836 KB |
Output is correct |
| 7 |
Correct |
99 ms |
16992 KB |
Output is correct |
| 8 |
Runtime error |
213 ms |
65540 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
| 9 |
Runtime error |
166 ms |
65540 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
| 10 |
Runtime error |
180 ms |
65536 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
