oj.uz

답안 #666804

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
666804 2022-11-29T18:19:34 Z rainboy Event Hopping 2 (JOI21_event2) C
100 / 100
 282 ms 13716 KB 
#include <stdio.h>

#define N	100000
#define H	17	/* H = ceil(log2(N)) */
#define INF	0x7fffffff

unsigned int Z = 12345;

int rand_() {
	return (Z *= 3) >> 1;
}

int xx[N * 2], ii[N * 2], n;

void sort(int *ii, int l, int r) {
	while (l < r) {
		int i = l, j = l, k = r, i_ = ii[l + rand_() % (r - l)], tmp;

		while (j < k)
			if (xx[ii[j]] == xx[i_])
				j++;
			else if (xx[ii[j]] < xx[i_]) {
				tmp = ii[i], ii[i] = ii[j], ii[j] = tmp;
				i++, j++;
			} else {
				k--;
				tmp = ii[j], ii[j] = ii[k], ii[k] = tmp;
			}
		sort(ii, l, i);
		l = k;
	}
}

int zz[N + 1], ii_[N + 1], ll[N + 1], rr[N + 1], u_, l_, r_;

int node(int i) {
	static int _ = 1;

	zz[_] = rand_(), ii_[_] = i;
	return _++;
}

void split(int u, int i) {
	int c;

	if (u == 0) {
		u_ = l_ = r_ = 0;
		return;
	}
	c = xx[ii_[u] << 1 | 0] != xx[i << 1 | 0] ? xx[ii_[u] << 1 | 0] - xx[i << 1 | 0] : ii_[u] - i;
	if (c < 0) {
		split(rr[u], i);
		rr[u] = l_, l_ = u;
	} else if (c > 0) {
		split(ll[u], i);
		ll[u] = r_, r_ = u;
	} else {
		u_ = u, l_ = ll[u], r_ = rr[u];
		ll[u] = rr[u] = 0;
	}
}

int merge(int u, int v) {
	if (u == 0)
		return v;
	if (v == 0)
		return u;
	if (zz[u] < zz[v]) {
		rr[u] = merge(rr[u], v);
		return u;
	} else {
		ll[v] = merge(u, ll[v]);
		return v;
	}
}

int tr_lower(int i) {
	int u = u_, i_ = -1;

	while (u)
		if (xx[ii_[u] << 1 | 0] < xx[i << 1 | 0] || xx[ii_[u] << 1 | 0] == xx[i << 1 | 0] && ii_[u] < i)
			i_ = ii_[u], u = rr[u];
		else
			u = ll[u];
	return i_;
}

int tr_higher(int i) {
	int u = u_, i_ = -1;

	while (u)
		if (xx[ii_[u] << 1 | 0] > xx[i << 1 | 0] || xx[ii_[u] << 1 | 0] == xx[i << 1 | 0] && ii_[u] > i)
			i_ = ii_[u], u = ll[u];
		else
			u = rr[u];
	return i_;
}

void tr_add(int i) {
	split(u_, i);
	u_ = merge(merge(l_, node(i)), r_);
}

int ii1[N * 2 + 1], pp[H + 1][N];

int count(int l, int r) {
	int lower = -1, upper = n * 2, h, i, k;

	while (upper - lower > 1) {
		i = (lower + upper) / 2;
		if (xx[ii[i]] >= l)
			upper = i;
		else
			lower = i;
	}
	i = upper;
	if (ii1[i] == -1 || xx[ii1[i] << 1 | 1] > r)
		return 0;
	i = ii1[i];
	k = 1;
	for (h = H; h >= 0; h--)
		if (pp[h][i] != -1 && xx[pp[h][i] << 1 | 1] <= r)
			k += 1 << h, i = pp[h][i];
	return k;
}

int main() {
	int k, h, i, i_, p, q, l, r, k_, k1, k1_;

	scanf("%d%d", &n, &k);
	for (i = 0; i < n; i++) {
		scanf("%d%d", &xx[i << 1 | 0], &xx[i << 1 | 1]);
		xx[i << 1 | 0] = xx[i << 1 | 0] << 1 | 1, xx[i << 1 | 1] = xx[i << 1 | 1] << 1 | 0;
	}
	for (i = 0; i < n * 2; i++)
		ii[i] = i;
	sort(ii, 0, n * 2);
	ii1[n * 2] = -1;
	for (i = n * 2 - 1; i >= 0; i--) {
		i_ = ii[i];
		ii1[i] = ii1[i + 1];
		if ((i_ & 1) == 0) {
			if (ii1[i] == -1 || xx[ii1[i] << 1 | 1] > xx[i_ ^ 1])
				ii1[i] = i_ >> 1;
		} else
			pp[0][i_ >> 1] = ii1[i];
	}
	for (h = 1; h <= H; h++)
		for (i = 0; i < n; i++)
			pp[h][i] = pp[h - 1][i] == -1 ? -1 : pp[h - 1][pp[h - 1][i]];
	k1 = count(0, INF);
	if (k1 < k) {
		printf("-1\n");
		return 0;
	}
	for (i = 0, k_ = 0; i < n && k_ < k; i++) {
		p = tr_lower(i), q = tr_higher(i);
		l = p == -1 ? 0 : xx[p << 1 | 1], r = q == -1 ? INF : xx[q << 1 | 0];
		if (l <= xx[i << 1 | 0] && xx[i << 1 | 1] <= r) {
			k1_ = k1 - count(l, r) + count(l, xx[i << 1 | 0]) + count(xx[i << 1 | 1], r);
			if (k1_ + k_ + 1 >= k)
				printf("%d\n", i + 1), tr_add(i), k1 = k1_, k_++;
		}
	}
	return 0;
}

Compilation message

event2.c: In function 'tr_lower':
event2.c:81:85: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   81 |   if (xx[ii_[u] << 1 | 0] < xx[i << 1 | 0] || xx[ii_[u] << 1 | 0] == xx[i << 1 | 0] && ii_[u] < i)
      |                                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
event2.c: In function 'tr_higher':
event2.c:92:85: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   92 |   if (xx[ii_[u] << 1 | 0] > xx[i << 1 | 0] || xx[ii_[u] << 1 | 0] == xx[i << 1 | 0] && ii_[u] > i)
      |                                               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
event2.c: In function 'main':
event2.c:130:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  130 |  scanf("%d%d", &n, &k);
      |  ^~~~~~~~~~~~~~~~~~~~~
event2.c:132:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  132 |   scanf("%d%d", &xx[i << 1 | 0], &xx[i << 1 | 1]);
      |   ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 127 ms 11640 KB Output is correct
5 Correct 127 ms 13448 KB Output is correct
6 Correct 115 ms 13316 KB Output is correct
7 Correct 103 ms 13104 KB Output is correct
8 Correct 122 ms 13588 KB Output is correct
9 Correct 116 ms 13484 KB Output is correct
10 Correct 117 ms 13372 KB Output is correct
11 Correct 103 ms 13116 KB Output is correct
12 Correct 101 ms 12724 KB Output is correct
13 Correct 95 ms 12692 KB Output is correct
14 Correct 85 ms 12672 KB Output is correct
15 Correct 84 ms 12600 KB Output is correct
16 Correct 59 ms 11836 KB Output is correct
17 Correct 58 ms 11792 KB Output is correct
18 Correct 59 ms 11736 KB Output is correct
19 Correct 51 ms 11596 KB Output is correct
20 Correct 53 ms 11524 KB Output is correct
21 Correct 48 ms 11528 KB Output is correct
22 Correct 50 ms 11596 KB Output is correct
23 Correct 50 ms 11580 KB Output is correct
24 Correct 50 ms 11580 KB Output is correct
25 Correct 50 ms 11588 KB Output is correct
26 Correct 50 ms 11588 KB Output is correct
27 Correct 50 ms 11584 KB Output is correct
28 Correct 40 ms 11572 KB Output is correct
29 Correct 43 ms 11580 KB Output is correct
30 Correct 43 ms 11580 KB Output is correct
31 Correct 53 ms 11580 KB Output is correct
32 Correct 46 ms 11504 KB Output is correct
33 Correct 50 ms 11584 KB Output is correct
34 Correct 71 ms 12256 KB Output is correct
35 Correct 63 ms 11996 KB Output is correct
36 Correct 50 ms 11832 KB Output is correct
37 Correct 87 ms 12680 KB Output is correct
38 Correct 88 ms 12608 KB Output is correct
39 Correct 84 ms 12724 KB Output is correct
40 Correct 83 ms 12476 KB Output is correct
41 Correct 77 ms 12436 KB Output is correct
42 Correct 42 ms 11504 KB Output is correct
43 Correct 91 ms 12620 KB Output is correct
44 Correct 86 ms 12564 KB Output is correct
45 Correct 94 ms 12444 KB Output is correct
46 Correct 90 ms 12408 KB Output is correct

Subtask #2
1.0 / 1.0

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

Subtask #3
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 408 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 2 ms 596 KB Output is correct
29 Correct 2 ms 596 KB Output is correct
30 Correct 3 ms 596 KB Output is correct
31 Correct 3 ms 596 KB Output is correct
32 Correct 2 ms 596 KB Output is correct
33 Correct 2 ms 600 KB Output is correct
34 Correct 2 ms 596 KB Output is correct
35 Correct 6 ms 724 KB Output is correct
36 Correct 4 ms 724 KB Output is correct
37 Correct 4 ms 596 KB Output is correct
38 Correct 2 ms 596 KB Output is correct
39 Correct 6 ms 724 KB Output is correct
40 Correct 5 ms 724 KB Output is correct
41 Correct 5 ms 596 KB Output is correct
42 Correct 2 ms 596 KB Output is correct
43 Correct 3 ms 596 KB Output is correct
44 Correct 3 ms 596 KB Output is correct
45 Correct 3 ms 596 KB Output is correct
46 Correct 2 ms 596 KB Output is correct
47 Correct 2 ms 596 KB Output is correct
48 Correct 3 ms 596 KB Output is correct
49 Correct 2 ms 596 KB Output is correct
50 Correct 2 ms 596 KB Output is correct
51 Correct 2 ms 596 KB Output is correct
52 Correct 2 ms 596 KB Output is correct
53 Correct 2 ms 596 KB Output is correct
54 Correct 2 ms 596 KB Output is correct
55 Correct 4 ms 724 KB Output is correct
56 Correct 3 ms 676 KB Output is correct
57 Correct 5 ms 684 KB Output is correct
58 Correct 3 ms 724 KB Output is correct
59 Correct 3 ms 724 KB Output is correct
60 Correct 4 ms 724 KB Output is correct
61 Correct 4 ms 724 KB Output is correct
62 Correct 3 ms 724 KB Output is correct
63 Correct 3 ms 724 KB Output is correct
64 Correct 2 ms 596 KB Output is correct

Subtask #4
61.0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 127 ms 11640 KB Output is correct
5 Correct 127 ms 13448 KB Output is correct
6 Correct 115 ms 13316 KB Output is correct
7 Correct 103 ms 13104 KB Output is correct
8 Correct 122 ms 13588 KB Output is correct
9 Correct 116 ms 13484 KB Output is correct
10 Correct 117 ms 13372 KB Output is correct
11 Correct 103 ms 13116 KB Output is correct
12 Correct 101 ms 12724 KB Output is correct
13 Correct 95 ms 12692 KB Output is correct
14 Correct 85 ms 12672 KB Output is correct
15 Correct 84 ms 12600 KB Output is correct
16 Correct 59 ms 11836 KB Output is correct
17 Correct 58 ms 11792 KB Output is correct
18 Correct 59 ms 11736 KB Output is correct
19 Correct 51 ms 11596 KB Output is correct
20 Correct 53 ms 11524 KB Output is correct
21 Correct 48 ms 11528 KB Output is correct
22 Correct 50 ms 11596 KB Output is correct
23 Correct 50 ms 11580 KB Output is correct
24 Correct 50 ms 11580 KB Output is correct
25 Correct 50 ms 11588 KB Output is correct
26 Correct 50 ms 11588 KB Output is correct
27 Correct 50 ms 11584 KB Output is correct
28 Correct 40 ms 11572 KB Output is correct
29 Correct 43 ms 11580 KB Output is correct
30 Correct 43 ms 11580 KB Output is correct
31 Correct 53 ms 11580 KB Output is correct
32 Correct 46 ms 11504 KB Output is correct
33 Correct 50 ms 11584 KB Output is correct
34 Correct 71 ms 12256 KB Output is correct
35 Correct 63 ms 11996 KB Output is correct
36 Correct 50 ms 11832 KB Output is correct
37 Correct 87 ms 12680 KB Output is correct
38 Correct 88 ms 12608 KB Output is correct
39 Correct 84 ms 12724 KB Output is correct
40 Correct 83 ms 12476 KB Output is correct
41 Correct 77 ms 12436 KB Output is correct
42 Correct 42 ms 11504 KB Output is correct
43 Correct 91 ms 12620 KB Output is correct
44 Correct 86 ms 12564 KB Output is correct
45 Correct 94 ms 12444 KB Output is correct
46 Correct 90 ms 12408 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 0 ms 340 KB Output is correct
50 Correct 0 ms 340 KB Output is correct
51 Correct 0 ms 340 KB Output is correct
52 Correct 0 ms 340 KB Output is correct
53 Correct 0 ms 408 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 0 ms 340 KB Output is correct
56 Correct 0 ms 340 KB Output is correct
57 Correct 0 ms 340 KB Output is correct
58 Correct 0 ms 340 KB Output is correct
59 Correct 0 ms 340 KB Output is correct
60 Correct 0 ms 340 KB Output is correct
61 Correct 0 ms 340 KB Output is correct
62 Correct 0 ms 340 KB Output is correct
63 Correct 1 ms 340 KB Output is correct
64 Correct 1 ms 340 KB Output is correct
65 Correct 0 ms 340 KB Output is correct
66 Correct 1 ms 340 KB Output is correct
67 Correct 0 ms 340 KB Output is correct
68 Correct 0 ms 340 KB Output is correct
69 Correct 0 ms 340 KB Output is correct
70 Correct 0 ms 340 KB Output is correct
71 Correct 0 ms 340 KB Output is correct
72 Correct 0 ms 340 KB Output is correct
73 Correct 0 ms 340 KB Output is correct
74 Correct 2 ms 596 KB Output is correct
75 Correct 2 ms 596 KB Output is correct
76 Correct 3 ms 596 KB Output is correct
77 Correct 3 ms 596 KB Output is correct
78 Correct 2 ms 596 KB Output is correct
79 Correct 2 ms 600 KB Output is correct
80 Correct 2 ms 596 KB Output is correct
81 Correct 6 ms 724 KB Output is correct
82 Correct 4 ms 724 KB Output is correct
83 Correct 4 ms 596 KB Output is correct
84 Correct 2 ms 596 KB Output is correct
85 Correct 6 ms 724 KB Output is correct
86 Correct 5 ms 724 KB Output is correct
87 Correct 5 ms 596 KB Output is correct
88 Correct 2 ms 596 KB Output is correct
89 Correct 3 ms 596 KB Output is correct
90 Correct 3 ms 596 KB Output is correct
91 Correct 3 ms 596 KB Output is correct
92 Correct 2 ms 596 KB Output is correct
93 Correct 2 ms 596 KB Output is correct
94 Correct 3 ms 596 KB Output is correct
95 Correct 2 ms 596 KB Output is correct
96 Correct 2 ms 596 KB Output is correct
97 Correct 2 ms 596 KB Output is correct
98 Correct 2 ms 596 KB Output is correct
99 Correct 2 ms 596 KB Output is correct
100 Correct 2 ms 596 KB Output is correct
101 Correct 4 ms 724 KB Output is correct
102 Correct 3 ms 676 KB Output is correct
103 Correct 5 ms 684 KB Output is correct
104 Correct 3 ms 724 KB Output is correct
105 Correct 3 ms 724 KB Output is correct
106 Correct 4 ms 724 KB Output is correct
107 Correct 4 ms 724 KB Output is correct
108 Correct 3 ms 724 KB Output is correct
109 Correct 3 ms 724 KB Output is correct
110 Correct 2 ms 596 KB Output is correct
111 Correct 71 ms 11616 KB Output is correct
112 Correct 71 ms 11576 KB Output is correct
113 Correct 72 ms 11492 KB Output is correct
114 Correct 69 ms 11556 KB Output is correct
115 Correct 58 ms 11500 KB Output is correct
116 Correct 61 ms 11548 KB Output is correct
117 Correct 56 ms 11580 KB Output is correct
118 Correct 282 ms 13504 KB Output is correct
119 Correct 262 ms 13360 KB Output is correct
120 Correct 175 ms 12636 KB Output is correct
121 Correct 59 ms 11576 KB Output is correct
122 Correct 218 ms 12752 KB Output is correct
123 Correct 200 ms 12748 KB Output is correct
124 Correct 173 ms 12492 KB Output is correct
125 Correct 62 ms 11512 KB Output is correct
126 Correct 125 ms 11832 KB Output is correct
127 Correct 112 ms 11764 KB Output is correct
128 Correct 108 ms 11700 KB Output is correct
129 Correct 65 ms 11576 KB Output is correct
130 Correct 95 ms 11576 KB Output is correct
131 Correct 86 ms 11656 KB Output is correct
132 Correct 79 ms 11560 KB Output is correct
133 Correct 57 ms 11572 KB Output is correct
134 Correct 84 ms 11620 KB Output is correct
135 Correct 78 ms 11584 KB Output is correct
136 Correct 68 ms 11584 KB Output is correct
137 Correct 57 ms 11584 KB Output is correct
138 Correct 75 ms 11508 KB Output is correct
139 Correct 65 ms 11576 KB Output is correct
140 Correct 57 ms 11616 KB Output is correct
141 Correct 59 ms 11612 KB Output is correct
142 Correct 127 ms 13692 KB Output is correct
143 Correct 128 ms 13700 KB Output is correct
144 Correct 128 ms 13624 KB Output is correct
145 Correct 129 ms 13660 KB Output is correct
146 Correct 124 ms 13608 KB Output is correct
147 Correct 125 ms 13652 KB Output is correct
148 Correct 125 ms 13596 KB Output is correct
149 Correct 119 ms 13500 KB Output is correct
150 Correct 116 ms 13520 KB Output is correct
151 Correct 109 ms 13248 KB Output is correct
152 Correct 43 ms 11524 KB Output is correct
153 Correct 131 ms 13636 KB Output is correct
154 Correct 139 ms 13716 KB Output is correct
155 Correct 124 ms 13644 KB Output is correct
156 Correct 126 ms 13620 KB Output is correct
157 Correct 132 ms 13484 KB Output is correct
158 Correct 127 ms 13500 KB Output is correct
159 Correct 113 ms 13240 KB Output is correct
160 Correct 42 ms 11596 KB Output is correct
161 Correct 195 ms 12668 KB Output is correct
162 Correct 182 ms 12748 KB Output is correct
163 Correct 175 ms 12604 KB Output is correct
164 Correct 163 ms 12476 KB Output is correct
165 Correct 158 ms 12544 KB Output is correct
166 Correct 41 ms 11564 KB Output is correct
167 Correct 87 ms 12584 KB Output is correct
168 Correct 88 ms 12528 KB Output is correct
169 Correct 90 ms 12460 KB Output is correct
170 Correct 85 ms 12460 KB Output is correct
171 Correct 88 ms 11944 KB Output is correct
172 Correct 96 ms 12672 KB Output is correct
173 Correct 224 ms 12580 KB Output is correct
174 Correct 204 ms 12604 KB Output is correct
175 Correct 205 ms 12592 KB Output is correct
176 Correct 173 ms 12448 KB Output is correct