답안 #433305

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
433305	2021-06-19T13:42:09 Z	rainboy	Archery (IOI09_archery)	C	68 / 100	667 ms	9000 KB

archery

#include <stdio.h>

#define N	200000
#define N_	(1 << 18)	/* N_ = pow2(ceil(log2(N))) */

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

int sum[N_ * 2], pref[N_ * 2], suf[N_ * 2], n1, n_;

void pul(int i) {
	int l = i << 1, r = l | 1;

	sum[i] = sum[l] + sum[r];
	pref[i] = min(pref[l], sum[l] + pref[r]);
	suf[i] = max(suf[l] + sum[r], suf[r]);
}

void build(int n) {
	int i;

	n1 = n;
	n_ = 1;
	while (n_ < n)
		n_ <<= 1;
	for (i = 0; i < n_; i++)
		if (i < n)
			sum[n_ + i] = pref[n_ + i] = suf[n_ + i] = -1;
	for (i = n_ - 1; i > 0; i--)
		pul(i);
}

int kk[N];

void update(int i, int x) {
	i += n_;
	pref[i] = suf[i] = sum[i] += x;
	while (i > 1)
		pul(i >>= 1);
}

int query(int i) {
	int l, r, x, y;

	x = y = 0;
	for (l = n_ + 0, r = n_ + i - 1; l <= r; l >>= 1, r >>= 1)
		if ((r & 1) == 0)
			x = max(x, suf[r] + y), y += sum[r], r--;
	x = max(x, suf[1] + y);
	for (l = n_ + i, r = n_ + n_ - 1; l <= r; l >>= 1, r >>= 1)
		if ((l & 1) == 1) {
			if (x + pref[l] <= 0) {
				i = l;
				while (i < n_)
					if (x + pref[i << 1 | 0] <= 0)
						i = i << 1 | 0;
					else
						x += sum[i << 1 | 0], i = i << 1 | 1;
				return i - n_;
			} else
				x += sum[l];
			l++;
		}
	if (x + pref[1] > 0)
		return -1;
	i = 1;
	while (i < n_)
		if (x + pref[i << 1 | 0] <= 0)
			i = i << 1 | 0;
		else
			x += sum[i << 1 | 0], i = i << 1 | 1;
	return i - n_;
}

int add(int i) {
	update(i, 1), kk[i]++;
	return query(i);
}

int delete(int i) {
	int j = query(i);

	update(i, -1), kk[i]--;
	return j;
}

int main() {
	static int aa[N * 2];
	int n, r, p, p_, i, i_, a_, mn;

	scanf("%d%d", &n, &r);
	for (i = 0; i < n * 2; i++)
		scanf("%d", &aa[i]), aa[i]--;
	build(n);
	a_ = aa[0];
	if (a_ == 0)
		i_ = n - 1;
	else if (a_ > n) {
		add(n - 1 - 0);
		for (i = 0; i < n * 2; i++)
			if (aa[i] > a_)
				add(n - 1 - (i / 2));
		p_ = n, i_ = -1;
		for (i = 0; i < n; i++) {
			if (i > 0) {
				if (aa[i * 2] > a_)
					delete(n - 1 - i), add(n - 1 - (i - 1));
				aa[(i - 1) * 2] = aa[i * 2], aa[i * 2] = a_;
			}
			p = n - 1 - add(n - 1 - i), delete(n - 1 - i);
			if (p_ >= p)
				p_ = p, i_ = i;
		}
	} else {
		for (i = 0; i < n * 2; i++)
			if (aa[i] < a_)
				add(i / 2);
		mn = 0;
		while (kk[mn] == 0)
			mn++;
		p_ = n, i_ = -1;
		for (i = 0; i < n; i++) {
			if (i > 0) {
				if (aa[i * 2] < a_) {
					delete(i), add(i - 1);
					if (mn == i)
						mn--;
				}
				aa[(i - 1) * 2] = aa[i * 2], aa[i * 2] = a_;
			}
			if (i < mn) {
				p = delete(mn);
				if (kk[mn] > 0)
					p ^= delete(mn), p ^= add((mn + 1) % n), delete((mn + 1) % n), add(mn);
				add(mn);
			} else if (i > mn) {
				p = delete(mn);
				if (kk[mn] > 0)
					p ^= delete(mn), p ^= add((mn + 1) % n), delete((mn + 1) % n), add(mn);
				p ^= add(i), delete(i);
				add(mn);
			} else
				p = add((i + 1) % n), delete((i + 1) % n);
			p = (p - r % n + n) % n;
			if (p_ >= p)
				p_ = p, i_ = i;
		}
	}
	printf("%d\n", i_ + 1);
	return 0;
}

Compilation message

archery.c: In function 'main':
archery.c:91:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   91 |  scanf("%d%d", &n, &r);
      |  ^~~~~~~~~~~~~~~~~~~~~
archery.c:93:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   93 |   scanf("%d", &aa[i]), aa[i]--;
      |   ^~~~~~~~~~~~~~~~~~~

Subtask #1

4.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Incorrect	1 ms	204 KB	Output isn't correct
4	Incorrect	3 ms	332 KB	Output isn't correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct

Subtask #2

64.0 / 94.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	284 KB	Output isn't correct
2	Incorrect	1 ms	204 KB	Output isn't correct
3	Incorrect	2 ms	332 KB	Output isn't correct
4	Incorrect	26 ms	844 KB	Output isn't correct
5	Correct	352 ms	8516 KB	Output is correct
6	Incorrect	1 ms	204 KB	Output isn't correct
7	Incorrect	2 ms	332 KB	Output isn't correct
8	Correct	15 ms	844 KB	Output is correct
9	Correct	35 ms	1328 KB	Output is correct
10	Correct	1 ms	288 KB	Output is correct
11	Incorrect	40 ms	1348 KB	Output isn't correct
12	Correct	4 ms	332 KB	Output is correct
13	Incorrect	539 ms	5764 KB	Output isn't correct
14	Incorrect	13 ms	460 KB	Output isn't correct
15	Correct	117 ms	1716 KB	Output is correct
16	Incorrect	1 ms	204 KB	Output isn't correct
17	Incorrect	2 ms	332 KB	Output isn't correct
18	Correct	4 ms	332 KB	Output is correct
19	Incorrect	7 ms	460 KB	Output isn't correct
20	Incorrect	9 ms	568 KB	Output isn't correct
21	Incorrect	29 ms	1228 KB	Output isn't correct
22	Incorrect	75 ms	1652 KB	Output isn't correct
23	Correct	667 ms	8640 KB	Output is correct
24	Correct	1 ms	280 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	5 ms	552 KB	Output is correct
27	Correct	26 ms	1320 KB	Output is correct
28	Correct	163 ms	5856 KB	Output is correct
29	Correct	3 ms	332 KB	Output is correct
30	Correct	5 ms	468 KB	Output is correct
31	Correct	32 ms	1204 KB	Output is correct
32	Correct	253 ms	8524 KB	Output is correct
33	Correct	1 ms	204 KB	Output is correct
34	Correct	1 ms	204 KB	Output is correct
35	Correct	2 ms	332 KB	Output is correct
36	Correct	3 ms	332 KB	Output is correct
37	Correct	21 ms	1212 KB	Output is correct
38	Correct	30 ms	1356 KB	Output is correct
39	Correct	1 ms	204 KB	Output is correct
40	Correct	1 ms	332 KB	Output is correct
41	Correct	3 ms	332 KB	Output is correct
42	Correct	3 ms	332 KB	Output is correct
43	Correct	6 ms	588 KB	Output is correct
44	Correct	11 ms	808 KB	Output is correct
45	Correct	23 ms	1268 KB	Output is correct
46	Correct	33 ms	1364 KB	Output is correct
47	Correct	266 ms	9000 KB	Output is correct