oj.uz

Submission #481425

# Submission time Handle Problem Language Result Execution time Memory
481425 2021-10-20T18:47:42 Z rainboy Putovanje (COCI20_putovanje) C
110 / 110
 70 ms 16004 KB 
#include <stdio.h>
#include <stdlib.h>

#define N	200000

long long min(long long a, long long b) { return a < b ? a : b; }

int ij[N - 1], aa[N - 1], bb[N - 1];
int *eh[N], eo[N];

void append(int i, int j) {
	int o = eo[i]++;

	if (o >= 2 && (o & o - 1) == 0)
		eh[i] = (int *) realloc(eh[i], o * 2 * sizeof *eh[i]);
	eh[i][o] = j;
}

int pp[N], qq[N], dd[N];

int dfs1(int p, int i, int d) {
	int o, j_, s, k_;

	pp[i] = p, dd[i] = d;
	s = 1, k_ = 0, j_ = -1;
	for (o = eo[i]; o--; ) {
		int h = eh[i][o], j = i ^ ij[h];

		if (j != p) {
			int k = dfs1(i, j, d + 1);

			if (k_ < k)
				k_ = k, j_ = j;
			s += k;
		}
	}
	qq[i] = j_;
	return s;
}

void dfs2(int p, int i, int q) {
	int o, j_;

	j_ = qq[i], qq[i] = q;
	for (o = eo[i]; o--; ) {
		int h = eh[i][o], j = i ^ ij[h];

		if (j != p) {
			dfs2(i, j, j == j_ ? q : j);
		}
	}
}

int lca(int i, int j) {
	while (qq[i] != qq[j])
		if (dd[qq[i]] > dd[qq[j]])
			i = pp[qq[i]];
		else
			j = pp[qq[j]];
	return dd[i] < dd[j] ? i : j;
}

int kk[N]; long long ans;

void dfs3(int p, int i) {
	int o;

	for (o = eo[i]; o--; ) {
		int h = eh[i][o], j = i ^ ij[h];

		if (j != p) {
			dfs3(i, j);
			ans += min((long long) aa[h] * kk[j], bb[h]);
			kk[i] += kk[j];
		}
	}
}

int main() {
	int n, h, i, j;

	scanf("%d", &n);
	for (i = 0; i < n; i++)
		eh[i] = (int *) malloc(2 * sizeof *eh[i]);
	for (h = 0; h < n - 1; h++) {
		scanf("%d%d%d%d", &i, &j, &aa[h], &bb[h]), i--, j--;
		ij[h] = i ^ j;
		append(i, h), append(j, h);
	}
	dfs1(-1, 0, 0);
	dfs2(-1, 0, 0);
	for (i = 0; i + 1 < n; i++)
		kk[i]++, kk[i + 1]++, kk[lca(i, i + 1)] -= 2;
	dfs3(-1, 0);
	printf("%lld\n", ans);
	return 0;
}

Compilation message

putovanje.c: In function 'append':
putovanje.c:14:23: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   14 |  if (o >= 2 && (o & o - 1) == 0)
      |                     ~~^~~
putovanje.c: In function 'main':
putovanje.c:82:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   82 |  scanf("%d", &n);
      |  ^~~~~~~~~~~~~~~
putovanje.c:86:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   86 |   scanf("%d%d%d%d", &i, &j, &aa[h], &bb[h]), i--, j--;
      |   ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 400 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 460 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 11696 KB Output is correct
2 Correct 56 ms 13104 KB Output is correct
3 Correct 70 ms 14724 KB Output is correct
4 Correct 69 ms 16004 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 57 ms 13072 KB Output is correct
7 Correct 34 ms 10068 KB Output is correct
8 Correct 57 ms 13252 KB Output is correct
9 Correct 42 ms 13744 KB Output is correct
10 Correct 40 ms 13160 KB Output is correct
11 Correct 45 ms 14256 KB Output is correct
12 Correct 49 ms 14616 KB Output is correct

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 400 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 60 ms 11696 KB Output is correct
11 Correct 56 ms 13104 KB Output is correct
12 Correct 70 ms 14724 KB Output is correct
13 Correct 69 ms 16004 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 57 ms 13072 KB Output is correct
16 Correct 34 ms 10068 KB Output is correct
17 Correct 57 ms 13252 KB Output is correct
18 Correct 42 ms 13744 KB Output is correct
19 Correct 40 ms 13160 KB Output is correct
20 Correct 45 ms 14256 KB Output is correct
21 Correct 49 ms 14616 KB Output is correct
22 Correct 68 ms 9488 KB Output is correct
23 Correct 61 ms 8280 KB Output is correct
24 Correct 68 ms 9156 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 28 ms 4212 KB Output is correct
27 Correct 54 ms 8032 KB Output is correct
28 Correct 38 ms 11844 KB Output is correct
29 Correct 49 ms 14452 KB Output is correct
30 Correct 49 ms 14184 KB Output is correct
31 Correct 1 ms 460 KB Output is correct