Submission #545869

#	Time	Username	Problem	Language	Result	Execution time	Memory
545869		rainboy	Space Pirate (JOI14_space_pirate)	C11	100 / 100	1469 ms	140040 KiB

space_pirate

#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], *ed[N * 6 + 1], eo_[N * 6 + 1], 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 init(int n, long long l, long long r) {
	int d;
	long long a;

	for (d = 1; d <= n; d++) {
		a = l / d * d;
		while (a < l)
			a += d;
		while (a >= l + d)
			a -= d;
		while (a <= r)
			eo_[a - l]++, a += d;
	}
	for (a = l; a <= r; a++)
		ed[a - l] = (int *) malloc(eo_[a - l] * sizeof *ed[a - l]), eo_[a - l] = 0;
	for (d = 1; d <= n; d++) {
		a = l / d * d;
		while (a < l)
			a += d;
		while (a >= l + d)
			a -= d;
		while (a <= r)
			ed[a - l][eo_[a - l]++] = d, a += d;
	}
}

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 + 1], h1, t1, t2;

void dfs2(int p, int i, int cnt, int h_, int h0) {
	int o, o_;

	time++;
	for (o = eo[i]; o--; ) {
		int j = ej[i][o];

		if (j != p) {
			int h0_ = tt[j] != -1 ? cnt : h0, d, a;

			qu[cnt] = j;
			d = cnt - h1;
			upd(qu[cnt - 1 - (k + cnt - t1 - 1) % d], -1), upd(qu[cnt - (k + cnt - t2) % d], 1);
			a = (k + cnt - t1) - (k - n * 3);
			for (o_ = eo_[a]; o_--; ) {
				d = ed[a][o_];
				if (d >= cnt - h0 && d <= cnt - h_ && d > cnt - h1)
					upd(qu[cnt - d], -1), upd(qu[cnt], 1);
			}
			a = (k + cnt - t2) - (k - n * 3);
			for (o_ = eo_[a]; o_--; ) {
				d = ed[a][o_];
				if (d >= cnt - h0 && d <= cnt - h_ && d < cnt - h1)
					upd(qu[cnt - d], -1), upd(qu[cnt], 1);
			}
			if (tt[j] == -1) {
				d = cnt - h0;
				upd(qu[cnt - (k + cnt - (cnt - d + 1 <= h1 ? t1 : t2)) % d], -1);
			}
			d = cnt - h_ + 1;
			upd(qu[cnt - (k + cnt - (cnt - d + 1 <= h1 ? t1 : t2)) % d], 1);
			dfs2(i, j, cnt + 1, h_, h0_);
			d = cnt - h_ + 1;
			upd(qu[cnt - (k + cnt - (cnt - d + 1 <= h1 ? t1 : t2)) % d], -1);
			if (tt[j] == -1) {
				d = cnt - h0;
				upd(qu[cnt - (k + cnt - (cnt - d + 1 <= h1 ? t1 : t2)) % d], 1);
			}
			d = cnt - h1;
			upd(qu[cnt - (k + cnt - t2) % d], -1), upd(qu[cnt - 1 - (k + cnt - t1 - 1) % d], 1);
			a = (k + cnt - t1) - (k - n * 3);
			for (o_ = eo_[a]; o_--; ) {
				d = ed[a][o_];
				if (d >= cnt - h0 && d <= cnt - h_ && d > cnt - h1)
					upd(qu[cnt], -1), upd(qu[cnt - d], 1);
			}
			a = (k + cnt - t2) - (k - n * 3);
			for (o_ = eo_[a]; o_--; ) {
				d = ed[a][o_];
				if (d >= cnt - h0 && d <= cnt - h_ && d < cnt - h1)
					upd(qu[cnt], -1), upd(qu[cnt - d], 1);
			}
		}
	}
}

int main() {
	int g, h, h_, i, i_, j, t, l, cnt, d, o;
	long long k_, a;

	scanf("%d%lld", &n, &k), init(n, k - n * 3, k + n * 3);
	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];
	qu[cnt] = i_;
	h1 = t - tt[i_] - 1, t1 = tt[qu[h1]] + h1, t2 = tt[qu[cnt]] + cnt, h_ = cnt - (t - tt[i_]) + 1;
	for (h = t; h > tt[i_]; h--) {
		qu[cnt] = ii[h];
		if (h == t)
			for (g = cnt; g >= 0; g--)
				upd(qu[cnt - (k + cnt - (g <= h1 ? t1 : t2)) % (cnt - g + 1)], 1);
		else if (h == t - 1) {
			for (d = 1; d <= cnt - h_; d++)
				upd(qu[cnt - 1 - (k + cnt - (cnt - d <= h1 ? t1 : t2) - 1) % d], -1);
			t2 = tt[qu[cnt]] + cnt, h_++;
			for (d = 1, g = cnt; d <= cnt - h_ + 1; d++, g--)
				upd(qu[cnt - (k + cnt - (cnt - d + 1 <= h1 ? t1 : t2)) % d], 1);
		} else {
			h_++;
			d = cnt - h1;
			upd(qu[cnt - 1 - (k + cnt - t1 - 1) % d], -1), upd(qu[cnt - (k + cnt - t2) % d], 1);
			a = (k + cnt - t1) - (k - n * 3);
			for (o = eo_[a]; o--; ) {
				d = ed[a][o];
				if (d <= cnt - h_ + 1 && d > cnt - h1)
					upd(qu[cnt - d], -1), upd(qu[cnt], 1);
			}
			a = (k + cnt - t2) - (k - n * 3);
			for (o = eo_[a]; o--; ) {
				d = ed[a][o];
				if (d <= cnt - h_ + 1 && d < cnt - h1)
					upd(qu[cnt - d], -1), upd(qu[cnt], 1);
			}
		}
		dfs2(ii[h - 1], ii[h], cnt + 1, cnt - (t - tt[i_]) + 1, cnt);
		cnt++;
	}
	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 (stderr)

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

• Subtask 1: 10 / 10
• Subtask 2: 37 / 37
• Subtask 3: 33 / 33
• Subtask 4: 20 / 20