oj.uz

답안 #503382

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
503382 2022-01-07T18:51:41 Z rainboy Akcija (COCI21_akcija) C
90 / 110
 5000 ms 2320 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; int tt[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 (tt[i] != -1)
				pq_add(i);
		}
		if (cnt) {
			i = pq_remove_first();
			c_++, s_ += ww[i], used[i] = 1;
		}
	}
	*c__ = c_, *s__ = s_;
}

char used[N][N]; int n_;

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

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

			tt[j] = -1, done = branch(n, c_, s_), tt[j] = n_;
			if (done) {
				for (j = n - 1; j >= 0; j--)
					if (tt[j] == n_)
						tt[j] = 0;
				n_--;
				return 1;
			}
		}
	for (j = n - 1; j >= 0; j--)
		if (tt[j] == n_)
			tt[j] = 0;
	n_--;
	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]) {
					tt[i] = -1, simulate(used_, &c_, &s_), tt[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(n, c, s))
				upper = cs;
			else
				lower = cs;
		}
		if (lower >= 0) {
			cs = lower, c = n - cs / S, s = cs % S;
			k_ = 0, branch(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:161:30: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  161 |      if (c2 < c_ || c2 == c_ && s2 > s_)
      |                     ~~~~~~~~~^~~~~~~~~~
Main.c:146:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  146 |  scanf("%d%d", &n, &k);
      |  ^~~~~~~~~~~~~~~~~~~~~
Main.c:150:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  150 |   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 204 KB Output is correct
13 Correct 0 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 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 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 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 1 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 246 ms 380 KB Output is correct
2 Correct 224 ms 392 KB Output is correct
3 Correct 205 ms 332 KB Output is correct
4 Correct 213 ms 388 KB Output is correct
5 Correct 251 ms 396 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 99 ms 332 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 126 ms 340 KB Output is correct
2 Correct 120 ms 332 KB Output is correct
3 Correct 113 ms 332 KB Output is correct
4 Correct 75 ms 332 KB Output is correct
5 Correct 122 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 43 ms 336 KB Output is correct
8 Correct 27 ms 344 KB Output is correct
9 Correct 31 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 97 ms 332 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 422 ms 332 KB Output is correct
2 Correct 241 ms 396 KB Output is correct
3 Correct 304 ms 284 KB Output is correct
4 Correct 234 ms 400 KB Output is correct
5 Correct 361 ms 404 KB Output is correct
6 Correct 5 ms 460 KB Output is correct
7 Correct 13 ms 460 KB Output is correct
8 Correct 10 ms 496 KB Output is correct
9 Correct 16 ms 484 KB Output is correct
10 Correct 56 ms 404 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 54 ms 352 KB Output is correct

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 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 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 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 246 ms 380 KB Output is correct
28 Correct 224 ms 392 KB Output is correct
29 Correct 205 ms 332 KB Output is correct
30 Correct 213 ms 388 KB Output is correct
31 Correct 251 ms 396 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 99 ms 332 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 126 ms 340 KB Output is correct
41 Correct 120 ms 332 KB Output is correct
42 Correct 113 ms 332 KB Output is correct
43 Correct 75 ms 332 KB Output is correct
44 Correct 122 ms 332 KB Output is correct
45 Correct 0 ms 332 KB Output is correct
46 Correct 43 ms 336 KB Output is correct
47 Correct 27 ms 344 KB Output is correct
48 Correct 31 ms 332 KB Output is correct
49 Correct 2 ms 332 KB Output is correct
50 Correct 0 ms 204 KB Output is correct
51 Correct 0 ms 204 KB Output is correct
52 Correct 97 ms 332 KB Output is correct
53 Correct 422 ms 332 KB Output is correct
54 Correct 241 ms 396 KB Output is correct
55 Correct 304 ms 284 KB Output is correct
56 Correct 234 ms 400 KB Output is correct
57 Correct 361 ms 404 KB Output is correct
58 Correct 5 ms 460 KB Output is correct
59 Correct 13 ms 460 KB Output is correct
60 Correct 10 ms 496 KB Output is correct
61 Correct 16 ms 484 KB Output is correct
62 Correct 56 ms 404 KB Output is correct
63 Correct 0 ms 204 KB Output is correct
64 Correct 1 ms 204 KB Output is correct
65 Correct 54 ms 352 KB Output is correct
66 Execution timed out 5045 ms 2320 KB Time limit exceeded
67 Halted 0 ms 0 KB -