Submission #377724

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
377724	2021-03-14T21:25:10 Z	rainboy	Jakarta Skyscrapers (APIO15_skyscraper)	C	36 / 100	1000 ms	173932 KB

skyscraper

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.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;

	srand(time(NULL));
	scanf("%d%d", &n, &m);
	n = 30000, m = 30000;
	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_;

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

Compilation message

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

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	62 ms	90860 KB	Output is correct
2	Correct	13 ms	3180 KB	Output is correct
3	Correct	13 ms	3180 KB	Output is correct
4	Correct	61 ms	90476 KB	Output is correct
5	Correct	62 ms	90680 KB	Output is correct
6	Correct	63 ms	90860 KB	Output is correct
7	Correct	62 ms	90860 KB	Output is correct

Subtask #2

12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	62 ms	90868 KB	Output is correct
2	Correct	13 ms	3180 KB	Output is correct
3	Correct	14 ms	3180 KB	Output is correct
4	Correct	78 ms	90476 KB	Output is correct
5	Correct	65 ms	90756 KB	Output is correct
6	Correct	63 ms	90860 KB	Output is correct
7	Correct	63 ms	90732 KB	Output is correct
8	Correct	65 ms	90732 KB	Output is correct
9	Correct	62 ms	91372 KB	Output is correct
10	Correct	64 ms	93804 KB	Output is correct
11	Correct	70 ms	100076 KB	Output is correct
12	Correct	64 ms	91116 KB	Output is correct
13	Correct	63 ms	90732 KB	Output is correct
14	Correct	84 ms	104940 KB	Output is correct
15	Correct	75 ms	104580 KB	Output is correct

Subtask #3

14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	65 ms	90860 KB	Output is correct
2	Correct	13 ms	3180 KB	Output is correct
3	Correct	13 ms	3180 KB	Output is correct
4	Correct	62 ms	90476 KB	Output is correct
5	Correct	62 ms	90732 KB	Output is correct
6	Correct	69 ms	90860 KB	Output is correct
7	Correct	62 ms	90732 KB	Output is correct
8	Correct	67 ms	90732 KB	Output is correct
9	Correct	64 ms	91372 KB	Output is correct
10	Correct	64 ms	93804 KB	Output is correct
11	Correct	73 ms	100224 KB	Output is correct
12	Correct	62 ms	91116 KB	Output is correct
13	Correct	62 ms	90732 KB	Output is correct
14	Correct	83 ms	104940 KB	Output is correct
15	Correct	75 ms	104556 KB	Output is correct
16	Correct	66 ms	94700 KB	Output is correct
17	Correct	67 ms	94956 KB	Output is correct
18	Correct	63 ms	91372 KB	Output is correct
19	Correct	63 ms	90988 KB	Output is correct
20	Correct	63 ms	90732 KB	Output is correct
21	Correct	63 ms	91500 KB	Output is correct
22	Correct	62 ms	91116 KB	Output is correct
23	Correct	63 ms	91500 KB	Output is correct
24	Correct	63 ms	92140 KB	Output is correct
25	Correct	62 ms	91244 KB	Output is correct
26	Correct	69 ms	91244 KB	Output is correct
27	Correct	62 ms	91372 KB	Output is correct
28	Correct	68 ms	94316 KB	Output is correct
29	Correct	124 ms	100948 KB	Output is correct
30	Correct	75 ms	93440 KB	Output is correct
31	Correct	93 ms	96236 KB	Output is correct
32	Correct	82 ms	94572 KB	Output is correct
33	Correct	183 ms	110828 KB	Output is correct
34	Correct	78 ms	104812 KB	Output is correct

Subtask #4

0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	62 ms	90988 KB	Output is correct
2	Correct	17 ms	3180 KB	Output is correct
3	Correct	14 ms	3180 KB	Output is correct
4	Correct	64 ms	90476 KB	Output is correct
5	Correct	62 ms	90860 KB	Output is correct
6	Correct	74 ms	90860 KB	Output is correct
7	Correct	63 ms	90732 KB	Output is correct
8	Correct	63 ms	90732 KB	Output is correct
9	Correct	63 ms	91280 KB	Output is correct
10	Correct	70 ms	93804 KB	Output is correct
11	Correct	70 ms	100076 KB	Output is correct
12	Correct	68 ms	91116 KB	Output is correct
13	Correct	74 ms	90732 KB	Output is correct
14	Correct	86 ms	104940 KB	Output is correct
15	Correct	74 ms	104556 KB	Output is correct
16	Correct	67 ms	94700 KB	Output is correct
17	Correct	66 ms	94992 KB	Output is correct
18	Correct	63 ms	91264 KB	Output is correct
19	Correct	65 ms	90860 KB	Output is correct
20	Correct	66 ms	90708 KB	Output is correct
21	Correct	65 ms	91500 KB	Output is correct
22	Correct	63 ms	91116 KB	Output is correct
23	Correct	63 ms	91500 KB	Output is correct
24	Correct	63 ms	92012 KB	Output is correct
25	Correct	63 ms	91372 KB	Output is correct
26	Correct	63 ms	91244 KB	Output is correct
27	Correct	64 ms	91244 KB	Output is correct
28	Correct	78 ms	94316 KB	Output is correct
29	Correct	117 ms	100972 KB	Output is correct
30	Correct	67 ms	93420 KB	Output is correct
31	Correct	91 ms	96236 KB	Output is correct
32	Correct	74 ms	94572 KB	Output is correct
33	Correct	186 ms	110700 KB	Output is correct
34	Correct	81 ms	104752 KB	Output is correct
35	Correct	80 ms	106860 KB	Output is correct
36	Correct	65 ms	94060 KB	Output is correct
37	Correct	87 ms	111084 KB	Output is correct
38	Correct	83 ms	108908 KB	Output is correct
39	Correct	78 ms	108780 KB	Output is correct
40	Correct	80 ms	108908 KB	Output is correct
41	Correct	80 ms	108908 KB	Output is correct
42	Correct	58 ms	91244 KB	Output is correct
43	Correct	58 ms	91244 KB	Output is correct
44	Correct	60 ms	90732 KB	Output is correct
45	Execution timed out	1053 ms	173932 KB	Time limit exceeded
46	Halted	0 ms	0 KB	-

Subtask #5

0 / 43.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	62 ms	90860 KB	Output is correct
2	Correct	13 ms	3180 KB	Output is correct
3	Correct	14 ms	3180 KB	Output is correct
4	Correct	62 ms	90476 KB	Output is correct
5	Correct	62 ms	90732 KB	Output is correct
6	Correct	63 ms	90860 KB	Output is correct
7	Correct	62 ms	90732 KB	Output is correct
8	Correct	61 ms	90732 KB	Output is correct
9	Correct	62 ms	91244 KB	Output is correct
10	Correct	64 ms	93804 KB	Output is correct
11	Correct	72 ms	100096 KB	Output is correct
12	Correct	62 ms	91116 KB	Output is correct
13	Correct	63 ms	90860 KB	Output is correct
14	Correct	85 ms	104940 KB	Output is correct
15	Correct	75 ms	104556 KB	Output is correct
16	Correct	65 ms	94700 KB	Output is correct
17	Correct	66 ms	94956 KB	Output is correct
18	Correct	62 ms	91244 KB	Output is correct
19	Correct	62 ms	90860 KB	Output is correct
20	Correct	62 ms	90732 KB	Output is correct
21	Correct	64 ms	91500 KB	Output is correct
22	Correct	63 ms	91116 KB	Output is correct
23	Correct	64 ms	91500 KB	Output is correct
24	Correct	64 ms	92012 KB	Output is correct
25	Correct	62 ms	91244 KB	Output is correct
26	Correct	64 ms	91244 KB	Output is correct
27	Correct	63 ms	91372 KB	Output is correct
28	Correct	67 ms	94444 KB	Output is correct
29	Correct	121 ms	100972 KB	Output is correct
30	Correct	68 ms	93420 KB	Output is correct
31	Correct	89 ms	96236 KB	Output is correct
32	Correct	74 ms	94572 KB	Output is correct
33	Correct	195 ms	110800 KB	Output is correct
34	Correct	79 ms	104812 KB	Output is correct
35	Correct	79 ms	106860 KB	Output is correct
36	Correct	65 ms	94060 KB	Output is correct
37	Correct	84 ms	111212 KB	Output is correct
38	Correct	88 ms	108908 KB	Output is correct
39	Correct	80 ms	108780 KB	Output is correct
40	Correct	79 ms	108780 KB	Output is correct
41	Correct	85 ms	108780 KB	Output is correct
42	Correct	61 ms	91244 KB	Output is correct
43	Correct	59 ms	91244 KB	Output is correct
44	Correct	59 ms	90732 KB	Output is correct
45	Execution timed out	1096 ms	173556 KB	Time limit exceeded
46	Halted	0 ms	0 KB	-