Submission #309370

#	Time	Username	Problem	Language	Result	Execution time	Memory
309370		BorisBarca	Harbingers (CEOI09_harbingers)	C++14	70 / 100	187 ms	28324 KiB

harbingers

/*
$$$$$$$\                      $$\           $$$$$$$\
$$  __$$\                     \__|          $$  __$$\
$$ |  $$ | $$$$$$\   $$$$$$\  $$\  $$$$$$$\ $$ |  $$ | $$$$$$\   $$$$$$\   $$$$$$$\ $$$$$$\
$$$$$$$\ |$$  __$$\ $$  __$$\ $$ |$$  _____|$$$$$$$\ | \____$$\ $$  __$$\ $$  _____|\____$$\
$$  __$$\ $$ /  $$ |$$ |  \__|$$ |\$$$$$$\  $$  __$$\  $$$$$$$ |$$ |  \__|$$ /      $$$$$$$ |
$$ |  $$ |$$ |  $$ |$$ |      $$ | \____$$\ $$ |  $$ |$$  __$$ |$$ |      $$ |     $$  __$$ |
$$$$$$$  |\$$$$$$  |$$ |      $$ |$$$$$$$  |$$$$$$$  |\$$$$$$$ |$$ |      \$$$$$$$\\$$$$$$$ |
\_______/  \______/ \__|      \__|\_______/ \_______/  \_______|\__|       \_______|\_______|
*/
#include <bits/stdc++.h>

using namespace std;

#define PB push_back
#define MP make_pair
#define INS insert
#define LB lower_bound
#define UB upper_bound
#define pii pair <int,int>
#define pll pair <long long, long long>
#define X first
#define Y second
#define _ << " " <<
#define sz(x) (int)x.size()
#define all(a) (a).begin(),(a).end()
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORD(i, a, b) for (int i = (a); i > (b); --i)
#define FORA(i, x) for (auto &i : x)
#define REP(i, n) FOR(i, 0, n)
#define BITS(x) __builtin_popcount(x)
#define SQ(a) (a) * (a)
#define TRACE(x) cerr << #x " = " << (x) << '\n';
#define YES cout << "YES\n"
#define NO cout << "NO\n"
#define umap unordered_map

typedef long long ll;
typedef long double ld;
typedef vector <int> vi;
typedef vector <pii> vpi;
typedef vector <ll> vll;
typedef vector <pll> vpl;
typedef vector <double> vd;
typedef vector <ld> vld;
typedef vector<string> vs;
//((float) t)/CLOCKS_PER_SEC

const int MOD = 1e9 + 7;
const double PI = acos(-1);
const int INF = 1e9 + 10;
const ll INFL = 2e18 + 10;
const int ABC = 30;
const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const int dox[] = {-1, 1, 0, 0, -1, -1, 1, 1};
const int doy[] = {0, 0, -1, 1, -1, 1, -1, 1};

inline int sum(int a, int b){
	if (a + b < 0)
		return (a + b + MOD) % MOD;
	return (a + b) % MOD;
}

inline void add(int &a, int b){
	a = sum(a, b);
}

inline int mul(ll a, ll b){
	return ((a % MOD) * ((ll)b % MOD)) % MOD;
}

inline int sub(int a, int b){
	return (a - b + MOD) % MOD;
}

inline int fast_pot(ll pot, ll n){
	ll ret = 1;
	while (n){
		if (n & 1LL)
			ret = (ret * pot) % MOD;
		pot = (pot * pot) % MOD;
		n >>= 1LL;
	}
	return ret;
}

inline int divide(int a, int b){
	return mul(a, fast_pot(b, MOD - 2));
}

ll lcm(ll a, ll b){
	return abs(a * b) / __gcd(a, b);
}

void to_upper(string &x){
	REP(i, sz(x))
		x[i] = toupper(x[i]);
}

void to_lower(string &x){
	REP(i, sz(x))
		x[i] = tolower(x[i]);
}

string its(ll x){
	if (x == 0)
		return "0";
	string ret = "";
	while (x > 0){
		ret += (x % 10) + '0';
		x /= 10;
	}
	reverse(all(ret));
	return ret;
}

ll sti(string s){
	ll ret = 0;
	REP(i, sz(s)){
		ret *= 10;
		ret += (s[i] - '0');
	}
	return ret;
}

const int N = 1e5 + 10;
const int LOG = 20;

struct pravac{
	ll k, l;

	ll eval(ll x){
		return k * x + l;
	}
};

ll ccw(pravac a, pravac b, pravac c){
	return a.k * (b.l - c.l) + b.k * (c.l - a.l) + c.k * (a.l - b.l);
}

int idx = 0;

struct node{
	pravac p;
	int anc[LOG], vel;
} cht[N];
int id = 0;

void Add(int par, ll k, ll l){
	int curr = par;
	cht[id].p.k = k, cht[id].p.l = l;

	FORD(i, LOG - 1, -1){
		if (cht[curr].anc[0] == -1 || cht[curr].vel < 2)
			continue;
		if (ccw(cht[cht[curr].anc[0]].p, cht[curr].p, cht[id].p) <= 0)
			curr = cht[curr].anc[0];
	}

	assert(curr != -1);

	cht[id].vel = cht[curr].vel + 1;
	REP(i, LOG){
		cht[id].anc[i] = curr;
		if (curr != -1)
			curr = cht[curr].anc[i];
	}

	//cout << "Add:" _ id _ cht[id].vel _ cht[id].anc[0] << '\n';

	id++;
}

ll query(int node, ll x){
	int curr = node;
	FORD(i, LOG - 1, -1){
		int tmp = cht[curr].anc[i];
		if (tmp == -1 || cht[tmp].anc[0] == -1)
			continue;
		if (cht[cht[tmp].anc[0]].p.eval(x) < cht[tmp].p.eval(x))
			curr = cht[tmp].anc[0];
	}
	if (cht[curr].anc[0] != -1){
		if (cht[cht[curr].anc[0]].p.eval(x) < cht[curr].p.eval(x))
			curr = cht[curr].anc[0];
	}
	assert(curr != -1);
	return cht[curr].p.eval(x);
}

vpl e[N];
ll n, s[N], v[N], dp[N], c_id[N], cnt;

void dfs(int cvor, int dad, ll l){
	//TRACE(cvor);
	c_id[cvor] = id;
	if (dad){
		//cout << query(c_id[cvor], -v[cvor]) << '\n';
		assert(c_id[dad] >= 0);
		dp[cvor] = v[cvor] * l + s[cvor] + query(c_id[dad], -v[cvor]);
	}
	//cerr << cnt << '\n';
	cnt++;
	Add(c_id[dad], l, dp[cvor]);
	//cerr << "All ok\n";
	//cout << cvor _ c_id[cvor] _ dp[cvor] << '\n';
	//cout << "+";
	FORA(nxt, e[cvor]){
		if (nxt.X == dad)
			continue;
		dfs(nxt.X, cvor, l + nxt.Y);
	}
}

int main () {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	cht[0].p.k = 0, cht[0].p.l = INFL;
	REP(i, LOG)
		cht[0].anc[i] = -1;
	cht[0].vel = 0;
	id++;

	c_id[0] = 0;

	cin >> n;

	REP(i, n - 1){
		int x, y; cin >> x >> y;
		ll w; cin >> w;
		e[x].PB({y, w});
		e[y].PB({x, w});
	}	

	FOR(i, 2, n + 1)
		cin >> s[i] >> v[i];

	dfs(1, 0, 0);

	FOR(i, 2, n + 1)
		cout << dp[i] << ' ';
	cout << '\n';
	
	return 0;
}

• Subtask 1: 70 / 100