oj.uz

Submission #377712

# Submission time Handle Problem Language Result Execution time Memory
377712 2021-03-14T20:46:08 Z rainboy Jakarta Skyscrapers (APIO15_skyscraper) C
57 / 100
 1000 ms 173036 KB 
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define N	30000
#define M_	11111111

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

void append(int **eh, int *eo, 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;
}

int main() {
	static int *eh1[N + 1], eo1[N + 1], *eh2[N + 1], eo2[N + 1], ii[M_], hh[N], pp[M_], qq[M_], dd[M_], qu[M_ * 2];
	int n, m, m_, h, i, j, o, head, cnt;

	scanf("%d%d", &n, &m);
	for (i = 0; i <= n; i++) {
		eh1[i] = (int *) malloc(2 * sizeof *eh1[i]);
		eh2[i] = (int *) malloc(2 * sizeof *eh2[i]);
	}
	for (h = 0; h < m; h++) {
		scanf("%d%d", &i, &j), j = min(j, n);
		ii[h] = i;
		append(eh1, eo1, i, h);
		append(eh2, eo2, j, h);
	}
	if (ii[0] == ii[1]) {
		printf("0\n");
		return 0;
	}
	m_ = m;
	memset(hh, -1, n * sizeof *hh);
	memset(pp, -1, sizeof pp), memset(qq, -1, sizeof qq);
	for (j = 1; j < n; j++) {
		for (o = eo2[j]; o--; ) {
			h = eh2[j][o];
			hh[ii[h]] = h;
		}
		for (o = eo2[j]; o--; ) {
			int h_, h1;

			h = eh2[j][o];
			if (hh[ii[h]] == -1)
				continue;
			h_ = -1;
			for (i = ii[h] % j; i < n; i += j) {
				if (hh[i] == -1)
					ii[h1 = m_++] = i;
				else
					h1 = hh[i], hh[i] = -1;
				if (h_ != -1)
					qq[h_] = h1, pp[h1] = h_;
				h_ = h1;
			}
		}
	}
	for (h = 0; h < m_; h++)
		dd[h] = m_;
	head = m_, cnt = 0;
	dd[0] = 0, qu[head + cnt++] = 0;
	while (cnt) {
		int d, o;

		h = qu[cnt--, head++], i = ii[h], d = dd[h];
		if (h == 1) {
			printf("%d\n", d);
			return 0;
		}
		for (o = eo1[i]; o--; ) {
			int h_ = eh1[i][o];

			if (dd[h_] > d)
				dd[h_] = d, qu[cnt++, --head] = h_;
		}
		eo1[i] = 0;
		d++;
		if (pp[h] != -1 && dd[pp[h]] > d)
			dd[pp[h]] = d, qu[head + cnt++] = pp[h];
		if (qq[h] != -1 && dd[qq[h]] > d)
			dd[qq[h]] = d, qu[head + cnt++] = qq[h];
	}
	printf("-1\n");
	return 0;
}

Compilation message

skyscraper.c: In function 'append':
skyscraper.c:13:23: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   13 |  if (o >= 2 && (o & o - 1) == 0)
      |                     ~~^~~
skyscraper.c: In function 'main':
skyscraper.c:22:2: warning: ignoring return value of 'scanf', declared with attribute warn_unused_result [-Wunused-result]
   22 |  scanf("%d%d", &n, &m);
      |  ^~~~~~~~~~~~~~~~~~~~~
skyscraper.c:28:3: warning: ignoring return value of 'scanf', declared with attribute warn_unused_result [-Wunused-result]
   28 |   scanf("%d%d", &i, &j), j = min(j, n);
      |   ^~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 87276 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 48 ms 87276 KB Output is correct
5 Correct 48 ms 87276 KB Output is correct
6 Correct 48 ms 87276 KB Output is correct
7 Correct 49 ms 87276 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 87276 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 48 ms 87276 KB Output is correct
5 Correct 48 ms 87296 KB Output is correct
6 Correct 48 ms 87424 KB Output is correct
7 Correct 48 ms 87276 KB Output is correct
8 Correct 48 ms 87296 KB Output is correct
9 Correct 49 ms 87416 KB Output is correct
10 Correct 48 ms 87404 KB Output is correct
11 Correct 48 ms 87404 KB Output is correct
12 Correct 48 ms 87424 KB Output is correct
13 Correct 56 ms 87424 KB Output is correct
14 Correct 56 ms 87404 KB Output is correct
15 Correct 48 ms 87404 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 87276 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 49 ms 87404 KB Output is correct
5 Correct 53 ms 87276 KB Output is correct
6 Correct 48 ms 87404 KB Output is correct
7 Correct 48 ms 87276 KB Output is correct
8 Correct 48 ms 87276 KB Output is correct
9 Correct 48 ms 87276 KB Output is correct
10 Correct 48 ms 87404 KB Output is correct
11 Correct 49 ms 87404 KB Output is correct
12 Correct 49 ms 87404 KB Output is correct
13 Correct 50 ms 87404 KB Output is correct
14 Correct 48 ms 87404 KB Output is correct
15 Correct 49 ms 87404 KB Output is correct
16 Correct 48 ms 87404 KB Output is correct
17 Correct 50 ms 87532 KB Output is correct
18 Correct 49 ms 87532 KB Output is correct
19 Correct 50 ms 87532 KB Output is correct
20 Correct 48 ms 87532 KB Output is correct
21 Correct 48 ms 87404 KB Output is correct
22 Correct 48 ms 87532 KB Output is correct
23 Correct 54 ms 87532 KB Output is correct
24 Correct 50 ms 87788 KB Output is correct
25 Correct 49 ms 87532 KB Output is correct
26 Correct 49 ms 87660 KB Output is correct
27 Correct 48 ms 87660 KB Output is correct
28 Correct 49 ms 87788 KB Output is correct
29 Correct 53 ms 88172 KB Output is correct
30 Correct 49 ms 87660 KB Output is correct
31 Correct 49 ms 87916 KB Output is correct
32 Correct 49 ms 87788 KB Output is correct
33 Correct 53 ms 88940 KB Output is correct
34 Correct 51 ms 88684 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 87404 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 48 ms 87276 KB Output is correct
5 Correct 50 ms 87336 KB Output is correct
6 Correct 49 ms 87276 KB Output is correct
7 Correct 49 ms 87276 KB Output is correct
8 Correct 48 ms 87276 KB Output is correct
9 Correct 47 ms 87276 KB Output is correct
10 Correct 53 ms 87404 KB Output is correct
11 Correct 50 ms 87404 KB Output is correct
12 Correct 48 ms 87404 KB Output is correct
13 Correct 49 ms 87276 KB Output is correct
14 Correct 48 ms 87404 KB Output is correct
15 Correct 49 ms 87404 KB Output is correct
16 Correct 49 ms 87532 KB Output is correct
17 Correct 49 ms 87532 KB Output is correct
18 Correct 49 ms 87532 KB Output is correct
19 Correct 50 ms 87532 KB Output is correct
20 Correct 48 ms 87532 KB Output is correct
21 Correct 48 ms 87404 KB Output is correct
22 Correct 51 ms 87532 KB Output is correct
23 Correct 49 ms 87532 KB Output is correct
24 Correct 49 ms 87660 KB Output is correct
25 Correct 50 ms 87532 KB Output is correct
26 Correct 50 ms 87680 KB Output is correct
27 Correct 48 ms 87576 KB Output is correct
28 Correct 49 ms 87788 KB Output is correct
29 Correct 56 ms 88172 KB Output is correct
30 Correct 49 ms 87692 KB Output is correct
31 Correct 49 ms 87916 KB Output is correct
32 Correct 50 ms 87788 KB Output is correct
33 Correct 53 ms 88940 KB Output is correct
34 Correct 51 ms 88684 KB Output is correct
35 Correct 58 ms 88684 KB Output is correct
36 Correct 50 ms 87660 KB Output is correct
37 Correct 56 ms 89196 KB Output is correct
38 Correct 62 ms 89324 KB Output is correct
39 Correct 60 ms 89344 KB Output is correct
40 Correct 60 ms 89196 KB Output is correct
41 Correct 59 ms 89196 KB Output is correct
42 Correct 55 ms 88172 KB Output is correct
43 Correct 56 ms 88300 KB Output is correct
44 Correct 56 ms 88172 KB Output is correct
45 Correct 92 ms 93420 KB Output is correct
46 Correct 79 ms 92676 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 87404 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 48 ms 87276 KB Output is correct
5 Correct 48 ms 87276 KB Output is correct
6 Correct 48 ms 87276 KB Output is correct
7 Correct 48 ms 87276 KB Output is correct
8 Correct 49 ms 87404 KB Output is correct
9 Correct 49 ms 87276 KB Output is correct
10 Correct 48 ms 87404 KB Output is correct
11 Correct 50 ms 87404 KB Output is correct
12 Correct 48 ms 87404 KB Output is correct
13 Correct 49 ms 87404 KB Output is correct
14 Correct 49 ms 87376 KB Output is correct
15 Correct 48 ms 87404 KB Output is correct
16 Correct 48 ms 87404 KB Output is correct
17 Correct 48 ms 87532 KB Output is correct
18 Correct 49 ms 87532 KB Output is correct
19 Correct 49 ms 87532 KB Output is correct
20 Correct 49 ms 87532 KB Output is correct
21 Correct 49 ms 87404 KB Output is correct
22 Correct 49 ms 87532 KB Output is correct
23 Correct 49 ms 87532 KB Output is correct
24 Correct 49 ms 87660 KB Output is correct
25 Correct 50 ms 87532 KB Output is correct
26 Correct 48 ms 87660 KB Output is correct
27 Correct 49 ms 87660 KB Output is correct
28 Correct 50 ms 87916 KB Output is correct
29 Correct 50 ms 88320 KB Output is correct
30 Correct 49 ms 87660 KB Output is correct
31 Correct 49 ms 87916 KB Output is correct
32 Correct 49 ms 87788 KB Output is correct
33 Correct 53 ms 88940 KB Output is correct
34 Correct 53 ms 88684 KB Output is correct
35 Correct 59 ms 88684 KB Output is correct
36 Correct 50 ms 87660 KB Output is correct
37 Correct 60 ms 89196 KB Output is correct
38 Correct 69 ms 89296 KB Output is correct
39 Correct 59 ms 89196 KB Output is correct
40 Correct 59 ms 89196 KB Output is correct
41 Correct 59 ms 89196 KB Output is correct
42 Correct 55 ms 88172 KB Output is correct
43 Correct 55 ms 88300 KB Output is correct
44 Correct 55 ms 88172 KB Output is correct
45 Correct 85 ms 93420 KB Output is correct
46 Correct 81 ms 92600 KB Output is correct
47 Correct 63 ms 94444 KB Output is correct
48 Correct 62 ms 91372 KB Output is correct
49 Correct 59 ms 90732 KB Output is correct
50 Correct 58 ms 90956 KB Output is correct
51 Correct 70 ms 92652 KB Output is correct
52 Correct 67 ms 92908 KB Output is correct
53 Correct 62 ms 90988 KB Output is correct
54 Correct 53 ms 90220 KB Output is correct
55 Correct 60 ms 90476 KB Output is correct
56 Correct 61 ms 90348 KB Output is correct
57 Correct 55 ms 93292 KB Output is correct
58 Correct 58 ms 91244 KB Output is correct
59 Correct 60 ms 91500 KB Output is correct
60 Correct 61 ms 91628 KB Output is correct
61 Correct 61 ms 91628 KB Output is correct
62 Correct 73 ms 95596 KB Output is correct
63 Correct 343 ms 116972 KB Output is correct
64 Correct 396 ms 123056 KB Output is correct
65 Correct 667 ms 137452 KB Output is correct
66 Execution timed out 1100 ms 173036 KB Time limit exceeded
67 Halted 0 ms 0 KB -