oj.uz

답안 #503376

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
503376 2022-01-07T18:31:46 Z rainboy Akcija (COCI21_akcija) C
50 / 110
 442 ms 476 KB 
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define N	2000
#define K	2000
#define S	2000000000002LL

unsigned int X = 12345;

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

int ww[N], *ei[N], eo[N], n; char banned[N];

void append(int d, int i) {
	int o = eo[d]++;

	if (o >= 2 && (o & o - 1) == 0)
		ei[d] = (int *) realloc(ei[d], o * 2 * sizeof *ei[d]);
	ei[d][o] = i;
}

int cc[K], k_, k; long long ss[K];

void sort(int *hh, int l, int r) {
	while (l < r) {
		int i = l, j = l, k = r, h = hh[l + rand_() % (r - l)], tmp;

		while (j < k)
			if (cc[hh[j]] == cc[h] && ss[hh[j]] == ss[h])
				j++;
			else if (cc[hh[j]] > cc[h] || cc[hh[j]] == cc[h] && ss[hh[j]] < ss[h]) {
				tmp = hh[i], hh[i] = hh[j], hh[j] = tmp;
				i++, j++;
			} else {
				k--;
				tmp = hh[j], hh[j] = hh[k], hh[k] = tmp;
			}
		sort(hh, l, i);
		l = k;
	}
}

int iq[1 + N], pq[N], cnt;

int lt(int i, int j) { return ww[i] < ww[j]; }

int p2(int p) {
	return (p *= 2) > cnt ? 0 : (p < cnt && lt(iq[p + 1], iq[p]) ? p + 1 : p);
}

void pq_up(int i) {
	int p, q, j;

	for (p = pq[i]; (q = p / 2) && lt(i, j = iq[q]); p = q)
		iq[pq[j] = p] = j;
	iq[pq[i] = p] = i;
}

void pq_dn(int i) {
	int p, q, j;

	for (p = pq[i]; (q = p2(p)) && lt(j = iq[q], i); p = q)
		iq[pq[j] = p] = j;
	iq[pq[i] = p] = i;
}

void pq_add(int i) {
	pq[i] = ++cnt, pq_up(i);
}

int pq_remove_first() {
	int i = iq[1], j = iq[cnt--];

	if (j != i)
		pq[j] = 1, pq_dn(j);
	pq[i] = 0;
	return i;
}

void simulate(char *used, int *c__, long long *s__) {
	int i, d, o, c_;
	long long s_;

	memset(pq, 0, n * sizeof *pq), cnt = 0;
	memset(used, 0, n * sizeof *used);
	c_ = s_ = 0;
	for (d = n - 1; d >= 0; d--) {
		for (o = eo[d]; o--; ) {
			i = ei[d][o];
			if (!banned[i])
				pq_add(i);
		}
		if (cnt) {
			i = pq_remove_first();
			c_++, s_ += ww[i], used[i] = 1;
		}
	}
	*c__ = c_, *s__ = s_;
}

char used[N + 1][N];

int branch(int i, int n, int c_, long long s_) {
	int c, j;
	long long s;

	simulate(used[i], &c, &s);
	if (c < c_ || c == c_ && s > s_)
		return 0;
	cc[k_] = c, ss[k_] = s;
	if (++k_ == k)
		return 1;
	for (j = i; j < n; j++)
		if (used[i][j]) {
			int done;

			banned[j] = 1, done = branch(j + 1, n, c_, s_), banned[j] = 0;
			if (done)
				return 1;
		}
	return 0;
}

int main() {
	static int hh[K];
	static char used[N], used_[N];
	int h, i, d, c_, c2;
	long long s_, s2;

	scanf("%d%d", &n, &k);
	for (d = 0; d < n; d++)
		ei[d] = (int *) malloc(2 * sizeof *ei[d]);
	for (i = 0; i < n; i++) {
		scanf("%d%d", &ww[i], &d), d--;
		append(d, i);
	}
	if (k <= 2) {
		simulate(used, &c_, &s_);
		printf("%d %lld\n", c_, s_);
		if (k == 2) {
			c2 = s2 = 0;
			for (i = 0; i < n; i++)
				if (used[i]) {
					banned[i] = 1, simulate(used_, &c_, &s_), banned[i] = 0;
					if (c2 < c_ || c2 == c_ && s2 > s_)
						c2 = c_, s2 = s_;
				}
			printf("%d %lld\n", c2, s2);
		}
	} else {
		long long lower = -1, upper = (n + 2) * S, cs, s;
		int c;

		while (upper - lower > 1) {
			cs = (lower + upper) / 2, c = n - cs / S, s = cs % S;
			k_ = 0;
			if (branch(0, n, c, s))
				upper = cs;
			else
				lower = cs;
		}
		if (lower >= 0) {
			cs = lower, c = n - cs / S, s = cs % S;
			k_ = 0, branch(0, n, c, s);
		}
		cs = upper, c = n - cs / S, s = cs % S;
		while (k_ < k)
			cc[k_] = c, ss[k_] = s, k_++;
		for (h = 0; h < k; h++)
			hh[h] = h;
		sort(hh, 0, k);
		for (h = 0; h < k; h++)
			printf("%d %lld\n", cc[hh[h]], ss[hh[h]]);
	}
	return 0;
}

Compilation message

Main.c: In function 'append':
Main.c:20:23: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   20 |  if (o >= 2 && (o & o - 1) == 0)
      |                     ~~^~~
Main.c: In function 'sort':
Main.c:34:53: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   34 |    else if (cc[hh[j]] > cc[h] || cc[hh[j]] == cc[h] && ss[hh[j]] < ss[h]) {
      |                                  ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
Main.c: In function 'branch':
Main.c:111:24: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  111 |  if (c < c_ || c == c_ && s > s_)
      |                ~~~~~~~~^~~~~~~~~
Main.c: In function 'main':
Main.c:148:30: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  148 |      if (c2 < c_ || c2 == c_ && s2 > s_)
      |                     ~~~~~~~~~^~~~~~~~~~
Main.c:133:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  133 |  scanf("%d%d", &n, &k);
      |  ^~~~~~~~~~~~~~~~~~~~~
Main.c:137:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  137 |   scanf("%d%d", &ww[i], &d), d--;
      |   ^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.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 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 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
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 204 KB Output is correct

Subtask #2
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 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 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
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 392 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 0 ms 208 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 265 ms 376 KB Output is correct
2 Correct 233 ms 388 KB Output is correct
3 Correct 192 ms 380 KB Output is correct
4 Correct 227 ms 372 KB Output is correct
5 Correct 250 ms 380 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 3 ms 332 KB Output is correct
10 Correct 104 ms 396 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 134 ms 352 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 442 ms 476 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
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 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 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
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 392 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 0 ms 208 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 265 ms 376 KB Output is correct
28 Correct 233 ms 388 KB Output is correct
29 Correct 192 ms 380 KB Output is correct
30 Correct 227 ms 372 KB Output is correct
31 Correct 250 ms 380 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 3 ms 332 KB Output is correct
36 Correct 104 ms 396 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Incorrect 134 ms 352 KB Output isn't correct
41 Halted 0 ms 0 KB -