oj.uz

답안 #545504

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
545504 2022-04-04T16:08:26 Z rainboy 우주 해적 (JOI14_space_pirate) C
47 / 100
 2000 ms 85200 KB 
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define N	100000
#define L	60	/* L = ceil(log2(10^18)) */

int *ej[N], eo[N], pp[N], pp_[L + 1][N], ii[N + 1], tt[N], tt_[N], n; long long cc[N], bb[N], cc_[L + 1][N], k, time;

void upd(int i, int b) {
	cc[i] -= b * time, bb[i] += b;
}

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

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

void dfs1(int i, int t) {
	int o;

	if (tt_[i] != -1)
		return;
	tt_[i] = t;
	for (o = eo[i]; o--; ) {
		int j = ej[i][o];

		dfs1(j, t);
	}
}

void update(int i, long long k, int x) {
	int l;

	for (l = L; l >= 0; l--)
		if (k >= 1LL << l)
			cc_[l][i] += x, k -= 1LL << l, i = pp_[l][i];
}

int qu[N * 2];

void dfs2(int p, int i, int cnt, int h_, int h0, int h1, int h2) {
	int o, h;

	qu[cnt++] = i;
	if (tt[i] != -1)
		h0 = cnt - 1;
	for (h = h0; h >= h_; h--)
		upd(qu[cnt - 1 - (k + cnt - (h <= h1 ? tt[qu[h1]] + h1 : tt[qu[h2]] + h2) - 1) % (cnt - h)], 1);
	time++;
	for (h = h0; h >= h_; h--)
		upd(qu[cnt - 1 - (k + cnt - (h <= h1 ? tt[qu[h1]] + h1 : tt[qu[h2]] + h2) - 1) % (cnt - h)], -1);
	for (o = eo[i]; o--; ) {
		int j = ej[i][o];

		if (j != p)
			dfs2(i, j, cnt, h_, h0, h1, h2);
	}
}

int main() {
	int h, i, i_, j, t, l, cnt;
	long long k_;

	scanf("%d%lld", &n, &k);
	for (i = 0; i < n; i++)
		ej[i] = (int *) malloc(2 * sizeof *ej[i]);
	for (i = 0; i < n; i++) {
		scanf("%d", &pp[i]), pp[i]--;
		append(pp[i], i);
	}
	for (i = 0; i < n; i++)
		pp_[0][i] = pp[i];
	for (l = 1; l <= L; l++)
		for (i = 0; i < n; i++)
			pp_[l][i] = pp_[l - 1][pp_[l - 1][i]];
	memset(tt, -1, n * sizeof *tt), memset(tt_, -1, n * sizeof *tt_);
	for (i = 0, t = 0; tt[i] == -1; i = pp[i], t++)
		ii[tt[i] = t] = i, dfs1(i, t);
	ii[t] = i_ = i;
	for (i = 0; i < n; i++)
		if (tt_[i] == -1)
			tt_[i] = t;
	j = i_, k_ = (k - t) % (t - tt[i_]);
	while (k_--)
		j = pp[j];
	for (i = 0; i < n; i++)
		if (tt[i] == -1)
			cc[j] += n;
	for (i = 0; i < n; i++)
		update(i, k, 1), update(i, k - tt_[i], -1);
	for (l = L; l > 0; l--)
		for (i = 0; i < n; i++)
			cc_[l - 1][i] += cc_[l][i], cc_[l - 1][pp_[l - 1][i]] += cc_[l][i];
	for (i = 0; i < n; i++)
		cc[i] += cc_[0][i];
	cnt = 0;
	for (h = t - 1; h > tt[i_]; h--)
		qu[cnt++] = ii[h];
	for (h = t; h > tt[i_]; h--)
		dfs2(ii[h - 1], ii[h], cnt, cnt - (t - tt[i_]) + 1, cnt, t - tt[i_] - 1, cnt), qu[cnt++] = ii[h];
	for (i = 0; i < n; i++)
		upd(i, -bb[i]);
	for (i = 0; i < n; i++)
		printf("%lld\n", cc[i]);
	return 0;
}

Compilation message

space_pirate.c: In function 'append':
space_pirate.c:17:23: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   17 |  if (o >= 2 && (o & o - 1) == 0)
      |                     ~~^~~
space_pirate.c: In function 'main':
space_pirate.c:68:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   68 |  scanf("%d%lld", &n, &k);
      |  ^~~~~~~~~~~~~~~~~~~~~~~
space_pirate.c:72:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |   scanf("%d", &pp[i]), pp[i]--;
      |   ^~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 980 KB Output is correct
11 Correct 1 ms 980 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 1 ms 980 KB Output is correct

Subtask #2
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 980 KB Output is correct
11 Correct 1 ms 980 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 1 ms 980 KB Output is correct
15 Correct 8 ms 3284 KB Output is correct
16 Correct 5 ms 3284 KB Output is correct
17 Correct 15 ms 3284 KB Output is correct
18 Correct 349 ms 3448 KB Output is correct
19 Correct 98 ms 3404 KB Output is correct
20 Correct 179 ms 3524 KB Output is correct
21 Correct 200 ms 3648 KB Output is correct
22 Correct 72 ms 3392 KB Output is correct
23 Correct 186 ms 3612 KB Output is correct
24 Correct 44 ms 3576 KB Output is correct
25 Correct 4 ms 3284 KB Output is correct
26 Correct 385 ms 3460 KB Output is correct
27 Correct 74 ms 3360 KB Output is correct
28 Correct 121 ms 3328 KB Output is correct

Subtask #3
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 470 ms 78540 KB Output is correct
2 Execution timed out 2101 ms 85200 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 980 KB Output is correct
11 Correct 1 ms 980 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 1 ms 980 KB Output is correct
15 Correct 8 ms 3284 KB Output is correct
16 Correct 5 ms 3284 KB Output is correct
17 Correct 15 ms 3284 KB Output is correct
18 Correct 349 ms 3448 KB Output is correct
19 Correct 98 ms 3404 KB Output is correct
20 Correct 179 ms 3524 KB Output is correct
21 Correct 200 ms 3648 KB Output is correct
22 Correct 72 ms 3392 KB Output is correct
23 Correct 186 ms 3612 KB Output is correct
24 Correct 44 ms 3576 KB Output is correct
25 Correct 4 ms 3284 KB Output is correct
26 Correct 385 ms 3460 KB Output is correct
27 Correct 74 ms 3360 KB Output is correct
28 Correct 121 ms 3328 KB Output is correct
29 Correct 470 ms 78540 KB Output is correct
30 Execution timed out 2101 ms 85200 KB Time limit exceeded
31 Halted 0 ms 0 KB -