oj.uz

답안 #545922

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
545922 2022-04-05T16:10:19 Z rainboy Fibonacci representations (CEOI18_fib) C
100 / 100
 563 ms 15492 KB 
#include <stdio.h>

#define Q	100000
#define Q_	(Q * 3)
#define MD	1000000007

unsigned int Z = 12345;

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

int zz[1 + Q_], ll[1 + Q_], rr[1 + Q_], xx[1 + Q_], xx_[1 + Q_], aa[1 + Q_], bb[1 + Q_], cc[1 + Q_], dd[1 + Q_], aa_[1 + Q_], bb_[1 + Q_], cc_[1 + Q_], dd_[1 + Q_]; char all2[1 + Q_], is2[1 + Q_]; int u_, l_, r_;

int node(int x) {
	static int _ = 1;

	zz[_] = rand_();
	xx_[_] = xx[_] = x;
	aa_[_] = aa[_] = (x + 1) / 2, bb_[_] = bb[_] = (x + 1) % 2, cc_[_] = cc[_] = aa[_] - 1, dd_[_] = dd[_] = (x + 1) % 2;
	all2[_] = is2[_] = x == 2;
	return _++;
}

void pul(int u) {
	int l = ll[u], r = rr[u], a, b, c, d;

	xx_[u] = xx_[l] + xx[u] + xx_[r];
	a = ((long long) aa_[r] * aa[u] + (long long) bb_[r] * cc[u]) % MD;
	b = ((long long) aa_[r] * bb[u] + (long long) bb_[r] * dd[u]) % MD;
	c = ((long long) cc_[r] * aa[u] + (long long) dd_[r] * cc[u]) % MD;
	d = ((long long) cc_[r] * bb[u] + (long long) dd_[r] * dd[u]) % MD;
	aa_[u] = ((long long) a * aa_[l] + (long long) b * cc_[l]) % MD;
	bb_[u] = ((long long) a * bb_[l] + (long long) b * dd_[l]) % MD;
	cc_[u] = ((long long) c * aa_[l] + (long long) d * cc_[l]) % MD;
	dd_[u] = ((long long) c * bb_[l] + (long long) d * dd_[l]) % MD;
	all2[u] = all2[l] && is2[u] && all2[r];
}

void split_x(int u, int x) {
	int xl;

	if (u == 0) {
		u_ = l_ = r_ = 0;
		return;
	}
	xl = xx_[ll[u]];
	if (xl + xx[u] <= x) {
		split_x(rr[u], x - xl - xx[u]);
		rr[u] = l_, l_ = u;
	} else if (xl > x) {
		split_x(ll[u], x);
		ll[u] = r_, r_ = u;
	} else {
		u_ = u, l_ = ll[u], r_ = rr[u];
		ll[u] = rr[u] = 0;
	}
	pul(u);
}

void split2l(int u) {
	if (u == 0) {
		u_ = l_ = r_ = 0;
		return;
	}
	if (!all2[ll[u]]) {
		split2l(ll[u]);
		ll[u] = r_, r_ = u;
	} else if (is2[u]) {
		split2l(rr[u]);
		rr[u] = l_, l_ = u;
	} else {
		u_ = u, l_ = ll[u], r_ = rr[u];
		ll[u] = rr[u] = 0;
	}
	pul(u);
}

void split2r(int u) {
	if (u == 0) {
		u_ = l_ = r_ = 0;
		return;
	}
	if (!all2[rr[u]]) {
		split2r(rr[u]);
		rr[u] = l_, l_ = u;
	} else if (is2[u]) {
		split2r(ll[u]);
		ll[u] = r_, r_ = u;
	} else {
		u_ = u, l_ = ll[u], r_ = rr[u];
		ll[u] = rr[u] = 0;
	}
	pul(u);
}

int merge(int u, int v) {
	if (u == 0)
		return v;
	if (v == 0)
		return u;
	if (zz[u] < zz[v]) {
		rr[u] = merge(rr[u], v), pul(u);
		return u;
	} else {
		ll[v] = merge(u, ll[v]), pul(v);
		return v;
	}
}

void upd_last(int u, int x) {
	if (rr[u] == 0) {
		xx[u] += x;
		aa[u] = (xx[u] + 1) / 2, bb[u] = (xx[u] + 1) % 2, cc[u] = aa[u] - 1, dd[u] = (xx[u] + 1) % 2;
		is2[u] = xx[u] == 2;
	} else
		upd_last(rr[u], x);
	pul(u);
}

int main() {
	int q;

	scanf("%d", &q);
	aa_[0] = aa[0] = 1, bb_[0] = bb[0] = 0, cc_[0] = cc[0] = 0, dd_[0] = dd[0] = 1, is2[0] = all2[0] = 1;
	while (q--) {
		int x, l, r, u, v;

		scanf("%d", &x);
		split_x(u_, x), u = u_, l = l_, r = r_;
		if (xx_[l] < x) {
			if (u && x + 1 == xx_[l] + xx[u]) {
				split2l(r);
				l = merge(l, node(xx[u] + 1 + xx_[l_])), r = u_ == 0 ? 0 : merge(node(xx[u_] - 1), r_);
			} else if (l && xx_[l] + 1 == x) {
				if (xx[u] != 3)
					upd_last(l, 2), r = u == 0 ? 0 : merge(node(xx[u] - 2), r);
				else {
					split2l(r);
					upd_last(l, 4 + xx_[l_]), r = u_ == 0 ? 0 : merge(node(xx[u_] - 1), r_);
				}
			} else
				r = u == 0 ? 0 : merge(node(xx_[l] + xx[u] - x), r), l = merge(l, node(x - xx_[l]));
		} else {
			split2r(l), v = u_;
			if (v == 0)
				l = merge(node(1), r_);
			else if (xx[v] == 1)
				l = merge(node(2), r_);
			else if (l_ && xx[v] == 3)
				upd_last(l_, 2), l = merge(merge(l_, node(2)), r_);
			else
				l = merge(merge(l_, merge(node(xx[v] - 2), node(3))), r_);
			if (u != 0) {
				if (xx[u] != 2)
					r = merge(node(xx[u] - 1), r);
				else {
					split2l(r);
					upd_last(l, 2 + xx_[l_]), r = u_ == 0 ? 0 : merge(node(xx[u_] - 1), r_);
				}
			}
		}
		u_ = merge(l, r);
		printf("%d\n", aa_[u_]);
	}
	return 0;
}

Compilation message

fib.c: In function 'main':
fib.c:124:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  124 |  scanf("%d", &q);
      |  ^~~~~~~~~~~~~~~
fib.c:129:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  129 |   scanf("%d", &x);
      |   ^~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 292 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 284 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 292 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 284 KB Output is correct
7 Correct 1 ms 284 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 340 KB Output is correct
11 Correct 1 ms 288 KB Output is correct
12 Correct 1 ms 340 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 292 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 284 KB Output is correct
7 Correct 1 ms 284 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 340 KB Output is correct
11 Correct 1 ms 288 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 292 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 288 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 477 ms 12816 KB Output is correct
3 Correct 500 ms 12516 KB Output is correct

Subtask #6
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 292 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 284 KB Output is correct
7 Correct 1 ms 284 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 340 KB Output is correct
11 Correct 1 ms 288 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 292 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 288 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 477 ms 12816 KB Output is correct
26 Correct 500 ms 12516 KB Output is correct
27 Correct 86 ms 4088 KB Output is correct
28 Correct 179 ms 6600 KB Output is correct
29 Correct 41 ms 5680 KB Output is correct
30 Correct 154 ms 6456 KB Output is correct
31 Correct 141 ms 7812 KB Output is correct
32 Correct 176 ms 7132 KB Output is correct
33 Correct 214 ms 7756 KB Output is correct
34 Correct 187 ms 7740 KB Output is correct
35 Correct 237 ms 7592 KB Output is correct
36 Correct 240 ms 7744 KB Output is correct
37 Correct 129 ms 9976 KB Output is correct
38 Correct 489 ms 12824 KB Output is correct
39 Correct 54 ms 11416 KB Output is correct
40 Correct 70 ms 11224 KB Output is correct
41 Correct 218 ms 12300 KB Output is correct
42 Correct 447 ms 12708 KB Output is correct
43 Correct 111 ms 12960 KB Output is correct
44 Correct 192 ms 15480 KB Output is correct
45 Correct 400 ms 15052 KB Output is correct
46 Correct 373 ms 15264 KB Output is correct
47 Correct 506 ms 13912 KB Output is correct
48 Correct 429 ms 15492 KB Output is correct
49 Correct 563 ms 15064 KB Output is correct
50 Correct 491 ms 12980 KB Output is correct