oj.uz

답안 #527890

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
527890 2022-02-18T16:15:01 Z rainboy 코알라 (JOI13_koala) C
100 / 100
 50 ms 6088 KB 
#include <stdio.h>

#define N	100002
#define INF	0x3f3f3f3f3f3f3f3fLL

long long max(long long a, long long b) { return a > b ? a : b; }

unsigned int X = 12345;

int rand_() {
	return (X *= 3) >> 1;
}

int rr[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 (rr[ii[j]] == rr[i_])
				j++;
			else if (rr[ii[j]] < rr[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;
	}
}

void update(long long *ft, int i, int n, long long x) {
	while (i < n) {
		ft[i] = max(ft[i], x);
		i |= i + 1;
	}
}

long long query(long long *ft, int i) {
	long long x = -INF;

	while (i >= 0) {
		x = max(x, ft[i]);
		i &= i + 1, i--;
	}
	return x;
}

int main() {
	static int xx[N], bb[N], ii[N];
	static long long dp[N], ft1[N], ft2[N];
	int n, xl, xr, d, a, i, r;

	scanf("%d%d%d%d%d", &xl, &xr, &d, &a, &n);
	xx[0] = xl;
	for (i = 1; i <= n; i++)
		scanf("%d%d", &xx[i], &bb[i]);
	xx[n + 1] = xr;
	n += 2;
	for (i = 0; i < n; i++) {
		rr[i] = xx[i] % d;
		ii[i] = i;
	}
	sort(ii, 0, n);
	for (i = 0, r = 0; i < n; i++)
		rr[ii[i]] = i + 1 == n || rr[ii[i + 1]] != rr[ii[i]] ? r++ : r;
	for (i = 0; i < n; i++)
		ft1[i] = ft2[i] = -INF;
	for (i = 0; i < n; i++) {
		dp[i] = i == 0 ? 0 : max(query(ft1, rr[i] - 1) - a, query(ft2, n - 1 - rr[i])) + bb[i];
		update(ft1, rr[i], n, dp[i]);
		update(ft2, n - 1 - rr[i], n, dp[i]);
	}
	printf("%lld\n", dp[n - 1] - (long long) (xx[n - 1] / d - xx[0] / d) * a);
	return 0;
}

Compilation message

koala.c: In function 'main':
koala.c:57:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |  scanf("%d%d%d%d%d", &xl, &xr, &d, &a, &n);
      |  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
koala.c:60:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   60 |   scanf("%d%d", &xx[i], &bb[i]);
      |   ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 4080 KB Output is correct
2 Correct 30 ms 4164 KB Output is correct
3 Correct 17 ms 2844 KB Output is correct
4 Correct 33 ms 4124 KB Output is correct
5 Correct 19 ms 2616 KB Output is correct
6 Correct 11 ms 1612 KB Output is correct
7 Correct 22 ms 4092 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 4156 KB Output is correct
2 Correct 49 ms 6008 KB Output is correct
3 Correct 48 ms 6088 KB Output is correct
4 Correct 45 ms 6068 KB Output is correct
5 Correct 27 ms 3784 KB Output is correct
6 Correct 21 ms 2980 KB Output is correct