Submission #636581

#	Time	Username	Problem	Language	Result	Execution time	Memory
636581		rainboy	Jail (JOI22_jail)	C11	54 / 100	5093 ms	17616 KiB

jail

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

#define N	120000
#define M	100

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

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

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

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

char aa[M][M]; int in[M];

void dfs2(int m, int h) {
	int h_;

	if (in[h])
		return;
	in[h] = -1;
	for (h_ = 0; h_ < m; h_++)
		if (aa[h][h_])
			in[h_]--, dfs2(m, h_);
}

int main() {
	int t;

	scanf("%d", &t);
	while (t--) {
		static int ii[M], jj[N];
		static char visited[N];
		int n, m, h, h_, h1, h2, i, j, line, yes;

		scanf("%d", &n);
		for (i = 0; i < n; i++)
			ej[i] = (int *) malloc(2 * sizeof *ej[i]), eo[i] = 0;
		line = 1;
		for (h = 0; h < n - 1; h++) {
			scanf("%d%d", &i, &j), i--, j--;
			if (i + 1 != j)
				line = 0;
			append(i, j), append(j, i);
		}
		dfs1(-1, 0, 0);
		if (line) {
			scanf("%d", &m);
			memset(jj, -1, n * sizeof *jj);
			while (m--) {
				scanf("%d%d", &i, &j), i--, j--;
				jj[i] = j;
			}
			yes = 1;
			for (i = 0, j = -1; i < n; i++)
				if (jj[i] != -1) {
					if (j >= jj[i]) {
						yes = 0;
						break;
					}
					j = jj[i];
				}
			printf(yes ? "Yes\n" : "No\n");
		} else {
			scanf("%d", &m);
			for (h = 0; h < m; h++)
				scanf("%d%d", &ii[h], &jj[h]), ii[h]--, jj[h]--;
			for (h = 0; h < m; h++)
				memset(aa[h], 0, m * sizeof *aa[h]);
			for (h = 0; h < m; h++) {
				i = ii[h], j = jj[h];
				memset(visited, 0, n * sizeof *visited);
				while (i != j)
					if (dd[i] > dd[j])
						visited[i] = 1, i = pp[i];
					else
						visited[j] = 1, j = pp[j];
				visited[i] = 1;
				for (h_ = 0; h_ < m; h_++)
					if (h_ != h) {
						if (visited[ii[h_]])
							aa[h_][h] = 1;
						if (visited[jj[h_]])
							aa[h][h_] = 1;
					}
			}
			memset(in, 0, m * sizeof *in);
			for (h1 = 0; h1 < m; h1++)
				for (h2 = 0; h2 < m; h2++)
					if (aa[h1][h2])
						in[h2]++;
			for (h = 0; h < m; h++)
				dfs2(m, h);
			yes = 1;
			for (h = 0; h < m; h++)
				if (in[h] > 0) {
					yes = 0;
					break;
				}
			printf(yes ? "Yes\n" : "No\n");
		}
	}
	return 0;
}

Compilation message (stderr)

jail.c: In function 'append':
jail.c:13:23: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   13 |  if (o >= 2 && (o & o - 1) == 0)
      |                     ~~^~~
jail.c: In function 'main':
jail.c:48:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |  scanf("%d", &t);
      |  ^~~~~~~~~~~~~~~
jail.c:54:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   54 |   scanf("%d", &n);
      |   ^~~~~~~~~~~~~~~
jail.c:59:4: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   59 |    scanf("%d%d", &i, &j), i--, j--;
      |    ^~~~~~~~~~~~~~~~~~~~~
jail.c:66:4: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |    scanf("%d", &m);
      |    ^~~~~~~~~~~~~~~
jail.c:69:5: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   69 |     scanf("%d%d", &i, &j), i--, j--;
      |     ^~~~~~~~~~~~~~~~~~~~~
jail.c:83:4: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   83 |    scanf("%d", &m);
      |    ^~~~~~~~~~~~~~~
jail.c:85:5: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   85 |     scanf("%d%d", &ii[h], &jj[h]), ii[h]--, jj[h]--;
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 16 / 16
• Subtask 4: 28 / 28
• Subtask 5: 0 / 12
• Subtask 6: 0 / 11
• Subtask 7: 0 / 23