oj.uz

Submission #113960

# Submission time Handle Problem Language Result Execution time Memory
113960 2019-05-29T10:18:23 Z RockyB Construction of Highway (JOI18_construction) C++17
100 / 100
 443 ms 154044 KB 
/// In The Name Of God

#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 127 ms 139640 KB Output is correct
2 Correct 125 ms 139768 KB Output is correct
3 Correct 130 ms 139788 KB Output is correct
4 Correct 150 ms 139752 KB Output is correct
5 Correct 183 ms 139824 KB Output is correct
6 Correct 150 ms 139880 KB Output is correct
7 Correct 161 ms 139868 KB Output is correct
8 Correct 148 ms 139768 KB Output is correct
9 Correct 146 ms 139812 KB Output is correct
10 Correct 142 ms 139768 KB Output is correct
11 Correct 131 ms 139896 KB Output is correct
12 Correct 132 ms 139860 KB Output is correct
13 Correct 149 ms 139856 KB Output is correct
14 Correct 130 ms 139736 KB Output is correct
15 Correct 150 ms 139872 KB Output is correct
16 Correct 154 ms 139868 KB Output is correct
17 Correct 149 ms 139896 KB Output is correct
18 Correct 148 ms 139872 KB Output is correct
19 Correct 131 ms 139716 KB Output is correct
20 Correct 135 ms 139760 KB Output is correct
21 Correct 125 ms 139768 KB Output is correct
22 Correct 159 ms 139768 KB Output is correct
23 Correct 144 ms 139768 KB Output is correct
24 Correct 160 ms 140024 KB Output is correct
25 Correct 141 ms 139768 KB Output is correct
26 Correct 142 ms 139824 KB Output is correct
27 Correct 144 ms 139836 KB Output is correct
28 Correct 142 ms 139776 KB Output is correct
29 Correct 130 ms 139712 KB Output is correct
30 Correct 139 ms 139768 KB Output is correct
31 Correct 154 ms 139840 KB Output is correct
32 Correct 131 ms 139928 KB Output is correct
33 Correct 136 ms 139768 KB Output is correct
34 Correct 138 ms 139768 KB Output is correct
35 Correct 125 ms 139724 KB Output is correct
36 Correct 133 ms 139956 KB Output is correct
37 Correct 126 ms 139768 KB Output is correct
38 Correct 126 ms 139768 KB Output is correct
39 Correct 126 ms 139888 KB Output is correct
40 Correct 135 ms 139768 KB Output is correct
41 Correct 134 ms 139748 KB Output is correct
42 Correct 131 ms 139768 KB Output is correct
43 Correct 128 ms 139840 KB Output is correct
44 Correct 125 ms 139740 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 139640 KB Output is correct
2 Correct 125 ms 139768 KB Output is correct
3 Correct 130 ms 139788 KB Output is correct
4 Correct 150 ms 139752 KB Output is correct
5 Correct 183 ms 139824 KB Output is correct
6 Correct 150 ms 139880 KB Output is correct
7 Correct 161 ms 139868 KB Output is correct
8 Correct 148 ms 139768 KB Output is correct
9 Correct 146 ms 139812 KB Output is correct
10 Correct 142 ms 139768 KB Output is correct
11 Correct 131 ms 139896 KB Output is correct
12 Correct 132 ms 139860 KB Output is correct
13 Correct 149 ms 139856 KB Output is correct
14 Correct 130 ms 139736 KB Output is correct
15 Correct 150 ms 139872 KB Output is correct
16 Correct 154 ms 139868 KB Output is correct
17 Correct 149 ms 139896 KB Output is correct
18 Correct 148 ms 139872 KB Output is correct
19 Correct 131 ms 139716 KB Output is correct
20 Correct 135 ms 139760 KB Output is correct
21 Correct 125 ms 139768 KB Output is correct
22 Correct 159 ms 139768 KB Output is correct
23 Correct 144 ms 139768 KB Output is correct
24 Correct 160 ms 140024 KB Output is correct
25 Correct 141 ms 139768 KB Output is correct
26 Correct 142 ms 139824 KB Output is correct
27 Correct 144 ms 139836 KB Output is correct
28 Correct 142 ms 139776 KB Output is correct
29 Correct 130 ms 139712 KB Output is correct
30 Correct 139 ms 139768 KB Output is correct
31 Correct 154 ms 139840 KB Output is correct
32 Correct 131 ms 139928 KB Output is correct
33 Correct 136 ms 139768 KB Output is correct
34 Correct 138 ms 139768 KB Output is correct
35 Correct 125 ms 139724 KB Output is correct
36 Correct 133 ms 139956 KB Output is correct
37 Correct 126 ms 139768 KB Output is correct
38 Correct 126 ms 139768 KB Output is correct
39 Correct 126 ms 139888 KB Output is correct
40 Correct 135 ms 139768 KB Output is correct
41 Correct 134 ms 139748 KB Output is correct
42 Correct 131 ms 139768 KB Output is correct
43 Correct 128 ms 139840 KB Output is correct
44 Correct 125 ms 139740 KB Output is correct
45 Correct 144 ms 139924 KB Output is correct
46 Correct 174 ms 140252 KB Output is correct
47 Correct 147 ms 140244 KB Output is correct
48 Correct 150 ms 140100 KB Output is correct
49 Correct 134 ms 140140 KB Output is correct
50 Correct 131 ms 140104 KB Output is correct
51 Correct 149 ms 140280 KB Output is correct
52 Correct 146 ms 140068 KB Output is correct
53 Correct 178 ms 140060 KB Output is correct
54 Correct 150 ms 140112 KB Output is correct
55 Correct 150 ms 140024 KB Output is correct
56 Correct 154 ms 140024 KB Output is correct
57 Correct 152 ms 140344 KB Output is correct
58 Correct 186 ms 140408 KB Output is correct
59 Correct 153 ms 140392 KB Output is correct
60 Correct 153 ms 140656 KB Output is correct
61 Correct 144 ms 140024 KB Output is correct
62 Correct 144 ms 140024 KB Output is correct
63 Correct 135 ms 140024 KB Output is correct
64 Correct 147 ms 140124 KB Output is correct
65 Correct 153 ms 140152 KB Output is correct
66 Correct 165 ms 140108 KB Output is correct
67 Correct 156 ms 140296 KB Output is correct
68 Correct 164 ms 140116 KB Output is correct
69 Correct 149 ms 140208 KB Output is correct
70 Correct 235 ms 140112 KB Output is correct
71 Correct 176 ms 140068 KB Output is correct
72 Correct 149 ms 140400 KB Output is correct
73 Correct 149 ms 140400 KB Output is correct
74 Correct 146 ms 140036 KB Output is correct
75 Correct 151 ms 140012 KB Output is correct
76 Correct 179 ms 139896 KB Output is correct
77 Correct 148 ms 139992 KB Output is correct
78 Correct 152 ms 139896 KB Output is correct
79 Correct 155 ms 139896 KB Output is correct
80 Correct 147 ms 139960 KB Output is correct
81 Correct 146 ms 140008 KB Output is correct
82 Correct 145 ms 140000 KB Output is correct
83 Correct 151 ms 139980 KB Output is correct
84 Correct 151 ms 139988 KB Output is correct
85 Correct 165 ms 139896 KB Output is correct
86 Correct 152 ms 139896 KB Output is correct

Subtask #3
84.0 / 84.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 139640 KB Output is correct
2 Correct 125 ms 139768 KB Output is correct
3 Correct 130 ms 139788 KB Output is correct
4 Correct 150 ms 139752 KB Output is correct
5 Correct 183 ms 139824 KB Output is correct
6 Correct 150 ms 139880 KB Output is correct
7 Correct 161 ms 139868 KB Output is correct
8 Correct 148 ms 139768 KB Output is correct
9 Correct 146 ms 139812 KB Output is correct
10 Correct 142 ms 139768 KB Output is correct
11 Correct 131 ms 139896 KB Output is correct
12 Correct 132 ms 139860 KB Output is correct
13 Correct 149 ms 139856 KB Output is correct
14 Correct 130 ms 139736 KB Output is correct
15 Correct 150 ms 139872 KB Output is correct
16 Correct 154 ms 139868 KB Output is correct
17 Correct 149 ms 139896 KB Output is correct
18 Correct 148 ms 139872 KB Output is correct
19 Correct 131 ms 139716 KB Output is correct
20 Correct 135 ms 139760 KB Output is correct
21 Correct 125 ms 139768 KB Output is correct
22 Correct 159 ms 139768 KB Output is correct
23 Correct 144 ms 139768 KB Output is correct
24 Correct 160 ms 140024 KB Output is correct
25 Correct 141 ms 139768 KB Output is correct
26 Correct 142 ms 139824 KB Output is correct
27 Correct 144 ms 139836 KB Output is correct
28 Correct 142 ms 139776 KB Output is correct
29 Correct 130 ms 139712 KB Output is correct
30 Correct 139 ms 139768 KB Output is correct
31 Correct 154 ms 139840 KB Output is correct
32 Correct 131 ms 139928 KB Output is correct
33 Correct 136 ms 139768 KB Output is correct
34 Correct 138 ms 139768 KB Output is correct
35 Correct 125 ms 139724 KB Output is correct
36 Correct 133 ms 139956 KB Output is correct
37 Correct 126 ms 139768 KB Output is correct
38 Correct 126 ms 139768 KB Output is correct
39 Correct 126 ms 139888 KB Output is correct
40 Correct 135 ms 139768 KB Output is correct
41 Correct 134 ms 139748 KB Output is correct
42 Correct 131 ms 139768 KB Output is correct
43 Correct 128 ms 139840 KB Output is correct
44 Correct 125 ms 139740 KB Output is correct
45 Correct 144 ms 139924 KB Output is correct
46 Correct 174 ms 140252 KB Output is correct
47 Correct 147 ms 140244 KB Output is correct
48 Correct 150 ms 140100 KB Output is correct
49 Correct 134 ms 140140 KB Output is correct
50 Correct 131 ms 140104 KB Output is correct
51 Correct 149 ms 140280 KB Output is correct
52 Correct 146 ms 140068 KB Output is correct
53 Correct 178 ms 140060 KB Output is correct
54 Correct 150 ms 140112 KB Output is correct
55 Correct 150 ms 140024 KB Output is correct
56 Correct 154 ms 140024 KB Output is correct
57 Correct 152 ms 140344 KB Output is correct
58 Correct 186 ms 140408 KB Output is correct
59 Correct 153 ms 140392 KB Output is correct
60 Correct 153 ms 140656 KB Output is correct
61 Correct 144 ms 140024 KB Output is correct
62 Correct 144 ms 140024 KB Output is correct
63 Correct 135 ms 140024 KB Output is correct
64 Correct 147 ms 140124 KB Output is correct
65 Correct 153 ms 140152 KB Output is correct
66 Correct 165 ms 140108 KB Output is correct
67 Correct 156 ms 140296 KB Output is correct
68 Correct 164 ms 140116 KB Output is correct
69 Correct 149 ms 140208 KB Output is correct
70 Correct 235 ms 140112 KB Output is correct
71 Correct 176 ms 140068 KB Output is correct
72 Correct 149 ms 140400 KB Output is correct
73 Correct 149 ms 140400 KB Output is correct
74 Correct 146 ms 140036 KB Output is correct
75 Correct 151 ms 140012 KB Output is correct
76 Correct 179 ms 139896 KB Output is correct
77 Correct 148 ms 139992 KB Output is correct
78 Correct 152 ms 139896 KB Output is correct
79 Correct 155 ms 139896 KB Output is correct
80 Correct 147 ms 139960 KB Output is correct
81 Correct 146 ms 140008 KB Output is correct
82 Correct 145 ms 140000 KB Output is correct
83 Correct 151 ms 139980 KB Output is correct
84 Correct 151 ms 139988 KB Output is correct
85 Correct 165 ms 139896 KB Output is correct
86 Correct 152 ms 139896 KB Output is correct
87 Correct 158 ms 140664 KB Output is correct
88 Correct 190 ms 142664 KB Output is correct
89 Correct 327 ms 149552 KB Output is correct
90 Correct 296 ms 149532 KB Output is correct
91 Correct 296 ms 149496 KB Output is correct
92 Correct 205 ms 149880 KB Output is correct
93 Correct 210 ms 149880 KB Output is correct
94 Correct 208 ms 149932 KB Output is correct
95 Correct 244 ms 148404 KB Output is correct
96 Correct 246 ms 148292 KB Output is correct
97 Correct 245 ms 148292 KB Output is correct
98 Correct 248 ms 148376 KB Output is correct
99 Correct 223 ms 146808 KB Output is correct
100 Correct 360 ms 153816 KB Output is correct
101 Correct 414 ms 153696 KB Output is correct
102 Correct 409 ms 153708 KB Output is correct
103 Correct 443 ms 153684 KB Output is correct
104 Correct 248 ms 146796 KB Output is correct
105 Correct 238 ms 146936 KB Output is correct
106 Correct 243 ms 146808 KB Output is correct
107 Correct 314 ms 149368 KB Output is correct
108 Correct 336 ms 149368 KB Output is correct
109 Correct 353 ms 149516 KB Output is correct
110 Correct 211 ms 149880 KB Output is correct
111 Correct 235 ms 148296 KB Output is correct
112 Correct 248 ms 148332 KB Output is correct
113 Correct 219 ms 146808 KB Output is correct
114 Correct 383 ms 154044 KB Output is correct
115 Correct 436 ms 153952 KB Output is correct
116 Correct 232 ms 146876 KB Output is correct
117 Correct 240 ms 145784 KB Output is correct
118 Correct 223 ms 145404 KB Output is correct
119 Correct 225 ms 145400 KB Output is correct
120 Correct 227 ms 145656 KB Output is correct
121 Correct 237 ms 145528 KB Output is correct
122 Correct 240 ms 145272 KB Output is correct
123 Correct 245 ms 145784 KB Output is correct
124 Correct 243 ms 145736 KB Output is correct
125 Correct 228 ms 145496 KB Output is correct
126 Correct 220 ms 145784 KB Output is correct
127 Correct 219 ms 145628 KB Output is correct
128 Correct 221 ms 145372 KB Output is correct