oj.uz

답안 #494165

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
494165 2021-12-14T13:59:15 Z rainboy Newspapers (CEOI21_newspapers) C
4 / 100
 1 ms 332 KB 
/* https://csacademy.com/contest/archive/task/catch-the-thief */
#include <stdio.h>
#include <stdlib.h>

#define N	1000

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], i_, d_;

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

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

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

char path[N];

int dfs2(int p, int i, int d) {
	int o;

	if (d >= 3)
		return 0;
	for (o = eo[i]; o--; ) {
		int j = ej[i][o];

		if (j != p && !path[j] && !dfs2(i, j, d))
			return 0;
	}
	return 1;
}

int main() {
	static int qu[N], qu_[N * 5];
	int n, m, h, i, j, u, v, o, cnt;

	scanf("%d%d", &n, &m);
	if (m != n - 1) {
		printf("NO\n");
		return 0;
	}
	if (n == 1) {
		printf("YES\n");
		printf("1\n");
		printf("1\n");
		return 0;
	}
	if (n == 2) {
		printf("YES\n");
		printf("2\n");
		printf("1 1\n");
		return 0;
	}
	for (i = 0; i < n; i++)
		ej[i] = (int *) malloc(2 * sizeof *ej[i]);
	for (h = 0; h < m; h++) {
		scanf("%d%d", &i, &j), i--, j--;
		append(i, j), append(j, i);
	}
	i_ = -1, d_ = -1;
	dfs1(-1, 0, 0);
	u = i_;
	i_ = -1, d_ = -1;
	dfs1(-1, u, 0);
	v = i_;
	for (h = d_, i = v; h >= 0; h--, i = pp[i])
		path[qu[h] = i] = 1;
	path[u] = path[v] = 0;
	for (h = 0; h <= d_; h++)
		if (!dfs2(-1, qu[h], 0)) {
			printf("NO\n");
			return 0;
		}
	printf("YES\n");
	printf("1\n");
	printf("1\n");
	return 0;
	cnt = 0;
	for (h = 1; h < d_; h++) {
		int special1, special2;

		i = qu[h], special1 = special2 = 1;
		for (o = 0; o < eo[i]; o++) {
			j = ej[i][o];
			if (!path[j]) {
				special1 = 0;
				if (eo[j] > 1) {
					special2 = 0;
					qu_[cnt++] = i, qu_[cnt++] = j;
				}
			}
		}
		for (o = eo[i]; o--; ) {
			j = ej[i][o];
			if (!path[j] && eo[j] > 1)
				qu_[cnt++] = j, qu_[cnt++] = i;
		}
		if (special1)
			qu_[cnt++] = i;
		else if (special2)
			qu_[cnt++] = i, qu_[cnt++] = i;
	}
	printf("YES\n");
	printf("%d\n", cnt);
	for (h = 0; h < cnt; h++)
		printf("%d ", qu_[h] + 1);
	printf("\n");
	return 0;
}

Compilation message

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

Subtask #1
0.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Partially correct 0 ms 204 KB Failed to provide a successful strategy.
4 Partially correct 0 ms 204 KB Failed to provide a successful strategy.
5 Partially correct 0 ms 204 KB Failed to provide a successful strategy.
6 Partially correct 0 ms 204 KB Failed to provide a successful strategy.
7 Correct 0 ms 204 KB Output is correct
8 Partially correct 0 ms 204 KB Failed to provide a successful strategy.
9 Incorrect 0 ms 204 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
4.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Partially correct 0 ms 204 KB Failed to provide a successful strategy.
4 Partially correct 1 ms 204 KB Failed to provide a successful strategy.
5 Partially correct 0 ms 204 KB Failed to provide a successful strategy.
6 Partially correct 0 ms 204 KB Failed to provide a successful strategy.
7 Partially correct 0 ms 204 KB Failed to provide a successful strategy.
8 Partially correct 0 ms 204 KB Failed to provide a successful strategy.
9 Partially correct 0 ms 204 KB Failed to provide a successful strategy.
10 Partially correct 0 ms 204 KB Failed to provide a successful strategy.
11 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
12 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
13 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
14 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
15 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
16 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
17 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
18 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
19 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
20 Partially correct 1 ms 332 KB Failed to provide a successful strategy.

Subtask #3
0.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Partially correct 0 ms 204 KB Failed to provide a successful strategy.
4 Partially correct 0 ms 204 KB Failed to provide a successful strategy.
5 Partially correct 0 ms 204 KB Failed to provide a successful strategy.
6 Partially correct 0 ms 204 KB Failed to provide a successful strategy.
7 Correct 0 ms 204 KB Output is correct
8 Partially correct 0 ms 204 KB Failed to provide a successful strategy.
9 Incorrect 0 ms 204 KB Output isn't correct
10 Halted 0 ms 0 KB -