oj.uz

Submission #768856

# Submission time Handle Problem Language Result Execution time Memory
768856 2023-06-28T19:17:08 Z rainboy Segments (IZhO18_segments) C
75 / 100
 5000 ms 5796 KB 
#include <stdio.h>
 
#define N	200000
#define K	1000
#define M	((N + K - 1) / K)
 
int min(int a, int b) { return a < b ? a : b; }
int max(int a, int b) { return a > b ? a : b; }
 
unsigned int X = 12345;
 
int rand_() {
	return (X *= 3) >> 1;
}
 
int ll[N], rr[N], ss[N], n;
 
int compare_l(int i, int j) { return ll[i] - ll[j]; }
int compare_r(int i, int j) { return rr[i] - rr[j]; }
 
int ii1[M], iii[M][K * 2], iiil[M][K * 2], iiir[M][K * 2], kk[M];
 
int (*compare)(int, int);
 
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) {
			int c = compare(ii[j], i_);
 
			if (c == 0)
				j++;
			else if (c < 0) {
				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;
	}
}
 
void build() {
	static int ii_[N];
	int n_, g, h, l, r;
 
	n_ = 0;
	for (g = 0; g < M; g++)
		for (h = 0; h < kk[g]; h++)
			ii_[n_++] = iii[g][h];
	for (g = 0; g < M; g++) {
		l = min(g * K, n_), r = min((g + 1) * K, n_), kk[g] = r - l;
		for (h = 0; h < kk[g]; h++)
			iii[g][h] = iiil[g][h] = iiir[g][h] = ii_[l + h];
		ii1[g] = kk[g] == 0 ? -1 : ii_[l];
		compare = compare_l, sort(iiil[g], 0, kk[g]);
		compare = compare_r, sort(iiir[g], 0, kk[g]);
	}
}
 
void add(int l, int r) {
	int g, h, i;
 
	i = n++;
	ll[i] = l, rr[i] = r, ss[i] = r - l + 1;
	for (g = 1; g < M; g++)
		if (ii1[g] == -1 || ss[i] < ss[ii1[g]])
			break;
	g--;
	for (h = kk[g]; h > 0 && ss[i] < ss[iii[g][h - 1]]; h--)
		iii[g][h] = iii[g][h - 1];
	iii[g][h] = i;
	for (h = kk[g]; h > 0 && ll[i] < ll[iiil[g][h - 1]]; h--)
		iiil[g][h] = iiil[g][h - 1];
	iiil[g][h] = i;
	for (h = kk[g]; h > 0 && rr[i] < rr[iiir[g][h - 1]]; h--)
		iiir[g][h] = iiir[g][h - 1];
	iiir[g][h] = i;
	kk[g]++;
}
 
void remove_(int i) {
	int g, h;
 
	for (g = 1; g < M; g++)
		if (ii1[g] == -1 || ss[i] < ss[ii1[g]] || ss[i] == ss[ii1[g]] && i < ii1[g])
			break;
	g--;
	for (h = 0; h < kk[g]; h++)
		if (iii[g][h] == i) {
			while (h + 1 < kk[g])
				iii[g][h] = iii[g][h + 1], h++;
			break;
		}
	for (h = 0; h < kk[g]; h++)
		if (iiil[g][h] == i) {
			while (h + 1 < kk[g])
				iiil[g][h] = iiil[g][h + 1], h++;
			break;
		}
	for (h = 0; h < kk[g]; h++)
		if (iiir[g][h] == i) {
			while (h + 1 < kk[g])
				iiir[g][h] = iiir[g][h + 1], h++;
			break;
		}
	kk[g]--;
}
 
int query(int l, int r, int s) {
	int g, h, i, cnt, lower, upper;
 
	if (r - l + 1 < s)
		return 0;
	cnt = 0;
	for (g = M - 1; g >= 0; g--)
		if (g > 0 && (ii1[g] == -1 || ss[ii1[g]] >= s)) {
			cnt += kk[g];
			lower = -1, upper = kk[g];
			while (upper - lower > 1) {
				h = (lower + upper) / 2;
				if (r - ll[iiil[g][h]] + 1 >= s)
					lower = h;
				else
					upper = h;
			}
			cnt -= kk[g] - upper;
			lower = -1, upper = kk[g];
			while (upper - lower > 1) {
				h = (lower + upper) / 2;
				if (rr[iiir[g][h]] - l + 1 >= s)
					upper = h;
				else
					lower = h;
			}
			cnt -= upper;
		} else {
			for (h = 0; h < kk[g]; h++) {
				i = iii[g][h];
				if (min(rr[i], r) - max(ll[i], l) + 1 >= s)
					cnt++;
			}
			break;
		}
	return cnt;
}
 
int main() {
	int q, online, h, i, ans;
 
	scanf("%d%d", &q, &online);
	ans = 0;
	for (h = 0; h < q; h++) {
		int t, l, r, s, tmp;
 
		if (h % K == 0)
			build();
		scanf("%d", &t);
		if (t == 1) {
			scanf("%d%d", &l, &r);
			if (online)
				l ^= ans, r ^= ans;
			if (l > r)
				tmp = l, l = r, r = tmp;
			add(l, r);
		} else if (t == 2) {
			scanf("%d", &i), i--;
			remove_(i);
		} else {
			scanf("%d%d%d", &l, &r, &s);
			if (online)
				l ^= ans, r ^= ans;
			if (l > r)
				tmp = l, l = r, r = tmp;
			printf("%d\n", ans = query(l, r, s));
		}
	}
	return 0;
}

Compilation message

segments.c: In function 'remove_':
segments.c:90:65: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   90 |   if (ii1[g] == -1 || ss[i] < ss[ii1[g]] || ss[i] == ss[ii1[g]] && i < ii1[g])
      |                                             ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
segments.c: In function 'main':
segments.c:155:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  155 |  scanf("%d%d", &q, &online);
      |  ^~~~~~~~~~~~~~~~~~~~~~~~~~
segments.c:162:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  162 |   scanf("%d", &t);
      |   ^~~~~~~~~~~~~~~
segments.c:164:4: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  164 |    scanf("%d%d", &l, &r);
      |    ^~~~~~~~~~~~~~~~~~~~~
segments.c:171:4: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  171 |    scanf("%d", &i), i--;
      |    ^~~~~~~~~~~~~~~
segments.c:174:4: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  174 |    scanf("%d%d%d", &l, &r, &s);
      |    ^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 3 ms 340 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 11 ms 400 KB Output is correct
6 Correct 12 ms 468 KB Output is correct
7 Correct 7 ms 364 KB Output is correct
8 Correct 11 ms 340 KB Output is correct
9 Correct 10 ms 340 KB Output is correct
10 Correct 10 ms 468 KB Output is correct
11 Correct 12 ms 428 KB Output is correct
12 Correct 12 ms 404 KB Output is correct
13 Correct 11 ms 488 KB Output is correct
14 Correct 13 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 3 ms 340 KB Output is correct
17 Correct 9 ms 340 KB Output is correct
18 Correct 10 ms 404 KB Output is correct
19 Correct 9 ms 340 KB Output is correct
20 Correct 9 ms 340 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1308 ms 2532 KB Output is correct
2 Correct 1318 ms 2508 KB Output is correct
3 Correct 1319 ms 2500 KB Output is correct
4 Correct 1359 ms 2696 KB Output is correct
5 Correct 1218 ms 4000 KB Output is correct
6 Correct 1164 ms 4184 KB Output is correct
7 Correct 1330 ms 2520 KB Output is correct
8 Correct 1351 ms 2636 KB Output is correct
9 Correct 1327 ms 2500 KB Output is correct
10 Correct 781 ms 1408 KB Output is correct
11 Correct 1045 ms 1744 KB Output is correct
12 Correct 1473 ms 3164 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 772 KB Output is correct
2 Correct 50 ms 720 KB Output is correct
3 Correct 131 ms 852 KB Output is correct
4 Correct 52 ms 716 KB Output is correct
5 Correct 1531 ms 3320 KB Output is correct
6 Correct 1592 ms 2924 KB Output is correct
7 Correct 1560 ms 3068 KB Output is correct
8 Correct 1277 ms 4016 KB Output is correct
9 Correct 1166 ms 3844 KB Output is correct
10 Correct 1199 ms 2944 KB Output is correct
11 Correct 268 ms 932 KB Output is correct
12 Correct 1200 ms 3092 KB Output is correct
13 Correct 1132 ms 2848 KB Output is correct
14 Correct 789 ms 2020 KB Output is correct
15 Correct 733 ms 1680 KB Output is correct
16 Correct 545 ms 1412 KB Output is correct
17 Correct 1436 ms 2596 KB Output is correct
18 Correct 1438 ms 2544 KB Output is correct
19 Correct 1479 ms 2664 KB Output is correct
20 Correct 1484 ms 2632 KB Output is correct
21 Correct 316 ms 1036 KB Output is correct
22 Correct 942 ms 2072 KB Output is correct
23 Correct 1092 ms 2492 KB Output is correct
24 Correct 950 ms 2132 KB Output is correct
25 Correct 73 ms 716 KB Output is correct
26 Correct 59 ms 744 KB Output is correct
27 Correct 72 ms 720 KB Output is correct
28 Correct 62 ms 712 KB Output is correct
29 Correct 1170 ms 2624 KB Output is correct
30 Correct 1173 ms 2676 KB Output is correct
31 Correct 1211 ms 3920 KB Output is correct
32 Correct 1248 ms 3044 KB Output is correct
33 Correct 1149 ms 2836 KB Output is correct
34 Correct 691 ms 1668 KB Output is correct
35 Correct 1047 ms 2440 KB Output is correct
36 Correct 1177 ms 2936 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 724 KB Output is correct
2 Correct 53 ms 712 KB Output is correct
3 Correct 52 ms 756 KB Output is correct
4 Correct 64 ms 804 KB Output is correct
5 Correct 1388 ms 3480 KB Output is correct
6 Correct 641 ms 1196 KB Output is correct
7 Correct 1349 ms 3524 KB Output is correct
8 Correct 804 ms 1600 KB Output is correct
9 Correct 902 ms 2024 KB Output is correct
10 Correct 1206 ms 3208 KB Output is correct
11 Correct 463 ms 1204 KB Output is correct
12 Correct 1135 ms 4048 KB Output is correct
13 Correct 1144 ms 2892 KB Output is correct
14 Correct 816 ms 1892 KB Output is correct
15 Correct 1177 ms 3792 KB Output is correct
16 Correct 1152 ms 2912 KB Output is correct
17 Correct 1360 ms 2468 KB Output is correct
18 Correct 1342 ms 2528 KB Output is correct
19 Correct 1329 ms 2408 KB Output is correct
20 Correct 1299 ms 2476 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 3 ms 340 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 11 ms 400 KB Output is correct
6 Correct 12 ms 468 KB Output is correct
7 Correct 7 ms 364 KB Output is correct
8 Correct 11 ms 340 KB Output is correct
9 Correct 10 ms 340 KB Output is correct
10 Correct 10 ms 468 KB Output is correct
11 Correct 12 ms 428 KB Output is correct
12 Correct 12 ms 404 KB Output is correct
13 Correct 11 ms 488 KB Output is correct
14 Correct 13 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 3 ms 340 KB Output is correct
17 Correct 9 ms 340 KB Output is correct
18 Correct 10 ms 404 KB Output is correct
19 Correct 9 ms 340 KB Output is correct
20 Correct 9 ms 340 KB Output is correct
21 Correct 1308 ms 2532 KB Output is correct
22 Correct 1318 ms 2508 KB Output is correct
23 Correct 1319 ms 2500 KB Output is correct
24 Correct 1359 ms 2696 KB Output is correct
25 Correct 1218 ms 4000 KB Output is correct
26 Correct 1164 ms 4184 KB Output is correct
27 Correct 1330 ms 2520 KB Output is correct
28 Correct 1351 ms 2636 KB Output is correct
29 Correct 1327 ms 2500 KB Output is correct
30 Correct 781 ms 1408 KB Output is correct
31 Correct 1045 ms 1744 KB Output is correct
32 Correct 1473 ms 3164 KB Output is correct
33 Correct 51 ms 724 KB Output is correct
34 Correct 53 ms 712 KB Output is correct
35 Correct 52 ms 756 KB Output is correct
36 Correct 64 ms 804 KB Output is correct
37 Correct 1388 ms 3480 KB Output is correct
38 Correct 641 ms 1196 KB Output is correct
39 Correct 1349 ms 3524 KB Output is correct
40 Correct 804 ms 1600 KB Output is correct
41 Correct 902 ms 2024 KB Output is correct
42 Correct 1206 ms 3208 KB Output is correct
43 Correct 463 ms 1204 KB Output is correct
44 Correct 1135 ms 4048 KB Output is correct
45 Correct 1144 ms 2892 KB Output is correct
46 Correct 816 ms 1892 KB Output is correct
47 Correct 1177 ms 3792 KB Output is correct
48 Correct 1152 ms 2912 KB Output is correct
49 Correct 1360 ms 2468 KB Output is correct
50 Correct 1342 ms 2528 KB Output is correct
51 Correct 1329 ms 2408 KB Output is correct
52 Correct 1299 ms 2476 KB Output is correct
53 Correct 64 ms 800 KB Output is correct
54 Correct 67 ms 736 KB Output is correct
55 Correct 52 ms 724 KB Output is correct
56 Correct 53 ms 716 KB Output is correct
57 Correct 1048 ms 2024 KB Output is correct
58 Correct 527 ms 1084 KB Output is correct
59 Correct 1435 ms 2864 KB Output is correct
60 Correct 486 ms 996 KB Output is correct
61 Correct 1099 ms 2728 KB Output is correct
62 Correct 1229 ms 3804 KB Output is correct
63 Correct 1192 ms 3984 KB Output is correct
64 Correct 1165 ms 3656 KB Output is correct
65 Correct 597 ms 1532 KB Output is correct
66 Correct 517 ms 1344 KB Output is correct
67 Correct 1196 ms 3080 KB Output is correct
68 Correct 1058 ms 2352 KB Output is correct
69 Correct 1325 ms 2588 KB Output is correct
70 Correct 1426 ms 2600 KB Output is correct
71 Correct 1322 ms 2476 KB Output is correct
72 Correct 1380 ms 2580 KB Output is correct
73 Correct 662 ms 1524 KB Output is correct
74 Correct 1010 ms 2484 KB Output is correct
75 Correct 1119 ms 4040 KB Output is correct
76 Correct 1136 ms 4040 KB Output is correct
77 Correct 57 ms 732 KB Output is correct
78 Correct 56 ms 780 KB Output is correct
79 Correct 63 ms 776 KB Output is correct
80 Correct 54 ms 688 KB Output is correct
81 Correct 976 ms 2332 KB Output is correct
82 Correct 657 ms 1556 KB Output is correct
83 Correct 448 ms 1160 KB Output is correct
84 Correct 1010 ms 2484 KB Output is correct
85 Correct 1195 ms 3096 KB Output is correct
86 Correct 1226 ms 2980 KB Output is correct
87 Correct 873 ms 2048 KB Output is correct
88 Correct 473 ms 1312 KB Output is correct

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 3 ms 340 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 11 ms 400 KB Output is correct
6 Correct 12 ms 468 KB Output is correct
7 Correct 7 ms 364 KB Output is correct
8 Correct 11 ms 340 KB Output is correct
9 Correct 10 ms 340 KB Output is correct
10 Correct 10 ms 468 KB Output is correct
11 Correct 12 ms 428 KB Output is correct
12 Correct 12 ms 404 KB Output is correct
13 Correct 11 ms 488 KB Output is correct
14 Correct 13 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 3 ms 340 KB Output is correct
17 Correct 9 ms 340 KB Output is correct
18 Correct 10 ms 404 KB Output is correct
19 Correct 9 ms 340 KB Output is correct
20 Correct 9 ms 340 KB Output is correct
21 Correct 1308 ms 2532 KB Output is correct
22 Correct 1318 ms 2508 KB Output is correct
23 Correct 1319 ms 2500 KB Output is correct
24 Correct 1359 ms 2696 KB Output is correct
25 Correct 1218 ms 4000 KB Output is correct
26 Correct 1164 ms 4184 KB Output is correct
27 Correct 1330 ms 2520 KB Output is correct
28 Correct 1351 ms 2636 KB Output is correct
29 Correct 1327 ms 2500 KB Output is correct
30 Correct 781 ms 1408 KB Output is correct
31 Correct 1045 ms 1744 KB Output is correct
32 Correct 1473 ms 3164 KB Output is correct
33 Correct 68 ms 772 KB Output is correct
34 Correct 50 ms 720 KB Output is correct
35 Correct 131 ms 852 KB Output is correct
36 Correct 52 ms 716 KB Output is correct
37 Correct 1531 ms 3320 KB Output is correct
38 Correct 1592 ms 2924 KB Output is correct
39 Correct 1560 ms 3068 KB Output is correct
40 Correct 1277 ms 4016 KB Output is correct
41 Correct 1166 ms 3844 KB Output is correct
42 Correct 1199 ms 2944 KB Output is correct
43 Correct 268 ms 932 KB Output is correct
44 Correct 1200 ms 3092 KB Output is correct
45 Correct 1132 ms 2848 KB Output is correct
46 Correct 789 ms 2020 KB Output is correct
47 Correct 733 ms 1680 KB Output is correct
48 Correct 545 ms 1412 KB Output is correct
49 Correct 1436 ms 2596 KB Output is correct
50 Correct 1438 ms 2544 KB Output is correct
51 Correct 1479 ms 2664 KB Output is correct
52 Correct 1484 ms 2632 KB Output is correct
53 Correct 316 ms 1036 KB Output is correct
54 Correct 942 ms 2072 KB Output is correct
55 Correct 1092 ms 2492 KB Output is correct
56 Correct 950 ms 2132 KB Output is correct
57 Correct 73 ms 716 KB Output is correct
58 Correct 59 ms 744 KB Output is correct
59 Correct 72 ms 720 KB Output is correct
60 Correct 62 ms 712 KB Output is correct
61 Correct 1170 ms 2624 KB Output is correct
62 Correct 1173 ms 2676 KB Output is correct
63 Correct 1211 ms 3920 KB Output is correct
64 Correct 1248 ms 3044 KB Output is correct
65 Correct 1149 ms 2836 KB Output is correct
66 Correct 691 ms 1668 KB Output is correct
67 Correct 1047 ms 2440 KB Output is correct
68 Correct 1177 ms 2936 KB Output is correct
69 Correct 51 ms 724 KB Output is correct
70 Correct 53 ms 712 KB Output is correct
71 Correct 52 ms 756 KB Output is correct
72 Correct 64 ms 804 KB Output is correct
73 Correct 1388 ms 3480 KB Output is correct
74 Correct 641 ms 1196 KB Output is correct
75 Correct 1349 ms 3524 KB Output is correct
76 Correct 804 ms 1600 KB Output is correct
77 Correct 902 ms 2024 KB Output is correct
78 Correct 1206 ms 3208 KB Output is correct
79 Correct 463 ms 1204 KB Output is correct
80 Correct 1135 ms 4048 KB Output is correct
81 Correct 1144 ms 2892 KB Output is correct
82 Correct 816 ms 1892 KB Output is correct
83 Correct 1177 ms 3792 KB Output is correct
84 Correct 1152 ms 2912 KB Output is correct
85 Correct 1360 ms 2468 KB Output is correct
86 Correct 1342 ms 2528 KB Output is correct
87 Correct 1329 ms 2408 KB Output is correct
88 Correct 1299 ms 2476 KB Output is correct
89 Correct 64 ms 800 KB Output is correct
90 Correct 67 ms 736 KB Output is correct
91 Correct 52 ms 724 KB Output is correct
92 Correct 53 ms 716 KB Output is correct
93 Correct 1048 ms 2024 KB Output is correct
94 Correct 527 ms 1084 KB Output is correct
95 Correct 1435 ms 2864 KB Output is correct
96 Correct 486 ms 996 KB Output is correct
97 Correct 1099 ms 2728 KB Output is correct
98 Correct 1229 ms 3804 KB Output is correct
99 Correct 1192 ms 3984 KB Output is correct
100 Correct 1165 ms 3656 KB Output is correct
101 Correct 597 ms 1532 KB Output is correct
102 Correct 517 ms 1344 KB Output is correct
103 Correct 1196 ms 3080 KB Output is correct
104 Correct 1058 ms 2352 KB Output is correct
105 Correct 1325 ms 2588 KB Output is correct
106 Correct 1426 ms 2600 KB Output is correct
107 Correct 1322 ms 2476 KB Output is correct
108 Correct 1380 ms 2580 KB Output is correct
109 Correct 662 ms 1524 KB Output is correct
110 Correct 1010 ms 2484 KB Output is correct
111 Correct 1119 ms 4040 KB Output is correct
112 Correct 1136 ms 4040 KB Output is correct
113 Correct 57 ms 732 KB Output is correct
114 Correct 56 ms 780 KB Output is correct
115 Correct 63 ms 776 KB Output is correct
116 Correct 54 ms 688 KB Output is correct
117 Correct 976 ms 2332 KB Output is correct
118 Correct 657 ms 1556 KB Output is correct
119 Correct 448 ms 1160 KB Output is correct
120 Correct 1010 ms 2484 KB Output is correct
121 Correct 1195 ms 3096 KB Output is correct
122 Correct 1226 ms 2980 KB Output is correct
123 Correct 873 ms 2048 KB Output is correct
124 Correct 473 ms 1312 KB Output is correct
125 Correct 121 ms 1228 KB Output is correct
126 Correct 130 ms 1268 KB Output is correct
127 Correct 184 ms 1308 KB Output is correct
128 Correct 143 ms 1244 KB Output is correct
129 Correct 114 ms 1184 KB Output is correct
130 Correct 148 ms 1204 KB Output is correct
131 Correct 1684 ms 1940 KB Output is correct
132 Correct 4888 ms 4404 KB Output is correct
133 Execution timed out 5036 ms 5796 KB Time limit exceeded
134 Halted 0 ms 0 KB -