oj.uz

Submission #666783

# Submission time Handle Problem Language Result Execution time Memory
666783 2022-11-29T17:10:07 Z rainboy Event Hopping 2 (JOI21_event2) C
32 / 100
 3000 ms 3932 KB 
#include <stdio.h>

#define N	100000
#define INF	0x3f3f3f3f

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 count(int l, int r) {
	int i, i_, k;

	k = 0;
	for (i = 0; i < n * 2 && xx[i_ = ii[i]] <= r; i++)
		if ((i_ & 1) == 1)
			if (l <= xx[i_ ^ 1])
				l = xx[i_], k++;
	return k;
}

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

	scanf("%d%d", &n, &k);
	for (i = 0; i < n * 2; i++)
		scanf("%d", &xx[i]);
	for (i = 0; i < n * 2; i++)
		ii[i] = i;
	sort(ii, 0, n * 2);
	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:80:85: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   80 |   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:91:85: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   91 |   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:117:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  117 |  scanf("%d%d", &n, &k);
      |  ^~~~~~~~~~~~~~~~~~~~~
event2.c:119:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  119 |   scanf("%d", &xx[i]);
      |   ^~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 292 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Execution timed out 3055 ms 3932 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 0 ms 224 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 296 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 296 KB Output is correct
20 Correct 0 ms 292 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 292 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 288 KB Output is correct
27 Correct 0 ms 212 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 0 ms 224 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 296 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 296 KB Output is correct
20 Correct 0 ms 292 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 292 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 288 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 8 ms 340 KB Output is correct
29 Correct 6 ms 396 KB Output is correct
30 Correct 6 ms 340 KB Output is correct
31 Correct 3 ms 304 KB Output is correct
32 Correct 2 ms 340 KB Output is correct
33 Correct 2 ms 340 KB Output is correct
34 Correct 2 ms 340 KB Output is correct
35 Correct 38 ms 436 KB Output is correct
36 Correct 34 ms 536 KB Output is correct
37 Correct 41 ms 436 KB Output is correct
38 Correct 3 ms 340 KB Output is correct
39 Correct 49 ms 416 KB Output is correct
40 Correct 42 ms 420 KB Output is correct
41 Correct 38 ms 416 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 45 ms 404 KB Output is correct
44 Correct 37 ms 452 KB Output is correct
45 Correct 28 ms 416 KB Output is correct
46 Correct 2 ms 300 KB Output is correct
47 Correct 22 ms 396 KB Output is correct
48 Correct 14 ms 340 KB Output is correct
49 Correct 9 ms 340 KB Output is correct
50 Correct 2 ms 340 KB Output is correct
51 Correct 35 ms 396 KB Output is correct
52 Correct 12 ms 416 KB Output is correct
53 Correct 3 ms 340 KB Output is correct
54 Correct 2 ms 340 KB Output is correct
55 Correct 143 ms 528 KB Output is correct
56 Correct 142 ms 408 KB Output is correct
57 Correct 129 ms 424 KB Output is correct
58 Correct 130 ms 408 KB Output is correct
59 Correct 131 ms 556 KB Output is correct
60 Correct 125 ms 416 KB Output is correct
61 Correct 118 ms 400 KB Output is correct
62 Correct 113 ms 340 KB Output is correct
63 Correct 102 ms 444 KB Output is correct
64 Correct 1 ms 304 KB Output is correct

Subtask #4
0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 292 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Execution timed out 3055 ms 3932 KB Time limit exceeded
5 Halted 0 ms 0 KB -