oj.uz

Submission #705560

# Submission time Handle Problem Language Result Execution time Memory
705560 2023-03-04T16:10:27 Z rainboy Commuter Pass (JOI18_commuter_pass) C
100 / 100
 502 ms 59832 KB 
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define N	100000
#define N_	(N * 4)
#define INF	0x3f3f3f3f3f3f3f3fLL

int *ej[N], *ew[N], eo[N], *ej_[N_], *ew_[N_], eo_[N_];

void append(int **ej, int **ew, int *eo, int i, int j, int w) {
	int o = eo[i]++;

	if (o >= 2 && (o & o - 1) == 0) {
		ej[i] = (int *) realloc(ej[i], o * 2 * sizeof *ej[i]);
		ew[i] = (int *) realloc(ew[i], o * 2 * sizeof *ew[i]);
	}
	ej[i][o] = j, ew[i][o] = w;
}

long long *dd_; int iq[N_ + 1], pq[N_], cnt;

int lt(int i, int j) { return dd_[i] < dd_[j]; }

int p2(int p) {
	return (p *= 2) > cnt ? 0 : (p < cnt && lt(iq[p + 1], iq[p]) ? p + 1 : p);
}

void pq_up(int i) {
	int p, q, j;

	for (p = pq[i]; (q = p / 2) && lt(i, j = iq[q]); p = q)
		iq[pq[j] = p] = j;
	iq[pq[i] = p] = i;
}

void pq_dn(int i) {
	int p, q, j;

	for (p = pq[i]; (q = p2(p)) && lt(j = iq[q], i); p = q)
		iq[pq[j] = p] = j;
	iq[pq[i] = p] = i;
}

void pq_add_last(int i) {
	iq[pq[i] = ++cnt] = i;
}

int pq_remove_first() {
	int i = iq[1], j = iq[cnt--];

	if (j != i)
		pq[j] = 1, pq_dn(j);
	pq[i] = 0;
	return i;
}

void dijkstra(int **ej, int **ew, int *eo, long long *dd, int n, int s) {
	int i, o;

	dd_ = dd;
	memset(dd, 0x3f, n * sizeof *dd);
	memset(pq, 0, n * sizeof *pq), cnt = 0;
	dd[s] = 0, pq_add_last(s);
	while (cnt) {
		i = pq_remove_first();
		for (o = eo[i]; o--; ) {
			int j = ej[i][o], w = ew[i][o];
			long long d = dd[i] + w;

			if (dd[j] > d) {
				if (dd[j] == INF)
					pq_add_last(j);
				dd[j] = d, pq_up(j);
			}
		}
	}
}

int main() {
	static long long dds[N], ddt[N], dd[N_];
	int n, n_, m, s, t, u, v, i, j, w, o;

	scanf("%d%d%d%d%d%d", &n, &m, &s, &t, &u, &v), n_ = n * 4, s--, t--, u--, v--;
	for (i = 0; i < n; i++) {
		ej[i] = (int *) malloc(2 * sizeof *ej[i]);
		ew[i] = (int *) malloc(2 * sizeof *ew[i]);
	}
	while (m--) {
		scanf("%d%d%d", &i, &j, &w), i--, j--;
		append(ej, ew, eo, i, j, w);
		append(ej, ew, eo, j, i, w);
	}
	dijkstra(ej, ew, eo, dds, n, s);
	dijkstra(ej, ew, eo, ddt, n, t);
	for (i = 0; i < n_; i++) {
		ej_[i] = (int *) malloc(2 * sizeof *ej_[i]);
		ew_[i] = (int *) malloc(2 * sizeof *ew_[i]);
	}
	for (i = 0; i < n; i++) {
		append(ej_, ew_, eo_, i << 2 | 0, i << 2 | 1, 0);
		append(ej_, ew_, eo_, i << 2 | 0, i << 2 | 2, 0);
		append(ej_, ew_, eo_, i << 2 | 1, i << 2 | 3, 0);
		append(ej_, ew_, eo_, i << 2 | 2, i << 2 | 3, 0);
	}
	for (i = 0; i < n; i++)
		for (o = eo[i]; o--; ) {
			j = ej[i][o], w = ew[i][o];
			append(ej_, ew_, eo_, i << 2 | 0, j << 2 | 0, w);
			append(ej_, ew_, eo_, i << 2 | 3, j << 2 | 3, w);
			if (dds[i] + w + ddt[j] == dds[t])
				append(ej_, ew_, eo_, i << 2 | 1, j << 2 | 1, 0);
			if (dds[j] + w + ddt[i] == dds[t])
				append(ej_, ew_, eo_, i << 2 | 2, j << 2 | 2, 0);
		}
	dijkstra(ej_, ew_, eo_, dd, n_, u << 2 | 0);
	printf("%lld\n", dd[v << 2 | 3]);
	return 0;
}

Compilation message

commuter_pass.c: In function 'append':
commuter_pass.c:14:23: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   14 |  if (o >= 2 && (o & o - 1) == 0) {
      |                     ~~^~~
commuter_pass.c: In function 'main':
commuter_pass.c:84:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   84 |  scanf("%d%d%d%d%d%d", &n, &m, &s, &t, &u, &v), n_ = n * 4, s--, t--, u--, v--;
      |  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
commuter_pass.c:90:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   90 |   scanf("%d%d%d", &i, &j, &w), i--, j--;
      |   ^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 463 ms 59388 KB Output is correct
2 Correct 482 ms 58800 KB Output is correct
3 Correct 446 ms 58792 KB Output is correct
4 Correct 500 ms 59212 KB Output is correct
5 Correct 468 ms 58556 KB Output is correct
6 Correct 492 ms 59344 KB Output is correct
7 Correct 474 ms 58560 KB Output is correct
8 Correct 451 ms 58572 KB Output is correct
9 Correct 479 ms 59588 KB Output is correct
10 Correct 401 ms 59832 KB Output is correct
11 Correct 171 ms 49600 KB Output is correct
12 Correct 458 ms 59320 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 489 ms 58960 KB Output is correct
2 Correct 454 ms 58824 KB Output is correct
3 Correct 465 ms 58700 KB Output is correct
4 Correct 471 ms 58692 KB Output is correct
5 Correct 462 ms 58604 KB Output is correct
6 Correct 468 ms 58872 KB Output is correct
7 Correct 502 ms 58624 KB Output is correct
8 Correct 476 ms 58772 KB Output is correct
9 Correct 470 ms 58780 KB Output is correct
10 Correct 469 ms 58804 KB Output is correct
11 Correct 178 ms 49700 KB Output is correct
12 Correct 455 ms 58800 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 2900 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 432 KB Output is correct
4 Correct 18 ms 4948 KB Output is correct
5 Correct 10 ms 2656 KB Output is correct
6 Correct 2 ms 596 KB Output is correct
7 Correct 2 ms 688 KB Output is correct
8 Correct 4 ms 796 KB Output is correct
9 Correct 2 ms 628 KB Output is correct
10 Correct 10 ms 2644 KB Output is correct
11 Correct 1 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 1 ms 564 KB Output is correct
15 Correct 1 ms 468 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 463 ms 59388 KB Output is correct
2 Correct 482 ms 58800 KB Output is correct
3 Correct 446 ms 58792 KB Output is correct
4 Correct 500 ms 59212 KB Output is correct
5 Correct 468 ms 58556 KB Output is correct
6 Correct 492 ms 59344 KB Output is correct
7 Correct 474 ms 58560 KB Output is correct
8 Correct 451 ms 58572 KB Output is correct
9 Correct 479 ms 59588 KB Output is correct
10 Correct 401 ms 59832 KB Output is correct
11 Correct 171 ms 49600 KB Output is correct
12 Correct 458 ms 59320 KB Output is correct
13 Correct 489 ms 58960 KB Output is correct
14 Correct 454 ms 58824 KB Output is correct
15 Correct 465 ms 58700 KB Output is correct
16 Correct 471 ms 58692 KB Output is correct
17 Correct 462 ms 58604 KB Output is correct
18 Correct 468 ms 58872 KB Output is correct
19 Correct 502 ms 58624 KB Output is correct
20 Correct 476 ms 58772 KB Output is correct
21 Correct 470 ms 58780 KB Output is correct
22 Correct 469 ms 58804 KB Output is correct
23 Correct 178 ms 49700 KB Output is correct
24 Correct 455 ms 58800 KB Output is correct
25 Correct 10 ms 2900 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 432 KB Output is correct
28 Correct 18 ms 4948 KB Output is correct
29 Correct 10 ms 2656 KB Output is correct
30 Correct 2 ms 596 KB Output is correct
31 Correct 2 ms 688 KB Output is correct
32 Correct 4 ms 796 KB Output is correct
33 Correct 2 ms 628 KB Output is correct
34 Correct 10 ms 2644 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 1 ms 468 KB Output is correct
37 Correct 1 ms 468 KB Output is correct
38 Correct 1 ms 564 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 455 ms 59288 KB Output is correct
41 Correct 462 ms 59500 KB Output is correct
42 Correct 449 ms 59720 KB Output is correct
43 Correct 181 ms 49700 KB Output is correct
44 Correct 203 ms 49752 KB Output is correct
45 Correct 438 ms 58968 KB Output is correct
46 Correct 424 ms 58784 KB Output is correct
47 Correct 468 ms 59284 KB Output is correct
48 Correct 257 ms 49068 KB Output is correct
49 Correct 437 ms 58908 KB Output is correct
50 Correct 454 ms 59068 KB Output is correct
51 Correct 413 ms 58964 KB Output is correct