oj.uz

답안 #768840

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
768840 2023-06-28T18:08:05 Z rainboy Segments (IZhO18_segments) C
23 / 100
 5000 ms 3424 KB 
#include <stdio.h>

#define N	200000

int min(int a, int b) { return a < b ? a : b; }
int max(int a, int b) { return a > b ? a : b; }

int ll[N], rr[N], n; char active[N];

void add(int i) {
	active[i] = 1;
}

void remove_(int i) {
	active[i] = 0;
}

int query(int l, int r, int k) {
	int i, cnt;

	cnt = 0;
	for (i = 0; i < n; i++)
		if (active[i] && rr[i] - ll[i] + 1 >= k) {
			cnt++;
			if (r - ll[i] + 1 < k)
				cnt--;
			if (rr[i] - l + 1 < k)
				cnt--;
		}
	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, k, tmp;

		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;
			ll[n] = l, rr[n] = r;
			add(n++);
		} else if (t == 2) {
			scanf("%d", &i), i--;
			remove_(i);
		} else {
			scanf("%d%d%d", &l, &r, &k);
			if (online)
				l ^= ans, r ^= ans;
			if (l > r)
				tmp = l, l = r, r = tmp;
			printf("%d\n", ans = query(l, r, k));
		}
	}
	return 0;
}

Compilation message

segments.c: In function 'main':
segments.c:36:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |  scanf("%d%d", &q, &online);
      |  ^~~~~~~~~~~~~~~~~~~~~~~~~~
segments.c:41:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |   scanf("%d", &t);
      |   ^~~~~~~~~~~~~~~
segments.c:43:4: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |    scanf("%d%d", &l, &r);
      |    ^~~~~~~~~~~~~~~~~~~~~
segments.c:51:4: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |    scanf("%d", &i), i--;
      |    ^~~~~~~~~~~~~~~
segments.c:54:4: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   54 |    scanf("%d%d%d", &l, &r, &k);
      |    ^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 3 ms 408 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 14 ms 468 KB Output is correct
6 Correct 18 ms 464 KB Output is correct
7 Correct 9 ms 436 KB Output is correct
8 Correct 11 ms 436 KB Output is correct
9 Correct 8 ms 436 KB Output is correct
10 Correct 4 ms 340 KB Output is correct
11 Correct 24 ms 456 KB Output is correct
12 Correct 27 ms 468 KB Output is correct
13 Correct 5 ms 340 KB Output is correct
14 Correct 11 ms 440 KB Output is correct
15 Correct 3 ms 340 KB Output is correct
16 Correct 4 ms 308 KB Output is correct
17 Correct 12 ms 340 KB Output is correct
18 Correct 7 ms 456 KB Output is correct
19 Correct 10 ms 424 KB Output is correct
20 Correct 9 ms 340 KB Output is correct

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5045 ms 3072 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 587 ms 2448 KB Output is correct
2 Correct 556 ms 2488 KB Output is correct
3 Correct 652 ms 2508 KB Output is correct
4 Correct 562 ms 2504 KB Output is correct
5 Correct 3634 ms 3372 KB Output is correct
6 Correct 4357 ms 3244 KB Output is correct
7 Correct 4083 ms 3364 KB Output is correct
8 Correct 941 ms 3396 KB Output is correct
9 Correct 633 ms 3324 KB Output is correct
10 Correct 1957 ms 3124 KB Output is correct
11 Correct 1265 ms 2584 KB Output is correct
12 Correct 1841 ms 3040 KB Output is correct
13 Correct 2348 ms 2972 KB Output is correct
14 Correct 3683 ms 3156 KB Output is correct
15 Correct 3873 ms 2900 KB Output is correct
16 Correct 3694 ms 2612 KB Output is correct
17 Correct 4584 ms 3256 KB Output is correct
18 Correct 4554 ms 3324 KB Output is correct
19 Correct 4701 ms 3336 KB Output is correct
20 Correct 4558 ms 3268 KB Output is correct
21 Correct 1729 ms 2524 KB Output is correct
22 Correct 3233 ms 2808 KB Output is correct
23 Correct 2656 ms 2992 KB Output is correct
24 Correct 3069 ms 2988 KB Output is correct
25 Correct 588 ms 2420 KB Output is correct
26 Correct 559 ms 2452 KB Output is correct
27 Correct 585 ms 2528 KB Output is correct
28 Correct 573 ms 2436 KB Output is correct
29 Correct 2494 ms 3096 KB Output is correct
30 Correct 2462 ms 3040 KB Output is correct
31 Correct 583 ms 3276 KB Output is correct
32 Correct 1855 ms 3216 KB Output is correct
33 Correct 2173 ms 3060 KB Output is correct
34 Correct 3821 ms 2780 KB Output is correct
35 Correct 2645 ms 2920 KB Output is correct
36 Correct 1979 ms 3044 KB Output is correct

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 569 ms 2652 KB Output is correct
2 Correct 565 ms 2712 KB Output is correct
3 Correct 570 ms 2780 KB Output is correct
4 Correct 575 ms 2712 KB Output is correct
5 Execution timed out 5056 ms 3424 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 3 ms 408 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 14 ms 468 KB Output is correct
6 Correct 18 ms 464 KB Output is correct
7 Correct 9 ms 436 KB Output is correct
8 Correct 11 ms 436 KB Output is correct
9 Correct 8 ms 436 KB Output is correct
10 Correct 4 ms 340 KB Output is correct
11 Correct 24 ms 456 KB Output is correct
12 Correct 27 ms 468 KB Output is correct
13 Correct 5 ms 340 KB Output is correct
14 Correct 11 ms 440 KB Output is correct
15 Correct 3 ms 340 KB Output is correct
16 Correct 4 ms 308 KB Output is correct
17 Correct 12 ms 340 KB Output is correct
18 Correct 7 ms 456 KB Output is correct
19 Correct 10 ms 424 KB Output is correct
20 Correct 9 ms 340 KB Output is correct
21 Execution timed out 5045 ms 3072 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 3 ms 408 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 14 ms 468 KB Output is correct
6 Correct 18 ms 464 KB Output is correct
7 Correct 9 ms 436 KB Output is correct
8 Correct 11 ms 436 KB Output is correct
9 Correct 8 ms 436 KB Output is correct
10 Correct 4 ms 340 KB Output is correct
11 Correct 24 ms 456 KB Output is correct
12 Correct 27 ms 468 KB Output is correct
13 Correct 5 ms 340 KB Output is correct
14 Correct 11 ms 440 KB Output is correct
15 Correct 3 ms 340 KB Output is correct
16 Correct 4 ms 308 KB Output is correct
17 Correct 12 ms 340 KB Output is correct
18 Correct 7 ms 456 KB Output is correct
19 Correct 10 ms 424 KB Output is correct
20 Correct 9 ms 340 KB Output is correct
21 Execution timed out 5045 ms 3072 KB Time limit exceeded
22 Halted 0 ms 0 KB -