oj.uz

Submission #948959

# Submission time Handle Problem Language Result Execution time Memory
948959 2024-03-18T17:34:55 Z rainboy Triumphal arch (POI13_luk) C
100 / 100
 657 ms 25628 KB 
#include <stdio.h>
#include <stdlib.h>

#define N	300000

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

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 dp[N], k;

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

	dp[i] = 0;
	for (o = eo[i]; o--; ) {
		int j = ej[i][o];

		if (j != p) {
			dfs(i, j);
			dp[i] += dp[j];
		}
	}
	dp[i] = max(dp[i] - k, 0) + 1;
}

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

	scanf("%d", &n);
	for (i = 0; i < n; 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);
	}
	lower = -1, upper = n;
	while (upper - lower > 1) {
		k = (lower + upper) / 2;
		dfs(-1, 0);
		if (dp[0] == 1)
			upper = k;
		else
			lower = k;
	}
	printf("%d\n", upper);
	return 0;
}

Compilation message

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

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2480 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2552 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2908 KB Output is correct
2 Correct 5 ms 3164 KB Output is correct
3 Correct 3 ms 2740 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 3932 KB Output is correct
2 Correct 18 ms 5040 KB Output is correct
3 Correct 11 ms 3932 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 7024 KB Output is correct
2 Correct 74 ms 9308 KB Output is correct
3 Correct 46 ms 7252 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 167 ms 12112 KB Output is correct
2 Correct 246 ms 18772 KB Output is correct
3 Correct 109 ms 13716 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 586 ms 17692 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 447 ms 17664 KB Output is correct
2 Correct 657 ms 25628 KB Output is correct
3 Correct 379 ms 19776 KB Output is correct