oj.uz

답안 #482840

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
482840 2021-10-26T14:13:37 Z rainboy Sjekira (COCI20_sjekira) C
110 / 110
 69 ms 8172 KB 
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define N	100000

int max(int a, int b) { return a > b ? a : b; }

unsigned int X = 12345;

int rand_() {
	return (X *= 3) >> 1;
}

int *ej[N], eo[N];

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

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

int aa[N];

void sort(int *ii, int l, int r) {
	while (l < r) {
		int i = l, j = l, k = r, i_ = ii[l + rand_() % (r - l)], tmp;

		while (j < k)
			if (aa[ii[j]] == aa[i_])
				j++;
			else if (aa[ii[j]] < aa[i_]) {
				tmp = ii[i], ii[i] = ii[j], ii[j] = tmp;
				i++, j++;
			} else {
				k--;
				tmp = ii[j], ii[j] = ii[k], ii[k] = tmp;
			}
		sort(ii, l, i);
		l = k;
	}
}

int ds[N];

int find(int i) {
	return ds[i] < 0 ? i : (ds[i] = find(ds[i]));
}

int join(int i, int j) {
	int a;

	i = find(i);
	j = find(j);
	if (i == j)
		return 0;
	a = aa[i] + aa[j], aa[i] = aa[j] = max(aa[i], aa[j]);
	if (ds[i] > ds[j])
		ds[i] = j;
	else {
		if (ds[i] == ds[j])
			ds[i]--;
		ds[j] = i;
	}
	return a;
}

int main() {
	static int ii[N];
	static char alive[N];
	int n, h, i, j, o;
	long long ans;

	scanf("%d", &n);
	for (i = 0; i < n; i++) {
		scanf("%d", &aa[i]);
		ej[i] = (int *) malloc(2 * sizeof *ej[i]);
	}
	for (h = 0; h < n - 1; h++) {
		scanf("%d%d", &i, &j), i--, j--;
		append(i, j), append(j, i);
	}
	for (i = 0; i < n; i++)
		ii[i] = i;
	sort(ii, 0, n);
	memset(ds, -1, n * sizeof *ds);
	ans = 0;
	for (h = 0; h < n; h++) {
		i = ii[h];
		alive[i] = 1;
		for (o = eo[i]; o--; ) {
			j = ej[i][o];
			if (alive[j])
				ans += join(i, j);
		}
	}
	printf("%lld\n", ans);
	return 0;
}

Compilation message

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

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 280 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 280 KB Output is correct
5 Correct 0 ms 204 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 6424 KB Output is correct
2 Correct 35 ms 5072 KB Output is correct
3 Correct 37 ms 4832 KB Output is correct
4 Correct 38 ms 5444 KB Output is correct
5 Correct 58 ms 7948 KB Output is correct
6 Correct 43 ms 7844 KB Output is correct
7 Correct 37 ms 6828 KB Output is correct
8 Correct 34 ms 6212 KB Output is correct
9 Correct 24 ms 4172 KB Output is correct
10 Correct 44 ms 7852 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 280 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 280 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 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 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct

Subtask #4
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 280 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 280 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 43 ms 6424 KB Output is correct
7 Correct 35 ms 5072 KB Output is correct
8 Correct 37 ms 4832 KB Output is correct
9 Correct 38 ms 5444 KB Output is correct
10 Correct 58 ms 7948 KB Output is correct
11 Correct 43 ms 7844 KB Output is correct
12 Correct 37 ms 6828 KB Output is correct
13 Correct 34 ms 6212 KB Output is correct
14 Correct 24 ms 4172 KB Output is correct
15 Correct 44 ms 7852 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 13 ms 2016 KB Output is correct
22 Correct 11 ms 1776 KB Output is correct
23 Correct 61 ms 7792 KB Output is correct
24 Correct 46 ms 5584 KB Output is correct
25 Correct 43 ms 5504 KB Output is correct
26 Correct 27 ms 3732 KB Output is correct
27 Correct 31 ms 4412 KB Output is correct
28 Correct 43 ms 5624 KB Output is correct
29 Correct 26 ms 3832 KB Output is correct
30 Correct 69 ms 8172 KB Output is correct