oj.uz

답안 #762718

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
762718 2023-06-21T16:51:44 Z rainboy Through Another Maze Darkly (CCO21_day1problem3) C
25 / 25
 998 ms 224772 KB 
#include <stdio.h>
#include <stdlib.h>

#define N	800000
#define N2	((N - 1) * 2)
#define N_	(1 << 21)	/* N_ = pow2(ceil(log2(N2))) */
#define Q	800000

unsigned int X = 12345;

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

int *ej[N], eo[N], *ei[N], eo_[N], ii[N2], dd[N2], n2;

void dfs(int p, int i, int d) {
	int o, o_;

	if (p == -1)
		for (o = 0; o < eo[i]; o++) {
			int j = ej[i][o];

			eo_[d] += 2;
			ii[n2] = j, dd[n2] = d, n2++;
			dfs(i, j, d);
			ii[n2] = i, dd[n2] = d, n2++;
		}
	else {
		for (o = 0; o < eo[i]; o++) {
			int j = ej[i][o];

			if (j == p)
				break;
		}
		for (o_ = o + 1; o_ < eo[i]; o_++) {
			int j = ej[i][o_];

			eo_[d + 1] += 2;
			ii[n2] = j, dd[n2] = d + 1, n2++;
			dfs(i, j, d + 1);
			ii[n2] = i, dd[n2] = d + 1, n2++;
		}
		for (o_ = 0; o_ < o; o_++) {
			int j = ej[i][o_];

			eo_[d] += 2;
			ii[n2] = j, dd[n2] = d, n2++;
			dfs(i, j, d);
			ii[n2] = i, dd[n2] = d, n2++;
		}
	}
}

long long tt[Q];

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 (tt[hh[j]] == tt[h])
				j++;
			else if (tt[hh[j]] < tt[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 st[N_ * 2], n_;

void update(int i) {
	for (i += n_; i > 0; i >>= 1)
		st[i]++;
}

int query(int k) {
	int i = 1;

	while (i < n_)
		if (k < st[i << 1 | 0])
			i = i << 1 | 0;
		else
			k -= st[i << 1 | 0], i = i << 1 | 1;
	return i - n_;
}

int main() {
	static int hh[Q], ans[Q];
	int n, q, h, h_, i, j, k, d, o;
	long long t;

	scanf("%d%d", &n, &q);
	for (i = 0; i < n; i++) {
		scanf("%d", &eo[i]);
		ej[i] = (int *) malloc(eo[i] * sizeof *ej[i]);
		for (o = 0; o < eo[i]; o++) {
			scanf("%d", &j), j--;
			ej[i][(o - 1 + eo[i]) % eo[i]] = j;
		}
	}
	dfs(-1, 0, 0);
	for (d = 0; d < n; d++)
		ei[d] = (int *) malloc(eo_[d] * sizeof *ei[d]), eo_[d] = 0;
	for (i = 0; i < n2; i++) {
		d = dd[i];
		ei[d][eo_[d]++] = i;
	}
	for (h = 0; h < q; h++)
		scanf("%lld", &tt[h]), tt[h]--;
	for (h = 0; h < q; h++)
		hh[h] = h;
	sort(hh, 0, q);
	n_ = 1;
	while (n_ < n2)
		n_ <<= 1;
	t = 0, k = 0;
	for (h = 0, d = 0; h < q; h++) {
		h_ = hh[h];
		while (tt[h_] - t >= k)
			if (d < n) {
				for (o = 0; o < eo_[d]; o++) {
					i = ei[d][o];
					update(i);
				}
				t += k, k += eo_[d];
				d++;
			} else
				t = t + (tt[h_] - t) / k * k;
		ans[h_] = ii[query(tt[h_] - t)];
	}
	for (h = 0; h < q; h++)
		printf("%d\n", ans[h] + 1);
	return 0;
}

Compilation message

Main.c: In function 'main':
Main.c:99:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   99 |  scanf("%d%d", &n, &q);
      |  ^~~~~~~~~~~~~~~~~~~~~
Main.c:101:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  101 |   scanf("%d", &eo[i]);
      |   ^~~~~~~~~~~~~~~~~~~
Main.c:104:4: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  104 |    scanf("%d", &j), j--;
      |    ^~~~~~~~~~~~~~~
Main.c:116:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  116 |   scanf("%lld", &tt[h]), tt[h]--;
      |   ^~~~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 7 ms 3028 KB Output is correct
3 Correct 78 ms 27752 KB Output is correct
4 Correct 645 ms 224772 KB Output is correct
5 Correct 784 ms 222308 KB Output is correct
6 Correct 758 ms 223200 KB Output is correct
7 Correct 298 ms 44072 KB Output is correct

Subtask #2
4.0 / 4.0

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

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1872 KB Output is correct
2 Correct 21 ms 8396 KB Output is correct
3 Correct 37 ms 18508 KB Output is correct
4 Correct 35 ms 14804 KB Output is correct
5 Correct 335 ms 110192 KB Output is correct
6 Correct 351 ms 111096 KB Output is correct
7 Correct 375 ms 102464 KB Output is correct
8 Correct 377 ms 109236 KB Output is correct
9 Correct 427 ms 137964 KB Output is correct
10 Correct 449 ms 152204 KB Output is correct
11 Correct 293 ms 190560 KB Output is correct
12 Correct 284 ms 186016 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 7 ms 3028 KB Output is correct
3 Correct 78 ms 27752 KB Output is correct
4 Correct 645 ms 224772 KB Output is correct
5 Correct 784 ms 222308 KB Output is correct
6 Correct 758 ms 223200 KB Output is correct
7 Correct 298 ms 44072 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 532 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 2 ms 596 KB Output is correct
14 Correct 2 ms 724 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 2 ms 724 KB Output is correct
17 Correct 2 ms 724 KB Output is correct
18 Correct 2 ms 724 KB Output is correct
19 Correct 2 ms 852 KB Output is correct
20 Correct 2 ms 872 KB Output is correct
21 Correct 2 ms 724 KB Output is correct
22 Correct 6 ms 1872 KB Output is correct
23 Correct 21 ms 8396 KB Output is correct
24 Correct 37 ms 18508 KB Output is correct
25 Correct 35 ms 14804 KB Output is correct
26 Correct 335 ms 110192 KB Output is correct
27 Correct 351 ms 111096 KB Output is correct
28 Correct 375 ms 102464 KB Output is correct
29 Correct 377 ms 109236 KB Output is correct
30 Correct 427 ms 137964 KB Output is correct
31 Correct 449 ms 152204 KB Output is correct
32 Correct 293 ms 190560 KB Output is correct
33 Correct 284 ms 186016 KB Output is correct
34 Correct 302 ms 24892 KB Output is correct
35 Correct 329 ms 33720 KB Output is correct
36 Correct 372 ms 45640 KB Output is correct
37 Correct 708 ms 137980 KB Output is correct
38 Correct 763 ms 137964 KB Output is correct
39 Correct 801 ms 138984 KB Output is correct
40 Correct 897 ms 145744 KB Output is correct
41 Correct 966 ms 179272 KB Output is correct
42 Correct 998 ms 223252 KB Output is correct
43 Correct 702 ms 221140 KB Output is correct
44 Correct 703 ms 222056 KB Output is correct
45 Correct 748 ms 168060 KB Output is correct
46 Correct 1 ms 340 KB Output is correct