oj.uz

Submission #1119575

# Submission time Handle Problem Language Result Execution time Memory
1119575 2024-11-27T06:53:22 Z vjudge1 Min-max tree (BOI18_minmaxtree) C++17
58 / 100
 1000 ms 49228 KB 
#include <bits/stdc++.h>
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define f first
#define s second

using namespace std;
using ll = long long;
using pii = pair <int, int>;
const int N = 2e5 + 5, inf = 1e9;

int n, sz[N], d[N], ind[N], par[N], ct, tp[N], l[N], r[N], node[N];
vector <int> g[N], gg[N], add[N][2], del[N][2];
char C[N];
int U[N], V[N], Z[N], used[N], timer, Mt[N];

void calc(int v, int p = 0) {
	sz[v] = 1;
	par[v] = p;
	for (auto to : g[v]) {
		if (to != p) {
			d[to] = d[v] + 1;
			calc(to, v);
			sz[v] += sz[to];
		}
	}
}
void dfs(int v, int p = 0, int top = 1) {
	ind[v] = ++ct;
	node[ind[v]] = v;
	tp[v] = top;
	int mx = 0, bg = -1;
	for (auto to : g[v]) {
		if (to != p && mx < sz[to]) 
			mx = sz[to], bg = to;
	}
	if (bg != -1)
		dfs(bg, v, top);
	for (auto to : g[v]) {
		if (to != p && to != bg)
			dfs(to, v, to);
	}
}

bool kuhn(int v) {
	if (used[v] == timer)
		return 0;
	used[v] = timer;
	for (auto to : gg[v]) {
		if (Mt[to] == -1) {
			Mt[to] = v;
			return 1;
		}
	}
	for (auto to : gg[v]) {
		if (kuhn(Mt[to])) {
			Mt[to] = v;
			return 1;
		}
	}
	return 0;
}

int main() {
	ios :: sync_with_stdio(0);
	cin.tie(0);
	cin >> n;
	for (int i = 1, u, v; i < n; ++i) {
		cin >> u >> v;
		g[u].pb(v);
		g[v].pb(u);
	}
	calc(1);
	dfs(1);
	int q;
	cin >> q;
	bool lol = 0;
	for (int i = 0; i < q; ++i) {
		char c;
		int u, v, z;
		cin >> c >> u >> v >> z;
		lol |= (c == 'm');
		C[i] = c;
		U[i] = u;
		V[i] = v;
		Z[i] = z;
		
		int mn = inf;
		vector <pii> seg;
		while (tp[u] != tp[v]) {
			if (d[tp[u]] < d[tp[v]]) swap(u, v);
			seg.pb({ind[tp[u]], ind[u]});
			mn = min(mn, seg.back().f);
			u = par[tp[u]];
		}
		if (d[u] > d[v]) swap(u, v);
		seg.pb({ind[u], ind[v]});
		mn = min(mn, seg.back().f);
		
		for (auto [l, r] : seg) {
			if (l == mn)
				++l;
			add[l][(c == 'm')].pb(z);
			del[r + 1][(c == 'm')].pb(z);
		}
	}
	multiset <int> mt[2];
	for (int i = 1; i <= n; ++i) {
		for (int j = 0; j < 2; ++j) {
			for (auto z : add[i][j])
				mt[j].insert(z);
			for (auto z : del[i][j])
				mt[j].erase(mt[j].find(z));
		}
		r[i] = inf;
		if (sz(mt[0]))
			r[i] = *mt[0].begin();
		if (sz(mt[1]))
			l[i] = *mt[1].rbegin();
	}
	if (!lol) {
		for (int i = 1; i <= n; ++i) {
			if (par[i])
				cout << i << ' ' << par[i] << ' ' << r[ind[i]] << '\n';
		}
		return 0;
	}
	for (int i = 0; i < q; ++i) {
		char c;
		int u, v, z;
		c = C[i];
		u = U[i];
		v = V[i];
		z = Z[i];
		
		int mn = inf;
		vector <pii> seg;
		while (tp[u] != tp[v]) {
			if (d[tp[u]] < d[tp[v]]) swap(u, v);
			seg.pb({ind[tp[u]], ind[u]});
			mn = min(mn, seg.back().f);
			u = par[tp[u]];
		}
		if (d[u] > d[v]) swap(u, v);
		seg.pb({ind[u], ind[v]});
		mn = min(mn, seg.back().f);
		
		for (auto [x, y] : seg) {
			if (x == mn)
				++x;
			
			for (int j = x; j <= y; ++j) {
				if (c == 'm' && l[j] == z) {
					gg[i].pb(j + q);
				}
				if (c == 'M' && r[j] == z) {
					gg[i].pb(j + q);
				}
			}
		}
	}
	for (int i = 1; i <= n; ++i)
		Mt[i + q] = -1;
	for (int i = 0; i < q; ++i) {
		++timer;
		kuhn(i);
	}
	for (int i = 1; i <= n; ++i) {
		if (!par[i])
			continue;
		if (Mt[ind[i] + q] == -1)
			cout << i << ' ' << par[i] << ' ' << l[ind[i]] << '\n';
		else
			cout << i << ' ' << par[i] << ' ' << Z[Mt[ind[i] + q]] << '\n';
	}
	return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 28496 KB Output is correct
2 Correct 21 ms 28496 KB Output is correct
3 Correct 25 ms 28512 KB Output is correct
4 Correct 22 ms 28496 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 145 ms 42812 KB Output is correct
2 Correct 167 ms 41320 KB Output is correct
3 Correct 148 ms 42948 KB Output is correct
4 Correct 116 ms 42512 KB Output is correct
5 Correct 164 ms 41872 KB Output is correct
6 Correct 133 ms 42060 KB Output is correct
7 Correct 129 ms 41544 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 40524 KB Output is correct
2 Correct 88 ms 40448 KB Output is correct
3 Correct 92 ms 40956 KB Output is correct
4 Correct 81 ms 42316 KB Output is correct
5 Correct 93 ms 40280 KB Output is correct
6 Correct 101 ms 41116 KB Output is correct
7 Correct 100 ms 40268 KB Output is correct
8 Correct 89 ms 40120 KB Output is correct

Subtask #4
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 28496 KB Output is correct
2 Correct 21 ms 28496 KB Output is correct
3 Correct 25 ms 28512 KB Output is correct
4 Correct 22 ms 28496 KB Output is correct
5 Correct 145 ms 42812 KB Output is correct
6 Correct 167 ms 41320 KB Output is correct
7 Correct 148 ms 42948 KB Output is correct
8 Correct 116 ms 42512 KB Output is correct
9 Correct 164 ms 41872 KB Output is correct
10 Correct 133 ms 42060 KB Output is correct
11 Correct 129 ms 41544 KB Output is correct
12 Correct 92 ms 40524 KB Output is correct
13 Correct 88 ms 40448 KB Output is correct
14 Correct 92 ms 40956 KB Output is correct
15 Correct 81 ms 42316 KB Output is correct
16 Correct 93 ms 40280 KB Output is correct
17 Correct 101 ms 41116 KB Output is correct
18 Correct 100 ms 40268 KB Output is correct
19 Correct 89 ms 40120 KB Output is correct
20 Correct 190 ms 47912 KB Output is correct
21 Correct 190 ms 46156 KB Output is correct
22 Correct 229 ms 46148 KB Output is correct
23 Correct 196 ms 45900 KB Output is correct
24 Correct 142 ms 47436 KB Output is correct
25 Correct 561 ms 49228 KB Output is correct
26 Execution timed out 1040 ms 45388 KB Time limit exceeded
27 Halted 0 ms 0 KB -