oj.uz

답안 #680407

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
680407 2023-01-10T17:44:03 Z rainboy Wild Boar (JOI18_wild_boar) C
47 / 100
 18000 ms 21888 KB 
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define N	2000
#define M	2000
#define L	100000
#define INF	0x3f3f3f3f3f3f3f3fLL

long long min(long long a, long long b) { return a < b ? a : b; }

int ij[M * 2], cc[M], m;
int *eh[N], eo[N], n;

void append(int i, int h) {
	int o = eo[i]++;

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

void solve(long long *dd, int u) {
	static char visited[M * 2];
	int h, h_, i, o;

	memset(dd, 0x3f, m * 2 * sizeof *dd), dd[u] = cc[u >> 1];
	memset(visited, 0, m * 2 * sizeof *visited);
	while (1) {
		h_ = -1;
		for (h = 0; h < m * 2; h++)
			if (!visited[h] && (h_ == -1 || dd[h_] > dd[h]))
				h_ = h;
		if (h_ == -1)
			break;
		visited[h_] = 1;
		h = h_, i = ij[h ^ 1];
		for (o = eo[i]; o--; ) {
			h_ = eh[i][o];
			if (!visited[h_] && (h ^ h_) != 1)
				dd[h_] = min(dd[h_], dd[h] + cc[h_ >> 1]);
		}
	}
}

int main() {
	static long long dd[M * 2][M * 2], dp[M * 2], dq[M * 2];
	static int uu1[M * 2][N], uu2[M * 2][N], ii[L];
	int q, l, g, h, i, j, t, t1, t2, u, v;
	long long ans;

	scanf("%d%d%d%d", &n, &m, &q, &l);
	for (i = 0; i < n; i++)
		eh[i] = (int *) malloc(2 * sizeof *eh[i]);
	for (h = 0; h < m; h++) {
		scanf("%d%d%d", &i, &j, &cc[h]), i--, j--;
		ij[h << 1 | 0] = i, ij[h << 1 | 1] = j;
		append(i, h << 1 | 0), append(j, h << 1 | 1);
	}
	for (u = 0; u < m * 2; u++)
		solve(dd[u], u);
	for (g = 0; g < l; g++)
		scanf("%d", &ii[g]), ii[g]--;
	while (q--) {
		scanf("%d%d", &g, &i), g--, i--;
		ii[g] = i;
	}
	for (v = 0; v < m * 2; v++) {
		memset(uu1[v], -1, n * sizeof *uu1[v]), memset(uu2[v], -1, n * sizeof *uu2[v]);
		for (u = 0; u < m * 2; u++)
			if (dd[u][v] != INF) {
				i = ij[u];
				if (uu1[v][i] == -1 || dd[uu1[v][i]][v] > dd[u][v])
					uu2[v][i] = uu1[v][i], uu1[v][i] = u;
				else if (uu2[v][i] == -1 || dd[uu2[v][i]][v] > dd[u][v])
					uu2[v][i] = u;
			}
	}
	for (g = 0; g + 1 < l; g++) {
		i = ii[g], j = ii[g + 1];
		memset(dq, 0x3f, m * 2 * sizeof *dq);
		t1 = t2 = -1;
		for (t = 0; t < m * 2; t++)
			if (dp[t] != INF) {
				if (t1 == -1 || dp[t1] > dp[t])
					t2 = t1, t1 = t;
				else if (t2 == -1 || dp[t2] > dp[t])
					t2 = t;
			}
		for (v = 0; v < m * 2; v++)
			if (ij[v ^ 1] == j && (u = uu1[v][i]) != -1) {
				if (g == 0)
					dq[v] = min(dq[v], dd[u][v]);
				else {
					if (t1 != -1 && (t1 ^ u) != 1)
						dq[v] = min(dq[v], dp[t1] + dd[u][v]);
					else if (t2 != -1)
						dq[v] = min(dq[v], dp[t2] + dd[u][v]);
					if ((u = uu2[v][i]) != -1) {
						if (t1 != -1 && (t1 ^ u) != 1)
							dq[v] = min(dq[v], dp[t1] + dd[u][v]);
						else if (t2 != -1)
							dq[v] = min(dq[v], dp[t2] + dd[u][v]);
					}
				}
			}
		memcpy(dp, dq, m * 2 * sizeof *dq);
	}
	ans = INF;
	for (v = 0; v < m * 2; v++)
		ans = min(ans, dp[v]);
	printf("%lld\n", ans == INF ? -1 : ans);
	return 0;
}

Compilation message

wild_boar.c: In function 'append':
wild_boar.c:18:23: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   18 |  if (o >= 2 && (o & o - 1) == 0)
      |                     ~~^~~
wild_boar.c: In function 'main':
wild_boar.c:52:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   52 |  scanf("%d%d%d%d", &n, &m, &q, &l);
      |  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
wild_boar.c:56:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   56 |   scanf("%d%d%d", &i, &j, &cc[h]), i--, j--;
      |   ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
wild_boar.c:63:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   63 |   scanf("%d", &ii[g]), ii[g]--;
      |   ^~~~~~~~~~~~~~~~~~~
wild_boar.c:65:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |   scanf("%d%d", &g, &i), g--, i--;
      |   ^~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 0 ms 468 KB Output is correct
6 Correct 0 ms 468 KB Output is correct
7 Correct 0 ms 468 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 0 ms 468 KB Output is correct
10 Correct 0 ms 468 KB Output is correct
11 Correct 0 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 0 ms 468 KB Output is correct
15 Correct 0 ms 468 KB Output is correct
16 Correct 0 ms 468 KB Output is correct
17 Correct 0 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 0 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 0 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 0 ms 468 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 0 ms 468 KB Output is correct
6 Correct 0 ms 468 KB Output is correct
7 Correct 0 ms 468 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 0 ms 468 KB Output is correct
10 Correct 0 ms 468 KB Output is correct
11 Correct 0 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 0 ms 468 KB Output is correct
15 Correct 0 ms 468 KB Output is correct
16 Correct 0 ms 468 KB Output is correct
17 Correct 0 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 0 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 0 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 0 ms 468 KB Output is correct
26 Correct 2 ms 1364 KB Output is correct
27 Correct 61 ms 3628 KB Output is correct
28 Correct 62 ms 3644 KB Output is correct
29 Correct 586 ms 11184 KB Output is correct
30 Correct 576 ms 11496 KB Output is correct
31 Correct 607 ms 11484 KB Output is correct
32 Correct 623 ms 11488 KB Output is correct
33 Correct 570 ms 11764 KB Output is correct
34 Correct 566 ms 11816 KB Output is correct
35 Correct 609 ms 11676 KB Output is correct
36 Correct 602 ms 11728 KB Output is correct
37 Correct 569 ms 11836 KB Output is correct
38 Correct 550 ms 12100 KB Output is correct
39 Correct 577 ms 12012 KB Output is correct
40 Correct 559 ms 12108 KB Output is correct
41 Correct 560 ms 11988 KB Output is correct
42 Correct 567 ms 12084 KB Output is correct
43 Correct 559 ms 12396 KB Output is correct
44 Correct 560 ms 12272 KB Output is correct
45 Correct 489 ms 12592 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 0 ms 468 KB Output is correct
6 Correct 0 ms 468 KB Output is correct
7 Correct 0 ms 468 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 0 ms 468 KB Output is correct
10 Correct 0 ms 468 KB Output is correct
11 Correct 0 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 0 ms 468 KB Output is correct
15 Correct 0 ms 468 KB Output is correct
16 Correct 0 ms 468 KB Output is correct
17 Correct 0 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 0 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 0 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 0 ms 468 KB Output is correct
26 Correct 2 ms 1364 KB Output is correct
27 Correct 61 ms 3628 KB Output is correct
28 Correct 62 ms 3644 KB Output is correct
29 Correct 586 ms 11184 KB Output is correct
30 Correct 576 ms 11496 KB Output is correct
31 Correct 607 ms 11484 KB Output is correct
32 Correct 623 ms 11488 KB Output is correct
33 Correct 570 ms 11764 KB Output is correct
34 Correct 566 ms 11816 KB Output is correct
35 Correct 609 ms 11676 KB Output is correct
36 Correct 602 ms 11728 KB Output is correct
37 Correct 569 ms 11836 KB Output is correct
38 Correct 550 ms 12100 KB Output is correct
39 Correct 577 ms 12012 KB Output is correct
40 Correct 559 ms 12108 KB Output is correct
41 Correct 560 ms 11988 KB Output is correct
42 Correct 567 ms 12084 KB Output is correct
43 Correct 559 ms 12396 KB Output is correct
44 Correct 560 ms 12272 KB Output is correct
45 Correct 489 ms 12592 KB Output is correct
46 Correct 1970 ms 21888 KB Output is correct
47 Execution timed out 18042 ms 18020 KB Time limit exceeded
48 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 0 ms 468 KB Output is correct
6 Correct 0 ms 468 KB Output is correct
7 Correct 0 ms 468 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 0 ms 468 KB Output is correct
10 Correct 0 ms 468 KB Output is correct
11 Correct 0 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 0 ms 468 KB Output is correct
15 Correct 0 ms 468 KB Output is correct
16 Correct 0 ms 468 KB Output is correct
17 Correct 0 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 0 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 0 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 0 ms 468 KB Output is correct
26 Correct 2 ms 1364 KB Output is correct
27 Correct 61 ms 3628 KB Output is correct
28 Correct 62 ms 3644 KB Output is correct
29 Correct 586 ms 11184 KB Output is correct
30 Correct 576 ms 11496 KB Output is correct
31 Correct 607 ms 11484 KB Output is correct
32 Correct 623 ms 11488 KB Output is correct
33 Correct 570 ms 11764 KB Output is correct
34 Correct 566 ms 11816 KB Output is correct
35 Correct 609 ms 11676 KB Output is correct
36 Correct 602 ms 11728 KB Output is correct
37 Correct 569 ms 11836 KB Output is correct
38 Correct 550 ms 12100 KB Output is correct
39 Correct 577 ms 12012 KB Output is correct
40 Correct 559 ms 12108 KB Output is correct
41 Correct 560 ms 11988 KB Output is correct
42 Correct 567 ms 12084 KB Output is correct
43 Correct 559 ms 12396 KB Output is correct
44 Correct 560 ms 12272 KB Output is correct
45 Correct 489 ms 12592 KB Output is correct
46 Correct 1970 ms 21888 KB Output is correct
47 Execution timed out 18042 ms 18020 KB Time limit exceeded
48 Halted 0 ms 0 KB -