답안 #1073205

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1073205	2024-08-24T10:23:10 Z	rainboy	Infiltration (CCO24_day2problem1)	C	0 / 25	4 ms	1372 KB

Main

#include <stdio.h>
#include <stdlib.h>

#define N	100
#define M	1440
#define D	50

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

int dd[] = { 3, 13, 32, 61, 95, 107 };

void test() {
	int a, a_, b, b_, l, d, d_;

	for (a = 0; a <= D; a++)
		for (b = 0; b <= D; b++) {
			a_ = a, b_ = b, d_ = 0, l = 0, d = dd[0];
			while (a_ > 0 || b_ > 0 || a_ != b_) {
				if (l % 2 == 0)
					a_--;
				else
					b_--;
				d_++;
				if (--d == 0)
					d = dd[++l];
			}
			if (d_ * 2 > (a + b) * 15) {
				printf("WA %d %d\n", a, b);
				return;
			}
		}
	printf("AC\n");
}

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 pp[N], d_;

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

	pp[i] = p;
	d_ = max(d_, d);
	for (o = eo[i]; o--; ) {
		int j = ej[i][o];

		if (j != p)
			dfs(i, j, d + 1);
	}
}

int main() {
	static int iii[2][N][M + 1], mm[2][N];
	int n, m, h, i, j, r, t, l, d;

	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);
		append(i, j), append(j, i);
	}
	for (r = 0; r < n; r++) {
		d_ = 0, dfs(-1, r, 0);
		if (d_ <= D)
			break;
	}
	m = 0;
	for (t = 0; t < 2; t++)
		for (i = 0; i < n; i++) {
			mm[t][i] = 0, iii[t][i][mm[t][i]] = j = i, l = 0;
			for (l = 0; j != r; l++) {
				d = dd[l];
				if (l % 2 == t)
					for (h = 0; h < d && j != r; h++)
						iii[t][i][++mm[t][i]] = j = pp[j];
				else
					for (h = 0; h < d; h++)
						iii[t][i][++mm[t][i]] = j;
			}
			m = max(m, mm[t][i]);
		}
	printf("%d\n", m * 2);
	for (t = 0; t < 2; t++)
		for (i = 0; i < n; i++)
			for (h = 1; h <= m * 2; h++)
				printf("%d%c", iii[t][i][(h + 1 - t) / 2], h < m * 2 ? ' ' : '\n');
	return 0;
}

Compilation message

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

Subtask #1

0.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	4 ms	1372 KB	Node sequence is invalid
2	Halted	0 ms	0 KB	-