oj.uz

Submission #636580

# Submission time Handle Problem Language Result Execution time Memory
636580 2022-08-29T15:36:56 Z rainboy Jail (JOI22_jail) C
26 / 100
 62 ms 16216 KB 
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define N	120000
#define M	6

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

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.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 12 ms 2004 KB Output is correct
5 Correct 31 ms 4020 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 2 ms 492 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 34 ms 4576 KB Output is correct
10 Correct 38 ms 16152 KB Output is correct
11 Correct 6 ms 852 KB Output is correct
12 Correct 31 ms 3948 KB Output is correct
13 Correct 44 ms 16200 KB Output is correct
14 Correct 45 ms 16204 KB Output is correct
15 Correct 47 ms 16208 KB Output is correct
16 Correct 62 ms 16208 KB Output is correct
17 Correct 47 ms 16196 KB Output is correct
18 Correct 57 ms 16212 KB Output is correct
19 Correct 47 ms 16148 KB Output is correct
20 Correct 48 ms 16200 KB Output is correct
21 Correct 46 ms 16216 KB Output is correct
22 Correct 45 ms 16212 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 2 ms 420 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 1 ms 296 KB Output is correct
20 Correct 2 ms 432 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 1 ms 212 KB Output is correct

Subtask #4
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 2 ms 420 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 1 ms 296 KB Output is correct
20 Correct 2 ms 432 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 3 ms 468 KB Output is correct
30 Runtime error 1 ms 436 KB Execution killed with signal 11
31 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 2 ms 420 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 1 ms 296 KB Output is correct
20 Correct 2 ms 432 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 3 ms 468 KB Output is correct
30 Runtime error 1 ms 436 KB Execution killed with signal 11
31 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 6 ms 852 KB Output is correct
6 Correct 1 ms 404 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Runtime error 1 ms 340 KB Execution killed with signal 11
13 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 12 ms 2004 KB Output is correct
5 Correct 31 ms 4020 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 2 ms 492 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 34 ms 4576 KB Output is correct
10 Correct 38 ms 16152 KB Output is correct
11 Correct 6 ms 852 KB Output is correct
12 Correct 31 ms 3948 KB Output is correct
13 Correct 44 ms 16200 KB Output is correct
14 Correct 45 ms 16204 KB Output is correct
15 Correct 47 ms 16208 KB Output is correct
16 Correct 62 ms 16208 KB Output is correct
17 Correct 47 ms 16196 KB Output is correct
18 Correct 57 ms 16212 KB Output is correct
19 Correct 47 ms 16148 KB Output is correct
20 Correct 48 ms 16200 KB Output is correct
21 Correct 46 ms 16216 KB Output is correct
22 Correct 45 ms 16212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 3 ms 468 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 300 KB Output is correct
38 Correct 2 ms 420 KB Output is correct
39 Correct 2 ms 468 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 1 ms 296 KB Output is correct
42 Correct 2 ms 432 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 2 ms 468 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 2 ms 468 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 2 ms 468 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 3 ms 468 KB Output is correct
52 Runtime error 1 ms 436 KB Execution killed with signal 11
53 Halted 0 ms 0 KB -