oj.uz

Submission #791645

# Submission time Handle Problem Language Result Execution time Memory
791645 2023-07-24T08:29:47 Z GEN 이지후(#10078) Nestabilnost (COI23_nestabilnost) C++17
61 / 100
 1500 ms 96588 KB 
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pi = array<lint, 2>;
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
const int MAXN = 300005;

int a[MAXN], f[MAXN], sm[MAXN], par[MAXN];
int root[MAXN];
vector<int> gph[MAXN];

void dfs(int x, int p) {
	if (p == -1)
		root[x] = 1, par[x] = -1;
	for (auto &y : gph[x]) {
		if (y != p) {
			if (a[y] <= a[x] && a[y] > 0)
				root[y] = 1;
			if (a[y] > a[x] + 1)
				root[y] = 1;
			par[y] = x;
			dfs(y, x);
		}
	}
}

struct node {
	int val;
	int canGeq;
	lint cost;
	lint eval() { return cost + (canGeq ? sm[val] : f[val]); }
	bool operator<(const node &nd) const { return make_pair(canGeq, val) < make_pair(nd.canGeq, nd.val); }
};

vector<node> solve(int x, int p) {
	vector<vector<node>> aggr;
	for (auto &y : gph[x]) {
		if (y != p && !root[y]) {
			auto v = solve(y, x);
			if (a[x] + 1 == a[y]) {
				lint totmin = 1e18;
				for (auto &x : v)
					totmin = min(totmin, x.eval());
				v.push_back({0, 1, totmin});
			} else {
				lint costEq = 1e18;
				lint totmin = 1e18;
				for (auto &foo : v) {
					if (foo.val == a[x] + 1 || (foo.val <= a[x] + 1 && foo.canGeq)) {
						costEq = min(costEq, foo.cost);
					}
					totmin = min(totmin, foo.eval());
				}
				v.clear();
				v.push_back({0, 1, totmin});
				v.push_back({a[x] + 1, 0, costEq});
				// k = a[x] + 1 or k >= 0
			}
			aggr.push_back(v);
		}
	}
	if (sz(aggr) == 0) {
		vector<node> ret;
		ret.push_back({a[x] + 1, 1, 0});
		return ret;
	}
	vector<node> ret;
	// generate eqs
	{
		vector<int> coords;
		for (auto &v : aggr) {
			for (auto &y : v) {
				if (y.canGeq == 0 && y.val > a[x])
					coords.push_back(y.val);
			}
		}
		sort(all(coords));
		coords.resize(unique(all(coords)) - coords.begin());
		for (auto &x : coords) {
			lint tot = 0;
			for (auto &v : aggr) {
				lint minv = 1e18;
				for (auto &j : v) {
					if (j.canGeq && j.val <= x)
						minv = min(minv, j.cost);
					if (!j.canGeq && j.val == x)
						minv = min(minv, j.cost);
				}
				tot += minv;
				if (tot > 1e18)
					tot = 1e18;
			}
			if (tot < 1e17)
				ret.push_back({x, 0, tot});
		}
	}
	// generate geqs
	{
		vector<lint> costPoses(sz(aggr), 1e18);
		vector<array<lint, 3>> upd;
		for (int i = 0; i < sz(aggr); i++) {
			for (auto &y : aggr[i]) {
				if (y.canGeq) {
					upd.push_back({max(y.val, a[x] + 1), y.cost, i});
				}
			}
		}
		int toolarge = sz(aggr);
		sort(all(upd));
		lint t1 = 1e17;
		lint sum = 0;
		for (int i = 0; i < sz(upd);) {
			int j = i;
			while (j < sz(upd) && upd[j][0] == upd[i][0])
				j++;
			for (int k = i; k < j; k++) {
				if (costPoses[upd[k][2]] > 5e17) {
					toolarge--;
					sum += upd[k][1];
				} else {
					if (costPoses[upd[k][2]] > upd[k][1]) {
						sum += upd[k][1] - costPoses[upd[k][2]];
					}
				}
				costPoses[upd[k][2]] = min(costPoses[upd[k][2]], upd[k][1]);
			}
			if (toolarge) {
				i = j;
				continue;
			}
			if (t1 > sum) {
				t1 = sum;
				ret.push_back({(int)upd[i][0], 1, t1});
			}
			i = j;
		}
	}
	return ret;
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n;
	cin >> n;
	for (int i = 0; i < n; i++)
		cin >> a[i];
	for (int i = 1; i <= n; i++) {
		cin >> f[i];
	}
	sm[n + 1] = 1e9;
	for (int i = n; i; i--) {
		sm[i] = min(sm[i + 1], f[i]);
	}
	for (int i = 0; i < n - 1; i++) {
		int u, v;
		cin >> u >> v;
		u--;
		v--;
		gph[u].push_back(v);
		gph[v].push_back(u);
	}
	dfs(0, -1);
	lint ans = 0;
	for (int i = 0; i < n; i++) {
		if (root[i]) {
			auto foo = solve(i, par[i]);
			lint tot = 1e18;
			for (auto &x : foo)
				tot = min(tot, x.eval());
			ans += tot;
		}
	}
	cout << ans << "\n";
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8788 KB Output is correct
2 Correct 6 ms 8788 KB Output is correct
3 Correct 6 ms 8788 KB Output is correct
4 Correct 7 ms 8788 KB Output is correct
5 Correct 6 ms 7892 KB Output is correct
6 Correct 6 ms 7968 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 182 ms 96572 KB Output is correct
2 Correct 209 ms 96584 KB Output is correct
3 Correct 229 ms 96588 KB Output is correct
4 Correct 278 ms 96588 KB Output is correct
5 Correct 197 ms 96588 KB Output is correct
6 Correct 177 ms 40340 KB Output is correct
7 Correct 174 ms 40524 KB Output is correct
8 Correct 178 ms 41384 KB Output is correct
9 Correct 195 ms 41396 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 3 ms 7380 KB Output is correct
4 Correct 5 ms 7380 KB Output is correct
5 Correct 3 ms 7380 KB Output is correct
6 Correct 3 ms 7380 KB Output is correct
7 Correct 3 ms 7380 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8788 KB Output is correct
2 Correct 6 ms 8788 KB Output is correct
3 Correct 6 ms 8788 KB Output is correct
4 Correct 7 ms 8788 KB Output is correct
5 Correct 6 ms 7892 KB Output is correct
6 Correct 6 ms 7968 KB Output is correct
7 Correct 3 ms 7380 KB Output is correct
8 Correct 4 ms 7380 KB Output is correct
9 Correct 3 ms 7380 KB Output is correct
10 Correct 5 ms 7380 KB Output is correct
11 Correct 3 ms 7380 KB Output is correct
12 Correct 3 ms 7380 KB Output is correct
13 Correct 3 ms 7380 KB Output is correct
14 Correct 7 ms 7636 KB Output is correct
15 Correct 6 ms 7636 KB Output is correct
16 Correct 7 ms 7636 KB Output is correct
17 Correct 9 ms 7636 KB Output is correct
18 Correct 6 ms 7636 KB Output is correct
19 Correct 6 ms 7636 KB Output is correct
20 Correct 5 ms 7636 KB Output is correct
21 Correct 5 ms 7636 KB Output is correct
22 Correct 6 ms 7636 KB Output is correct
23 Correct 5 ms 7636 KB Output is correct
24 Correct 95 ms 8004 KB Output is correct
25 Correct 126 ms 7880 KB Output is correct
26 Correct 207 ms 7932 KB Output is correct
27 Correct 353 ms 7980 KB Output is correct

Subtask #5
0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8788 KB Output is correct
2 Correct 6 ms 8788 KB Output is correct
3 Correct 6 ms 8788 KB Output is correct
4 Correct 7 ms 8788 KB Output is correct
5 Correct 6 ms 7892 KB Output is correct
6 Correct 6 ms 7968 KB Output is correct
7 Correct 182 ms 96572 KB Output is correct
8 Correct 209 ms 96584 KB Output is correct
9 Correct 229 ms 96588 KB Output is correct
10 Correct 278 ms 96588 KB Output is correct
11 Correct 197 ms 96588 KB Output is correct
12 Correct 177 ms 40340 KB Output is correct
13 Correct 174 ms 40524 KB Output is correct
14 Correct 178 ms 41384 KB Output is correct
15 Correct 195 ms 41396 KB Output is correct
16 Correct 3 ms 7380 KB Output is correct
17 Correct 4 ms 7380 KB Output is correct
18 Correct 3 ms 7380 KB Output is correct
19 Correct 5 ms 7380 KB Output is correct
20 Correct 3 ms 7380 KB Output is correct
21 Correct 3 ms 7380 KB Output is correct
22 Correct 3 ms 7380 KB Output is correct
23 Correct 7 ms 7636 KB Output is correct
24 Correct 6 ms 7636 KB Output is correct
25 Correct 7 ms 7636 KB Output is correct
26 Correct 9 ms 7636 KB Output is correct
27 Correct 6 ms 7636 KB Output is correct
28 Correct 6 ms 7636 KB Output is correct
29 Correct 5 ms 7636 KB Output is correct
30 Correct 5 ms 7636 KB Output is correct
31 Correct 6 ms 7636 KB Output is correct
32 Correct 5 ms 7636 KB Output is correct
33 Correct 95 ms 8004 KB Output is correct
34 Correct 126 ms 7880 KB Output is correct
35 Correct 207 ms 7932 KB Output is correct
36 Correct 353 ms 7980 KB Output is correct
37 Correct 294 ms 21680 KB Output is correct
38 Correct 263 ms 21708 KB Output is correct
39 Correct 280 ms 21696 KB Output is correct
40 Correct 318 ms 21772 KB Output is correct
41 Correct 291 ms 21920 KB Output is correct
42 Correct 330 ms 21852 KB Output is correct
43 Correct 260 ms 22284 KB Output is correct
44 Correct 305 ms 23796 KB Output is correct
45 Correct 361 ms 27656 KB Output is correct
46 Correct 254 ms 22636 KB Output is correct
47 Correct 276 ms 22860 KB Output is correct
48 Correct 205 ms 22856 KB Output is correct
49 Correct 277 ms 22928 KB Output is correct
50 Execution timed out 1566 ms 33636 KB Time limit exceeded
51 Halted 0 ms 0 KB -