oj.uz

Submission #377706

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

#define N	30000
#define M_	22222222

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_], jj[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, jj[h] = j;
		append(eh1, eo1, i, h);
		append(eh2, eo2, j, h);
	}
	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--; ) {
			h = eh2[j][o];
			if (hh[ii[h]] != -1) {
				for (i = ii[h] % j; i < n; i += j)
					if (hh[i] == -1)
						ii[m_] = i, jj[m_] = j, hh[i] = m_++;
				for (i = ii[h] % j; i < n; i += j) {
					if (i + j < n)
						qq[hh[i]] = hh[i + j], pp[hh[i + j]] = hh[i];
					hh[i] = -1;
				}
			}
		}
	}
	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:19:71: warning: variable 'jj' set but not used [-Wunused-but-set-variable]
   19 |  static int *eh1[N + 1], eo1[N + 1], *eh2[N + 1], eo2[N + 1], ii[M_], jj[M_], hh[N], pp[M_], qq[M_], dd[M_], qu[M_ * 2];
      |                                                                       ^~
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 95 ms 174316 KB Output is correct
2 Correct 95 ms 174316 KB Output is correct
3 Correct 98 ms 174316 KB Output is correct
4 Correct 98 ms 174316 KB Output is correct
5 Correct 96 ms 174316 KB Output is correct
6 Correct 96 ms 174316 KB Output is correct
7 Correct 96 ms 174316 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 174408 KB Output is correct
2 Correct 95 ms 174316 KB Output is correct
3 Correct 101 ms 174316 KB Output is correct
4 Correct 95 ms 174304 KB Output is correct
5 Correct 97 ms 174316 KB Output is correct
6 Correct 97 ms 174316 KB Output is correct
7 Correct 96 ms 174316 KB Output is correct
8 Correct 103 ms 174316 KB Output is correct
9 Correct 96 ms 174316 KB Output is correct
10 Correct 97 ms 174320 KB Output is correct
11 Correct 97 ms 174444 KB Output is correct
12 Correct 99 ms 174316 KB Output is correct
13 Correct 96 ms 174348 KB Output is correct
14 Correct 97 ms 174444 KB Output is correct
15 Correct 96 ms 174444 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 174316 KB Output is correct
2 Correct 95 ms 174316 KB Output is correct
3 Correct 95 ms 174316 KB Output is correct
4 Correct 98 ms 174316 KB Output is correct
5 Correct 96 ms 174316 KB Output is correct
6 Correct 97 ms 174316 KB Output is correct
7 Correct 96 ms 174316 KB Output is correct
8 Correct 96 ms 174316 KB Output is correct
9 Correct 110 ms 174316 KB Output is correct
10 Correct 95 ms 174316 KB Output is correct
11 Correct 98 ms 174444 KB Output is correct
12 Correct 98 ms 174316 KB Output is correct
13 Correct 97 ms 174316 KB Output is correct
14 Correct 113 ms 174592 KB Output is correct
15 Correct 98 ms 174444 KB Output is correct
16 Correct 97 ms 174316 KB Output is correct
17 Correct 96 ms 174444 KB Output is correct
18 Correct 96 ms 174572 KB Output is correct
19 Correct 98 ms 174572 KB Output is correct
20 Correct 100 ms 174444 KB Output is correct
21 Correct 98 ms 174316 KB Output is correct
22 Correct 98 ms 174444 KB Output is correct
23 Correct 95 ms 174572 KB Output is correct
24 Correct 98 ms 174572 KB Output is correct
25 Correct 96 ms 174572 KB Output is correct
26 Correct 100 ms 174572 KB Output is correct
27 Correct 97 ms 174828 KB Output is correct
28 Correct 97 ms 174700 KB Output is correct
29 Correct 101 ms 175212 KB Output is correct
30 Correct 98 ms 174700 KB Output is correct
31 Correct 98 ms 174828 KB Output is correct
32 Correct 98 ms 174728 KB Output is correct
33 Correct 99 ms 175852 KB Output is correct
34 Correct 99 ms 175724 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 174316 KB Output is correct
2 Correct 99 ms 174316 KB Output is correct
3 Correct 97 ms 174316 KB Output is correct
4 Correct 96 ms 174316 KB Output is correct
5 Correct 96 ms 174316 KB Output is correct
6 Correct 103 ms 174316 KB Output is correct
7 Correct 95 ms 174316 KB Output is correct
8 Correct 95 ms 174316 KB Output is correct
9 Correct 97 ms 174316 KB Output is correct
10 Correct 98 ms 174316 KB Output is correct
11 Correct 98 ms 174452 KB Output is correct
12 Correct 96 ms 174316 KB Output is correct
13 Correct 96 ms 174316 KB Output is correct
14 Correct 101 ms 174444 KB Output is correct
15 Correct 96 ms 174444 KB Output is correct
16 Correct 97 ms 174316 KB Output is correct
17 Correct 96 ms 174572 KB Output is correct
18 Correct 97 ms 174572 KB Output is correct
19 Correct 96 ms 174572 KB Output is correct
20 Correct 95 ms 174444 KB Output is correct
21 Correct 97 ms 174316 KB Output is correct
22 Correct 95 ms 174444 KB Output is correct
23 Correct 101 ms 174572 KB Output is correct
24 Correct 102 ms 174700 KB Output is correct
25 Correct 101 ms 174572 KB Output is correct
26 Correct 100 ms 174572 KB Output is correct
27 Correct 107 ms 174572 KB Output is correct
28 Correct 100 ms 174700 KB Output is correct
29 Correct 99 ms 175212 KB Output is correct
30 Correct 102 ms 174700 KB Output is correct
31 Correct 96 ms 174828 KB Output is correct
32 Correct 97 ms 174700 KB Output is correct
33 Correct 103 ms 175852 KB Output is correct
34 Correct 99 ms 175724 KB Output is correct
35 Correct 106 ms 175724 KB Output is correct
36 Correct 96 ms 174532 KB Output is correct
37 Correct 104 ms 176236 KB Output is correct
38 Correct 107 ms 176236 KB Output is correct
39 Correct 120 ms 176108 KB Output is correct
40 Correct 108 ms 176108 KB Output is correct
41 Correct 108 ms 176108 KB Output is correct
42 Correct 102 ms 175084 KB Output is correct
43 Correct 104 ms 175212 KB Output is correct
44 Correct 106 ms 175128 KB Output is correct
45 Correct 138 ms 180460 KB Output is correct
46 Correct 123 ms 179564 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 174244 KB Output is correct
2 Correct 96 ms 174316 KB Output is correct
3 Correct 96 ms 174444 KB Output is correct
4 Correct 95 ms 174316 KB Output is correct
5 Correct 97 ms 174316 KB Output is correct
6 Correct 95 ms 174316 KB Output is correct
7 Correct 100 ms 174444 KB Output is correct
8 Correct 99 ms 174316 KB Output is correct
9 Correct 96 ms 174316 KB Output is correct
10 Correct 98 ms 174316 KB Output is correct
11 Correct 96 ms 174444 KB Output is correct
12 Correct 98 ms 174316 KB Output is correct
13 Correct 96 ms 174316 KB Output is correct
14 Correct 95 ms 174444 KB Output is correct
15 Correct 99 ms 174444 KB Output is correct
16 Correct 96 ms 174316 KB Output is correct
17 Correct 96 ms 174464 KB Output is correct
18 Correct 95 ms 174572 KB Output is correct
19 Correct 100 ms 174572 KB Output is correct
20 Correct 98 ms 174444 KB Output is correct
21 Correct 98 ms 174444 KB Output is correct
22 Correct 97 ms 174444 KB Output is correct
23 Correct 95 ms 174572 KB Output is correct
24 Correct 96 ms 174572 KB Output is correct
25 Correct 96 ms 174572 KB Output is correct
26 Correct 97 ms 174572 KB Output is correct
27 Correct 98 ms 174572 KB Output is correct
28 Correct 103 ms 174700 KB Output is correct
29 Correct 98 ms 175212 KB Output is correct
30 Correct 96 ms 174700 KB Output is correct
31 Correct 98 ms 174956 KB Output is correct
32 Correct 99 ms 174700 KB Output is correct
33 Correct 117 ms 175852 KB Output is correct
34 Correct 99 ms 175724 KB Output is correct
35 Correct 107 ms 175596 KB Output is correct
36 Correct 98 ms 174572 KB Output is correct
37 Correct 107 ms 176236 KB Output is correct
38 Correct 109 ms 176236 KB Output is correct
39 Correct 106 ms 176108 KB Output is correct
40 Correct 120 ms 176108 KB Output is correct
41 Correct 107 ms 176236 KB Output is correct
42 Correct 102 ms 175084 KB Output is correct
43 Correct 103 ms 175212 KB Output is correct
44 Correct 102 ms 175212 KB Output is correct
45 Correct 137 ms 180460 KB Output is correct
46 Correct 130 ms 179564 KB Output is correct
47 Correct 113 ms 181356 KB Output is correct
48 Correct 109 ms 178284 KB Output is correct
49 Correct 108 ms 177772 KB Output is correct
50 Correct 105 ms 178044 KB Output is correct
51 Correct 117 ms 179564 KB Output is correct
52 Correct 118 ms 179948 KB Output is correct
53 Correct 110 ms 177772 KB Output is correct
54 Correct 100 ms 177132 KB Output is correct
55 Correct 99 ms 177516 KB Output is correct
56 Correct 107 ms 177516 KB Output is correct
57 Correct 105 ms 180332 KB Output is correct
58 Correct 105 ms 178284 KB Output is correct
59 Correct 107 ms 178412 KB Output is correct
60 Correct 107 ms 178668 KB Output is correct
61 Correct 108 ms 178540 KB Output is correct
62 Correct 120 ms 182508 KB Output is correct
63 Correct 401 ms 204052 KB Output is correct
64 Correct 492 ms 210112 KB Output is correct
65 Correct 731 ms 224468 KB Output is correct
66 Execution timed out 1111 ms 258236 KB Time limit exceeded
67 Halted 0 ms 0 KB -