제출 #381351

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
381351		Return_0	Construction of Highway (JOI18_construction)	C++17	100 / 100	426 ms	15728 KiB

construction

#pragma GCC optimize("Ofast,unroll-loops")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef int ll;
typedef long double ld;
typedef pair <ll, ll> pll;

#ifdef SINA
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; }
template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) {
	const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); }
#define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1); cout.flush();
#else
#define dbg(...) 0
#define dbg2(x, j, n) 0
#endif
#define SZ(x) ((ll)((x).size()))
#define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout);
#define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i];
#define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n');
#define kill(x) return cout<< (x) << endl, 0
#define cl const ll
#define fr first
#define sc second
#define lc (v << 1)
#define rc (lc | 1)
#define mid ((l + r) >> 1)
#define All(x) (x).begin(), (x).end()

cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353;

template <class A,class B> ostream& operator << (ostream& out,const pair<A,B>&a){return out<<'('<<a.first<<", "<<a.second<<')';}
template <class A> ostream& operator << (ostream& out, const vector<A> &a) {
	out<< '['; for (int i = -1; ++i < int(a.size());) out<< a[i] << (i + 1 < int(a.size()) ? ", " : ""); return out<<']'; }
template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>;

cl N = 1e5 + 7, lg = 17;

struct fenwick {
	ll fen [N];
	inline fenwick () { memset(fen ,0, sizeof fen); }
	inline void add (ll i, cl &x) { for (; i; i -= i & -i) fen[i] += x; }
	inline ll ask (ll i) { ll t = 0; for (; i < N; i += i & -i) t += fen[i]; return t; }
} fen;

ll c [N], down [N], anc [N][lg], h [N], n;
vector <ll> cmprs;
vector <pll> inv;

inline ll up (ll v, cl &d) { for (ll i = lg; i--;) if (d >> i & 1) v = anc[v][i]; return v; }
inline pll LCA (ll v, ll u) {
	if (h[v] > h[u]) v = up(v, h[v] - h[u]);
	else u = up(u, h[u] - h[v]);
	for (ll i = lg; i--;) if (anc[v][i] ^ anc[u][i]) v = anc[v][i], u = anc[u][i];
	return pll(v, u);
}

void add_path (ll root, ll v) {
	if (v == root) return;
	if (down[root] == anc[v][0]) {
		inv.push_back({c[root], h[v] - h[root]});
		return;
	}
	auto[lcrt, lcv] = LCA(down[root], v);
	inv.push_back({c[root], h[lcrt] - h[root]});
	down[lcrt] = down[root];
	c[lcrt] = c[root];
	add_path(lcv, v);
}

long long solve () {
	long long ans = 0;
	for (auto &x : inv) {
		ans += 1LL * fen.ask(x.fr + 1) * x.sc;
		fen.add(x.fr, x.sc);
	}
	for (auto &x : inv) fen.add(x.fr, -x.sc);
	inv.clear();
	return ans;
}

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

	cin>> n;
	for (ll i = 1; i <= n; i++) {
		cin>> c[i];
		cmprs.push_back(c[i]);
	}

	sort(All(cmprs)); cmprs.resize(unique(All(cmprs)) - cmprs.begin());
	for (ll i = 1; i <= n; i++) c[i] = upper_bound(All(cmprs), c[i]) - cmprs.begin();

	down[1] = 1;
	for (ll i = 0; i < lg; i++) anc[1][i] = 1;

	for (ll i = 1, v, u; i < n; i++) {
		cin>> v >> u;
		h[u] = h[v] + 1;
		anc[u][0] = v;
		for (ll i = 1; i < lg; i++) anc[u][i] = anc[anc[u][i - 1]][i - 1];
		add_path(1, u);
		cout<< solve() << '\n';
		c[1] = c[u];
		down[1] = u;
	}

	cerr<< "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";

	return 0;
}
/*
5
1 2 3 4 5
1 2
2 3
2 4
3 5

10
1 7 3 4 8 6 2 9 10 5
1 2
1 3
2 4
3 5
2 6
3 7
4 8
5 9
6 10

*/

• Subtask 1: 7 / 7
• Subtask 2: 9 / 9
• Subtask 3: 84 / 84