oj.uz

답안 #544721

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
544721 2022-04-02T16:10:48 Z rainboy File Paths (BOI15_fil) C
100 / 100
 105 ms 5588 KB 
#include <stdio.h>
#include <stdlib.h>

#define N	3000
#define M	3000
#define L	1000000

int *ej[N + 1], eo[N + 1], *eh[N + 1], eo_[N + 1];

void link(int **ex, int *eo, int i, int x) {
	int o = eo[i]++;

	if (o >= 2 && (o & o - 1) == 0)
		ex[i] = (int *) realloc(ex[i], o * 2 * sizeof *ex[i]);
	ex[i][o] = x;
}

int dd[N + 1], pp[N + 1], ll[M]; char ans[M];
char used[L + 1]; int kk[L + 1], l_, l1;

void dfs_(int r, int i, int sign) {
	int o;

	if (dd[i] - dd[r] + l1 <= l_)
		kk[dd[i] - dd[r] + l1] += sign;
	for (o = 0; o < eo[i]; o++) {
		int j = ej[i][o];

		dfs_(r, j, sign);
	}
}

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

	dfs_(i, i, 1);
	for (o = 0; o < eo_[i]; o++) {
		int h = eh[i][o], a, b;

		if (dd[i] == l_ - ll[h]) {
			ans[h] = 1;
			continue;
		}
		for (p = i; p != -1 && dd[i] - dd[p] <= l_ - ll[h]; p = pp[p]) {
			b = l_ - ll[h] - (dd[i] - dd[p]);
			if (l1 <= b && used[b - l1]) {
				ans[h] = 1;
				break;
			}
		}
		if (ans[h])
			continue;
		b = l_ - ll[h] - dd[i];
		if (b > 0)
			for (a = 1; a <= b / a; a++)
				if (b % a == 0 && (kk[a] > 0 || kk[b / a] > 0)) {
					ans[h] = 1;
					break;
				}
	}
	for (o = 0; o < eo[i]; o++) {
		int j = ej[i][o];

		dfs(j);
	}
	dfs_(i, i, -1);
}

int main() {
	int n, m, h, i;

	scanf("%d%d%d%d", &n, &m, &l_, &l1), l1++;
	for (i = 0; i <= n; i++) {
		ej[i] = (int *) malloc(2 * sizeof *ej[i]);
		eh[i] = (int *) malloc(2 * sizeof *eh[i]);
	}
	pp[0] = -1;
	for (i = 1; i <= n; i++) {
		scanf("%d%d", &pp[i], &dd[i]), dd[i] += dd[pp[i]] + 1;
		link(ej, eo, pp[i], i);
	}
	for (i = 0; i <= n; i++)
		if (dd[i] <= l_)
			used[dd[i]] = 1;
	for (h = 0; h < m; h++) {
		scanf("%d%d", &i, &ll[h]), ll[h]++;
		link(eh, eo_, i, h);
	}
	dfs(0);
	for (h = 0; h < m; h++)
		printf(ans[h] ? "YES\n" : "NO\n");
	return 0;
}

Compilation message

fil.c: In function 'link':
fil.c:13:23: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   13 |  if (o >= 2 && (o & o - 1) == 0)
      |                     ~~^~~
fil.c: In function 'main':
fil.c:72:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |  scanf("%d%d%d%d", &n, &m, &l_, &l1), l1++;
      |  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
fil.c:79:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   79 |   scanf("%d%d", &pp[i], &dd[i]), dd[i] += dd[pp[i]] + 1;
      |   ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
fil.c:86:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   86 |   scanf("%d%d", &i, &ll[h]), ll[h]++;
      |   ^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 852 KB Output is correct
4 Correct 3 ms 856 KB Output is correct
5 Correct 5 ms 4436 KB Output is correct
6 Correct 3 ms 3156 KB Output is correct
7 Correct 6 ms 4436 KB Output is correct
8 Correct 3 ms 4052 KB Output is correct
9 Correct 3 ms 4308 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 3 ms 684 KB Output is correct

Subtask #2
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 5200 KB Output is correct
2 Correct 11 ms 5076 KB Output is correct
3 Correct 12 ms 5332 KB Output is correct
4 Correct 11 ms 5256 KB Output is correct
5 Correct 105 ms 5304 KB Output is correct
6 Correct 104 ms 5588 KB Output is correct
7 Correct 71 ms 5204 KB Output is correct
8 Correct 66 ms 5556 KB Output is correct
9 Correct 11 ms 4844 KB Output is correct
10 Correct 11 ms 4248 KB Output is correct
11 Correct 5 ms 596 KB Output is correct
12 Correct 80 ms 2448 KB Output is correct

Subtask #3
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 852 KB Output is correct
4 Correct 3 ms 856 KB Output is correct
5 Correct 5 ms 4436 KB Output is correct
6 Correct 3 ms 3156 KB Output is correct
7 Correct 6 ms 4436 KB Output is correct
8 Correct 3 ms 4052 KB Output is correct
9 Correct 3 ms 4308 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 3 ms 684 KB Output is correct
13 Correct 12 ms 5200 KB Output is correct
14 Correct 11 ms 5076 KB Output is correct
15 Correct 12 ms 5332 KB Output is correct
16 Correct 11 ms 5256 KB Output is correct
17 Correct 105 ms 5304 KB Output is correct
18 Correct 104 ms 5588 KB Output is correct
19 Correct 71 ms 5204 KB Output is correct
20 Correct 66 ms 5556 KB Output is correct
21 Correct 11 ms 4844 KB Output is correct
22 Correct 11 ms 4248 KB Output is correct
23 Correct 5 ms 596 KB Output is correct
24 Correct 80 ms 2448 KB Output is correct
25 Correct 9 ms 5048 KB Output is correct
26 Correct 9 ms 5160 KB Output is correct
27 Correct 9 ms 5076 KB Output is correct
28 Correct 9 ms 5380 KB Output is correct
29 Correct 101 ms 5524 KB Output is correct
30 Correct 96 ms 5332 KB Output is correct
31 Correct 61 ms 5304 KB Output is correct
32 Correct 63 ms 5300 KB Output is correct
33 Correct 9 ms 4176 KB Output is correct
34 Correct 9 ms 4260 KB Output is correct
35 Correct 5 ms 596 KB Output is correct
36 Correct 103 ms 1596 KB Output is correct