oj.uz

답안 #433132

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
433132 2021-06-18T22:30:35 Z rainboy Archery (IOI09_archery) C
40 / 100
 2000 ms 6352 KB 
#include <stdio.h>
#include <string.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 pref[N_ * 2], sum[N_ * 2], n_;

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

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

void build(int n) {
	int i;

	n_ = 1;
	while (n_ < n)
		n_ <<= 1;
	for (i = 0; i < n_; i++)
		if (i < n)
			sum[n_ + i] = pref[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] = sum[i] += x;
	while (i > 1)
		pul(i >>= 1);
}

int query(int i) {
#if 0
	int l, r, x;

	x = 0;
	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_;
			}
			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_;
#else
	int j, x;

	x = 0;
	for (j = i; j < n_; j++) {
		x += sum[n_ + j];
		if (x <= 0)
			return j;
	}
	for (j = 0; j < i; j++) {
		x += sum[n_ + j];
		if (x <= 0)
			return j;
	}
	return -1;
#endif
}

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;
}

char used[N];

int solve_losers(int *kk, int n) {
	int i, k, sum;

	memset(used, 0, n * sizeof *used);
	k = 0, sum = 0;
	for (i = n - 1; i >= 0; i--) {
		k += kk[n - 1 - i];
		if (!used[i] && k > 0)
			used[i] = 1, k--, sum ^= i;
	}
	for (i = n - 1; i >= 0; i--)
		if (!used[i] && k > 0)
			used[i] = 1, k--, sum ^= i;
	return sum;
}

int solve_winners(int *kk, int n) {
	int i, j, k, sum;

	memset(used, 0, n * sizeof *used);
	k = 0, sum = 0;
	for (i = 0; i < n; i++)
		if (kk[i] > 0) {
			k = kk[i] - 1;
			if (i == 0 && k > 0)
				used[i] = 1, k--, sum ^= i;
			break;
		}
	for (j = i + 1; j <= i + n; j++) {
		if (j != i + n)
			k += kk[j % n];
		if (!used[j % n] && k > 0)
			used[j % n] = 1, k--, sum ^= j % n;
	}
	for (j = i + 1; j <= i + n; j++)
		if (!used[j % n] && k > 0)
			used[j % n] = 1, k--, sum ^= j % n;
	return sum;
}

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 = solve_losers(kk, n), add(n - 1 - i);
			p ^= solve_losers(kk, n), 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:143:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  143 |  scanf("%d%d", &n, &r);
      |  ^~~~~~~~~~~~~~~~~~~~~
archery.c:145:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  145 |   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 2 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
36.0 / 94.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 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 20 ms 716 KB Output isn't correct
5 Execution timed out 2085 ms 5632 KB Time limit exceeded
6 Incorrect 1 ms 204 KB Output isn't correct
7 Incorrect 1 ms 332 KB Output isn't correct
8 Correct 11 ms 736 KB Output is correct
9 Incorrect 135 ms 932 KB Output isn't correct
10 Correct 1 ms 332 KB Output is correct
11 Incorrect 21 ms 972 KB Output isn't correct
12 Incorrect 3 ms 332 KB Output isn't correct
13 Incorrect 1398 ms 3960 KB Output isn't correct
14 Incorrect 8 ms 460 KB Output isn't correct
15 Incorrect 64 ms 1152 KB Output isn't correct
16 Incorrect 1 ms 204 KB Output isn't correct
17 Incorrect 2 ms 332 KB Output isn't correct
18 Incorrect 5 ms 332 KB Output isn't correct
19 Incorrect 7 ms 400 KB Output isn't correct
20 Incorrect 15 ms 468 KB Output isn't correct
21 Incorrect 32 ms 964 KB Output isn't correct
22 Incorrect 105 ms 1164 KB Output isn't correct
23 Incorrect 1404 ms 5848 KB Output isn't correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 10 ms 332 KB Output is correct
26 Correct 208 ms 468 KB Output is correct
27 Execution timed out 2075 ms 972 KB Time limit exceeded
28 Execution timed out 2071 ms 3908 KB Time limit exceeded
29 Correct 14 ms 332 KB Output is correct
30 Correct 135 ms 460 KB Output is correct
31 Execution timed out 2075 ms 872 KB Time limit exceeded
32 Execution timed out 2071 ms 6016 KB Time limit exceeded
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 25 ms 332 KB Output is correct
36 Correct 36 ms 332 KB Output is correct
37 Correct 1478 ms 1012 KB Output is correct
38 Execution timed out 2062 ms 972 KB Time limit exceeded
39 Correct 1 ms 204 KB Output is correct
40 Correct 10 ms 332 KB Output is correct
41 Correct 25 ms 380 KB Output is correct
42 Correct 36 ms 332 KB Output is correct
43 Correct 148 ms 460 KB Output is correct
44 Correct 533 ms 620 KB Output is correct
45 Execution timed out 2071 ms 944 KB Time limit exceeded
46 Execution timed out 2085 ms 972 KB Time limit exceeded
47 Execution timed out 2074 ms 6352 KB Time limit exceeded