oj.uz

Submission #113958

# Submission time Handle Problem Language Result Execution time Memory
113958 2019-05-29T09:57:08 Z RockyB Construction of Highway (JOI18_construction) C++17
100 / 100
 427 ms 153872 KB 
/// In The Name Of God

#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include <bits/stdc++.h>

#define f first
#define s second

#define pb push_back
#define pp pop_back
#define mp make_pair

#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()

#define rep(i, l, r) for (int i = (l); i <= (r); i++)
#define per(i, l, r) for (int i = (l); i >= (r); i--)

#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);

#define nl '\n'
#define ioi exit(0);

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

const int N = (int)2e5 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;

const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};

using namespace std;

int n;
int a[N];

pair <int, int> e[N];
vector <int> g[N];

int sz[N], up[N], par[N], len[N], dep[N];

inline void dfs_sz(int v = 1, int p = 0) {
	sz[v]++;
	par[v] = p;
	dep[v] = dep[p] + 1;
	for (auto &to : g[v]) {
		if (to != p) {
			dfs_sz(to, v);
			sz[v] += sz[to];
			if (sz[to] > sz[g[v][0]]) swap(g[v][0], to);
		}
	}
}
inline void dfs(int v = 1) {
	len[up[v]]++;
	for (auto to : g[v]) {
		up[to] = (to == g[v][0] ? up[v] : to);
		dfs(to);
	}
}
deque < pair <int, int > > path[N];

inline void paint_v(deque < pair <int, int> > &x, int L, int c) {
	//reverse(all(x));
	int add = L;
	while (sz(x)) {
		auto &it = x.front();
		if (it.s <= L) {
			L -= it.s;
			x.pop_front();
		}
		else {
			it.s -= L;
			break;
		}
	}
	x.push_front({c, add});
	//reverse(all(x));
}
inline void paint(int v, int x) {
	paint_v(path[up[v]], dep[v] - dep[up[v]] + 1, x);
	v = par[up[v]];
	while (v) {
		int cut = dep[v] - dep[up[v]] + 1, L = cut;
		//reverse(all(path[up[v]]));
		while (sz(path[up[v]])) {
			auto &it = path[up[v]].front();
			if (it.s <= cut) {
				cut -= it.s;
				path[up[v]].pop_front();
			}
			else {
				it.s -= cut;
				break;
			}
		}
		path[up[v]].push_front({x, L});
		//reverse(all(path[up[v]]));
		v = par[up[v]];
	}
}

int Sz;

pair <int, int> bfr[N], nbfr[N], s[N], add[N];

inline ll inv(int l, int r) {
	if (l >= r) {
		if (l == r) bfr[r] = s[r];
		return 0;
	}
	int mid = (l + r) >> 1;
	ll res = inv(l, mid) + inv(mid + 1, r), pref = 0;
	int ptr = l, pos = l;
	rep(i, mid + 1, r) {
		while (ptr <= mid && bfr[ptr].f < bfr[i].f) {
			pref += bfr[ptr].s;
			nbfr[pos++] = bfr[ptr++];
		}
		nbfr[pos++] = bfr[i];
		res += (ll)bfr[i].s * pref;
	}
	while (ptr <= mid) nbfr[pos++] = bfr[ptr++];
	rep(i, l, r) {
		bfr[i] = nbfr[i];
	}
	return res;
}
inline void calc(int v, int u) {
	Sz = 0;
	int L = dep[v] - dep[up[v]] + 1, V = v;
	for (auto it : path[up[v]]) {
		if (it.s < L) {
			if (Sz && s[Sz - 1].f == it.f) {
				s[Sz - 1].s += it.s;
			}
			else {
				s[Sz++] = it;
			}
			L -= it.s;
		}
		else {
			if (Sz && s[Sz - 1].f == it.f) {
				s[Sz - 1].s += L;
			}
			else {
				s[Sz++] = {it.f, L};
			}
			break;
		}
	}
	reverse (s, s + Sz);
	v = par[up[v]];
	while (v) {
		int need = dep[v] - dep[up[v]] + 1, tmp = 0;

		for (auto it : path[up[v]]) {
			if (it.s < need) {
				add[tmp++] = it;
				need -= it.s;
			}
			else {
				add[tmp++] = {it.f, need};
				break;
			}
		}
		reverse (add, add + tmp);
		rep(i, 0, tmp - 1) {
			auto it = add[i];
			if (Sz && s[Sz - 1].f == it.f) {
				s[Sz - 1].s += it.s;
			}
			else {
				s[Sz++] = it;
			}
		}
		v = par[up[v]];
	}
	ll cnt = inv(0, Sz - 1);
	/*
	rep(i, 0, sz(s) - 1) {
		rep(j, i + 1, sz(s) - 1) {
			if (s[i].f > s[j].f) cnt += s[i].s * 1ll * s[j].s;
		}
	}*/
	paint(V, a[u]);
	if (sz(path[up[u]]) && path[up[u]].back().f == a[u]) {
		path[up[u]][sz(path[up[u]]) - 1].s++;
	}
	else {
		path[up[u]].pb({a[u], 1});
	}
	cout << cnt << nl;
}
int main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
		freopen ("A.out", "w", stdout);
	#endif
	Kazakhstan
	cin >> n;
	rep(i, 1, n) cin >> a[i];
	rep(i, 2, n) {
		cin >> e[i].f >> e[i].s;
		g[e[i].f].pb(e[i].s);
	}
	dfs_sz();
	up[1] = 1;
	dfs();
	
	rep(i, 2, n) {
		calc(e[i].f, e[i].s);
	}
	ioi
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 132 ms 139768 KB Output is correct
2 Correct 132 ms 139768 KB Output is correct
3 Correct 133 ms 139896 KB Output is correct
4 Correct 147 ms 139768 KB Output is correct
5 Correct 145 ms 139768 KB Output is correct
6 Correct 145 ms 139768 KB Output is correct
7 Correct 147 ms 139768 KB Output is correct
8 Correct 162 ms 139896 KB Output is correct
9 Correct 146 ms 139864 KB Output is correct
10 Correct 172 ms 139840 KB Output is correct
11 Correct 133 ms 139836 KB Output is correct
12 Correct 136 ms 139900 KB Output is correct
13 Correct 132 ms 139768 KB Output is correct
14 Correct 136 ms 139812 KB Output is correct
15 Correct 153 ms 139888 KB Output is correct
16 Correct 152 ms 139964 KB Output is correct
17 Correct 152 ms 139868 KB Output is correct
18 Correct 149 ms 139896 KB Output is correct
19 Correct 140 ms 139740 KB Output is correct
20 Correct 132 ms 139808 KB Output is correct
21 Correct 137 ms 139768 KB Output is correct
22 Correct 153 ms 139720 KB Output is correct
23 Correct 163 ms 139968 KB Output is correct
24 Correct 146 ms 139904 KB Output is correct
25 Correct 147 ms 139768 KB Output is correct
26 Correct 151 ms 139776 KB Output is correct
27 Correct 140 ms 139768 KB Output is correct
28 Correct 139 ms 139896 KB Output is correct
29 Correct 139 ms 139692 KB Output is correct
30 Correct 147 ms 139824 KB Output is correct
31 Correct 147 ms 139884 KB Output is correct
32 Correct 135 ms 139912 KB Output is correct
33 Correct 132 ms 139768 KB Output is correct
34 Correct 133 ms 139768 KB Output is correct
35 Correct 131 ms 139768 KB Output is correct
36 Correct 130 ms 139728 KB Output is correct
37 Correct 133 ms 139768 KB Output is correct
38 Correct 130 ms 139740 KB Output is correct
39 Correct 152 ms 139868 KB Output is correct
40 Correct 131 ms 139880 KB Output is correct
41 Correct 151 ms 139720 KB Output is correct
42 Correct 138 ms 139808 KB Output is correct
43 Correct 133 ms 139796 KB Output is correct
44 Correct 131 ms 139744 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 132 ms 139768 KB Output is correct
2 Correct 132 ms 139768 KB Output is correct
3 Correct 133 ms 139896 KB Output is correct
4 Correct 147 ms 139768 KB Output is correct
5 Correct 145 ms 139768 KB Output is correct
6 Correct 145 ms 139768 KB Output is correct
7 Correct 147 ms 139768 KB Output is correct
8 Correct 162 ms 139896 KB Output is correct
9 Correct 146 ms 139864 KB Output is correct
10 Correct 172 ms 139840 KB Output is correct
11 Correct 133 ms 139836 KB Output is correct
12 Correct 136 ms 139900 KB Output is correct
13 Correct 132 ms 139768 KB Output is correct
14 Correct 136 ms 139812 KB Output is correct
15 Correct 153 ms 139888 KB Output is correct
16 Correct 152 ms 139964 KB Output is correct
17 Correct 152 ms 139868 KB Output is correct
18 Correct 149 ms 139896 KB Output is correct
19 Correct 140 ms 139740 KB Output is correct
20 Correct 132 ms 139808 KB Output is correct
21 Correct 137 ms 139768 KB Output is correct
22 Correct 153 ms 139720 KB Output is correct
23 Correct 163 ms 139968 KB Output is correct
24 Correct 146 ms 139904 KB Output is correct
25 Correct 147 ms 139768 KB Output is correct
26 Correct 151 ms 139776 KB Output is correct
27 Correct 140 ms 139768 KB Output is correct
28 Correct 139 ms 139896 KB Output is correct
29 Correct 139 ms 139692 KB Output is correct
30 Correct 147 ms 139824 KB Output is correct
31 Correct 147 ms 139884 KB Output is correct
32 Correct 135 ms 139912 KB Output is correct
33 Correct 132 ms 139768 KB Output is correct
34 Correct 133 ms 139768 KB Output is correct
35 Correct 131 ms 139768 KB Output is correct
36 Correct 130 ms 139728 KB Output is correct
37 Correct 133 ms 139768 KB Output is correct
38 Correct 130 ms 139740 KB Output is correct
39 Correct 152 ms 139868 KB Output is correct
40 Correct 131 ms 139880 KB Output is correct
41 Correct 151 ms 139720 KB Output is correct
42 Correct 138 ms 139808 KB Output is correct
43 Correct 133 ms 139796 KB Output is correct
44 Correct 131 ms 139744 KB Output is correct
45 Correct 147 ms 139768 KB Output is correct
46 Correct 153 ms 140152 KB Output is correct
47 Correct 162 ms 140412 KB Output is correct
48 Correct 156 ms 140236 KB Output is correct
49 Correct 147 ms 140148 KB Output is correct
50 Correct 148 ms 140072 KB Output is correct
51 Correct 141 ms 140168 KB Output is correct
52 Correct 172 ms 140180 KB Output is correct
53 Correct 150 ms 140156 KB Output is correct
54 Correct 147 ms 140124 KB Output is correct
55 Correct 153 ms 140024 KB Output is correct
56 Correct 148 ms 140008 KB Output is correct
57 Correct 158 ms 140396 KB Output is correct
58 Correct 155 ms 140656 KB Output is correct
59 Correct 159 ms 140424 KB Output is correct
60 Correct 152 ms 140556 KB Output is correct
61 Correct 147 ms 139964 KB Output is correct
62 Correct 148 ms 140000 KB Output is correct
63 Correct 151 ms 139992 KB Output is correct
64 Correct 176 ms 140232 KB Output is correct
65 Correct 161 ms 140092 KB Output is correct
66 Correct 149 ms 140188 KB Output is correct
67 Correct 151 ms 140152 KB Output is correct
68 Correct 134 ms 140200 KB Output is correct
69 Correct 149 ms 140096 KB Output is correct
70 Correct 158 ms 140236 KB Output is correct
71 Correct 149 ms 140052 KB Output is correct
72 Correct 156 ms 140528 KB Output is correct
73 Correct 154 ms 140504 KB Output is correct
74 Correct 175 ms 140060 KB Output is correct
75 Correct 148 ms 139996 KB Output is correct
76 Correct 154 ms 139956 KB Output is correct
77 Correct 149 ms 139888 KB Output is correct
78 Correct 175 ms 140044 KB Output is correct
79 Correct 173 ms 139960 KB Output is correct
80 Correct 149 ms 139940 KB Output is correct
81 Correct 148 ms 139896 KB Output is correct
82 Correct 149 ms 140024 KB Output is correct
83 Correct 149 ms 139988 KB Output is correct
84 Correct 149 ms 139956 KB Output is correct
85 Correct 147 ms 140152 KB Output is correct
86 Correct 174 ms 139896 KB Output is correct

Subtask #3
84.0 / 84.0

# Verdict Execution time Memory Grader output
1 Correct 132 ms 139768 KB Output is correct
2 Correct 132 ms 139768 KB Output is correct
3 Correct 133 ms 139896 KB Output is correct
4 Correct 147 ms 139768 KB Output is correct
5 Correct 145 ms 139768 KB Output is correct
6 Correct 145 ms 139768 KB Output is correct
7 Correct 147 ms 139768 KB Output is correct
8 Correct 162 ms 139896 KB Output is correct
9 Correct 146 ms 139864 KB Output is correct
10 Correct 172 ms 139840 KB Output is correct
11 Correct 133 ms 139836 KB Output is correct
12 Correct 136 ms 139900 KB Output is correct
13 Correct 132 ms 139768 KB Output is correct
14 Correct 136 ms 139812 KB Output is correct
15 Correct 153 ms 139888 KB Output is correct
16 Correct 152 ms 139964 KB Output is correct
17 Correct 152 ms 139868 KB Output is correct
18 Correct 149 ms 139896 KB Output is correct
19 Correct 140 ms 139740 KB Output is correct
20 Correct 132 ms 139808 KB Output is correct
21 Correct 137 ms 139768 KB Output is correct
22 Correct 153 ms 139720 KB Output is correct
23 Correct 163 ms 139968 KB Output is correct
24 Correct 146 ms 139904 KB Output is correct
25 Correct 147 ms 139768 KB Output is correct
26 Correct 151 ms 139776 KB Output is correct
27 Correct 140 ms 139768 KB Output is correct
28 Correct 139 ms 139896 KB Output is correct
29 Correct 139 ms 139692 KB Output is correct
30 Correct 147 ms 139824 KB Output is correct
31 Correct 147 ms 139884 KB Output is correct
32 Correct 135 ms 139912 KB Output is correct
33 Correct 132 ms 139768 KB Output is correct
34 Correct 133 ms 139768 KB Output is correct
35 Correct 131 ms 139768 KB Output is correct
36 Correct 130 ms 139728 KB Output is correct
37 Correct 133 ms 139768 KB Output is correct
38 Correct 130 ms 139740 KB Output is correct
39 Correct 152 ms 139868 KB Output is correct
40 Correct 131 ms 139880 KB Output is correct
41 Correct 151 ms 139720 KB Output is correct
42 Correct 138 ms 139808 KB Output is correct
43 Correct 133 ms 139796 KB Output is correct
44 Correct 131 ms 139744 KB Output is correct
45 Correct 147 ms 139768 KB Output is correct
46 Correct 153 ms 140152 KB Output is correct
47 Correct 162 ms 140412 KB Output is correct
48 Correct 156 ms 140236 KB Output is correct
49 Correct 147 ms 140148 KB Output is correct
50 Correct 148 ms 140072 KB Output is correct
51 Correct 141 ms 140168 KB Output is correct
52 Correct 172 ms 140180 KB Output is correct
53 Correct 150 ms 140156 KB Output is correct
54 Correct 147 ms 140124 KB Output is correct
55 Correct 153 ms 140024 KB Output is correct
56 Correct 148 ms 140008 KB Output is correct
57 Correct 158 ms 140396 KB Output is correct
58 Correct 155 ms 140656 KB Output is correct
59 Correct 159 ms 140424 KB Output is correct
60 Correct 152 ms 140556 KB Output is correct
61 Correct 147 ms 139964 KB Output is correct
62 Correct 148 ms 140000 KB Output is correct
63 Correct 151 ms 139992 KB Output is correct
64 Correct 176 ms 140232 KB Output is correct
65 Correct 161 ms 140092 KB Output is correct
66 Correct 149 ms 140188 KB Output is correct
67 Correct 151 ms 140152 KB Output is correct
68 Correct 134 ms 140200 KB Output is correct
69 Correct 149 ms 140096 KB Output is correct
70 Correct 158 ms 140236 KB Output is correct
71 Correct 149 ms 140052 KB Output is correct
72 Correct 156 ms 140528 KB Output is correct
73 Correct 154 ms 140504 KB Output is correct
74 Correct 175 ms 140060 KB Output is correct
75 Correct 148 ms 139996 KB Output is correct
76 Correct 154 ms 139956 KB Output is correct
77 Correct 149 ms 139888 KB Output is correct
78 Correct 175 ms 140044 KB Output is correct
79 Correct 173 ms 139960 KB Output is correct
80 Correct 149 ms 139940 KB Output is correct
81 Correct 148 ms 139896 KB Output is correct
82 Correct 149 ms 140024 KB Output is correct
83 Correct 149 ms 139988 KB Output is correct
84 Correct 149 ms 139956 KB Output is correct
85 Correct 147 ms 140152 KB Output is correct
86 Correct 174 ms 139896 KB Output is correct
87 Correct 163 ms 140724 KB Output is correct
88 Correct 186 ms 142684 KB Output is correct
89 Correct 314 ms 149516 KB Output is correct
90 Correct 311 ms 149464 KB Output is correct
91 Correct 310 ms 149496 KB Output is correct
92 Correct 225 ms 150264 KB Output is correct
93 Correct 219 ms 150136 KB Output is correct
94 Correct 216 ms 150272 KB Output is correct
95 Correct 249 ms 148444 KB Output is correct
96 Correct 234 ms 148412 KB Output is correct
97 Correct 248 ms 148472 KB Output is correct
98 Correct 245 ms 148392 KB Output is correct
99 Correct 212 ms 146936 KB Output is correct
100 Correct 427 ms 153872 KB Output is correct
101 Correct 408 ms 153812 KB Output is correct
102 Correct 423 ms 153796 KB Output is correct
103 Correct 412 ms 153696 KB Output is correct
104 Correct 245 ms 146936 KB Output is correct
105 Correct 224 ms 147064 KB Output is correct
106 Correct 241 ms 147192 KB Output is correct
107 Correct 294 ms 149368 KB Output is correct
108 Correct 320 ms 149468 KB Output is correct
109 Correct 311 ms 149464 KB Output is correct
110 Correct 209 ms 150200 KB Output is correct
111 Correct 230 ms 148344 KB Output is correct
112 Correct 238 ms 148348 KB Output is correct
113 Correct 253 ms 147012 KB Output is correct
114 Correct 423 ms 153728 KB Output is correct
115 Correct 421 ms 153816 KB Output is correct
116 Correct 240 ms 146992 KB Output is correct
117 Correct 232 ms 145956 KB Output is correct
118 Correct 221 ms 145656 KB Output is correct
119 Correct 236 ms 145400 KB Output is correct
120 Correct 240 ms 145828 KB Output is correct
121 Correct 237 ms 145564 KB Output is correct
122 Correct 230 ms 145272 KB Output is correct
123 Correct 246 ms 145828 KB Output is correct
124 Correct 242 ms 145448 KB Output is correct
125 Correct 248 ms 145400 KB Output is correct
126 Correct 240 ms 146040 KB Output is correct
127 Correct 217 ms 145628 KB Output is correct
128 Correct 237 ms 145400 KB Output is correct