oj.uz

답안 #733467

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
733467 2023-04-30T21:19:17 Z rainboy Traffickers (RMI18_traffickers) C
0 / 100
 383 ms 7416 KB 
#include <stdio.h>
#include <stdlib.h>

#define N	30000
#define D	20

int *ej[N], eo[N], n;

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;
}

int dd[N], pp[N], qq[N];

int dfs1(int p, int i, int d) {
	int o, s, k_, j_;

	dd[i] = d, pp[i] = p;
	s = 1, k_ = 0, j_ = -1;
	for (o = eo[i]; o--; ) {
		int j = ej[i][o];

		if (j != p) {
			int k = dfs1(i, j, d + 1);

			s += k;
			if (k_ < k)
				k_ = k, j_ = j;
		}
	}
	qq[i] = j_;
	return s;
}

int ta[N], tb[N];

void dfs2(int p, int i, int q) {
	static int time;
	int o, j_;

	ta[i] = time++;
	j_ = qq[i], qq[i] = q;
	if (j_ != -1)
		dfs2(i, j_, q);
	for (o = eo[i]; o--; ) {
		int j = ej[i][o];

		if (j != p && j != j_)
			dfs2(i, j, j);
	}
	tb[i] = time;
}

int lca(int i, int j) {
	while (qq[i] != qq[j])
		if (dd[qq[i]] > dd[qq[j]])
			i = pp[qq[i]];
		else
			j = pp[qq[j]];
	return dd[i] < dd[j] ? i : j;
}

void update(int ft[][D + 1], int i, int j_, int n, int m, int x) {
	int j;

	while (i < n) {
		j = j_;
		while (j < m) {
			ft[i][j] += x;
			j |= j + 1;
		}
		i |= i + 1;
	}
}

int query(int ft[][D + 1], int i, int j_) {
	int j, x;

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

int ft[D + 1][N][D + 1];

void update_(int i, int j, int x) {
	static int qu[D + 1];
	int a, d, u, h;

	a = lca(i, j), d = dd[i] + dd[j] - dd[a] * 2;
	u = i;
	while (u != a)
		qu[dd[i] - dd[u]] = u, u = pp[u];
	qu[dd[i] - dd[a]] = a;
	u = j;
	while (u != a)
		qu[dd[i] - dd[a] * 2 + dd[u]] = u, u = pp[u];
	for (h = 0; h <= d; h++) {
		i = qu[h];
		update(ft[1], ta[i], h, n, d + 1, x), update(ft[1], tb[i], h, n, d + 1, -x);
	}
}

long long query_(int i, int j, int t) {
	int a, d, r;
	long long x;

	a = lca(i, j);
	x = 0;
	for (d = 1; d <= D; d++) {
		x += (long long) (query(ft[d], ta[i], d) + query(ft[d], ta[j], d) - query(ft[d], ta[a], d) - (pp[a] == -1 ? 0 : query(ft[d], ta[pp[a]], d))) * (t / (d * 2));
		r = t % (d + 1);
		x += (query(ft[d], ta[i], r - 1) + query(ft[d], ta[j], r - 1) - query(ft[d], ta[a], r - 1) - (pp[a] == -1 ? 0 : query(ft[d], ta[pp[a]], r - 1)));
	}
	return x;
}

int main() {
	int k, q, h, i, j;

	scanf("%d", &n);
	for (i = 0; i < n; i++)
		ej[i] = (int *) malloc(2 * sizeof *ej[i]);
	for (h = 0; h < n - 1; h++) {
		scanf("%d%d", &i, &j), i--, j--;
		append(i, j), append(j, i);
	}
	dfs1(-1, 0, 0);
	dfs2(-1, 0, 0);
	scanf("%d", &k);
	while (k--) {
		scanf("%d%d", &i, &j), i--, j--;
		update_(i, j, 1);
	}
	scanf("%d", &q);
	while (q--) {
		int t, l, r;

		scanf("%d%d%d", &t, &i, &j), i--, j--;
		if (t == 1)
			update_(i, j, 1);
		else if (t == 2)
			update_(i, j, -1);
		else {
			scanf("%d%d", &l, &r), r++;
			printf("%lld\n", query_(i, j, r) - query_(i, j, l));
		}
	}
	return 0;
}

Compilation message

traffickers.c: In function 'append':
traffickers.c:12:23: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   12 |  if (o >= 2 && (o & o - 1) == 0)
      |                     ~~^~~
traffickers.c: In function 'main':
traffickers.c:132:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  132 |  scanf("%d", &n);
      |  ^~~~~~~~~~~~~~~
traffickers.c:136:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  136 |   scanf("%d%d", &i, &j), i--, j--;
      |   ^~~~~~~~~~~~~~~~~~~~~
traffickers.c:141:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  141 |  scanf("%d", &k);
      |  ^~~~~~~~~~~~~~~
traffickers.c:143:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  143 |   scanf("%d%d", &i, &j), i--, j--;
      |   ^~~~~~~~~~~~~~~~~~~~~
traffickers.c:146:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  146 |  scanf("%d", &q);
      |  ^~~~~~~~~~~~~~~
traffickers.c:150:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  150 |   scanf("%d%d%d", &t, &i, &j), i--, j--;
      |   ^~~~~~~~~~~~~~~~~~~~~~~~~~~
traffickers.c:156:4: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  156 |    scanf("%d%d", &l, &r), r++;
      |    ^~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Incorrect 3 ms 596 KB Output isn't correct
3 Incorrect 4 ms 468 KB Output isn't correct

Subtask #2
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 44 ms 2232 KB Output isn't correct
2 Incorrect 33 ms 1928 KB Output isn't correct
3 Incorrect 37 ms 2636 KB Output isn't correct
4 Incorrect 38 ms 2392 KB Output isn't correct
5 Incorrect 35 ms 2144 KB Output isn't correct
6 Incorrect 36 ms 2304 KB Output isn't correct
7 Incorrect 35 ms 2308 KB Output isn't correct
8 Incorrect 36 ms 2408 KB Output isn't correct
9 Incorrect 35 ms 2572 KB Output isn't correct

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 340 ms 6168 KB Output isn't correct
2 Incorrect 353 ms 7092 KB Output isn't correct
3 Incorrect 334 ms 6524 KB Output isn't correct
4 Incorrect 383 ms 5440 KB Output isn't correct
5 Incorrect 346 ms 5276 KB Output isn't correct
6 Incorrect 371 ms 7024 KB Output isn't correct
7 Incorrect 295 ms 7416 KB Output isn't correct
8 Incorrect 275 ms 6824 KB Output isn't correct