oj.uz

Submission #645701

# Submission time Handle Problem Language Result Execution time Memory
645701 2022-09-27T17:00:06 Z rainboy Fish 2 (JOI22_fish2) C
8 / 100
 4000 ms 5508 KB 
#include <stdio.h>

#define N	100000
#define N_	(1 << 17)	/* N_ = pow2(ceil(log2(N + 1))) */
#define INF	0x3f3f3f3f
#define LG	30

int min(int a, int b) { return a < b ? a : b; }
int max(int a, int b) { return a > b ? a : b; }

int aa[N];
long long st1[N_ * 2]; int st2[N_ * 2], kk2[N_ * 2], lz2[N_], h_, n_;

void pul1(int i) {
	int l = i << 1, r = l | 1;

	st1[i] = st1[l] + st1[r];
}

void build(int *aa, int n) {
	int i;

	h_ = 0;
	while (1 << h_ <= n)
		h_++;
	n_ = 1 << h_;
	for (i = 0; i < n; i++) {
		st1[n_ + i] = aa[i];
		kk2[n_ + i] = 1;
	}
	for (i = n_ - 1; i > 0; i--)
		pul1(i);
}

void update1(int i, int a) {
	i += n_;
	st1[i] = a;
	while (i > 1)
		pul1(i >>= 1);
}

int queryl1(int r, long long s) {
	int l = 0;

	for (l += n_, r += n_; l <= r; l >>= 1, r >>= 1)
		if ((r & 1) == 0) {
			if (s > st1[r])
				s -= st1[r--];
			else {
				while (r < n_)
					if (s <= st1[r << 1 | 1])
						r = r << 1 | 1;
					else
						s -= st1[r << 1 | 1], r = r << 1 | 0;
				return r - n_;
			}
		}
	return -1;
}

int queryr1(int l, long long s) {
	int r = n_ - 1;

	for (l += n_, r += n_; l <= r; l >>= 1, r >>= 1)
		if ((l & 1) == 1) {
			if (s > st1[l])
				s -= st1[l++];
			else {
				while (l < n_)
					if (s <= st1[l << 1 | 0])
						l = l << 1 | 0;
					else
						s -= st1[l << 1 | 0], l = l << 1 | 1;
				return l - n_;
			}
		}
	return n_;
}

void put2(int i, int x) {
	st2[i] += x;
	if (i < n_)
		lz2[i] += x;
}

void pus2(int i) {
	if (lz2[i])
		put2(i << 1 | 0, lz2[i]), put2(i << 1 | 1, lz2[i]), lz2[i] = 0;
}

void pul2(int i) {
	if (!lz2[i]) {
		int l = i << 1, r = l | 1;

		if (st2[l] < st2[r])
			st2[i] = st2[l], kk2[i] = kk2[l];
		else if (st2[l] > st2[r])
			st2[i] = st2[r], kk2[i] = kk2[r];
		else
			st2[i] = st2[l], kk2[i] = kk2[l] + kk2[r];
	}
}

void push2(int i) {
	int h;

	for (h = h_; h > 0; h--)
		pus2(i >> h);
}

void pull2(int i) {
	while (i > 1)
		pul2(i >>= 1);
}

void update2(int l, int r, int x) {
	int l_ = l += n_, r_ = r += n_;

	push2(l_), push2(r_);
	for ( ; l <= r; l >>= 1, r >>= 1) {
		if ((l & 1) == 1)
			put2(l++, x);
		if ((r & 1) == 0)
			put2(r--, x);
	}
	pull2(l_), pull2(r_);
}

int query2(int l, int r) {
	int x = INF, k = 0;

	push2(l += n_), push2(r += n_);
	for ( ; l <= r; l >>= 1, r >>= 1) {
		if ((l & 1) == 1) {
			if (x > st2[l])
				x = st2[l], k = 0;
			if (x == st2[l])
				k += kk2[l];
			l++;
		}
		if ((r & 1) == 0) {
			if (x > st2[r])
				x = st2[r], k = 0;
			if (x == st2[r])
				k += kk2[r];
			r--;
		}
	}
	return x == 0 ? k : 0;
}

void upd(int l, int r, int i, int x) {
	int j;

	j = max(queryl1(i - 1, aa[i]), l - 1);
	if (j < l || aa[j] > aa[i])
		update2(j + 1, i - 1, x);
	j = min(queryr1(i + 1, aa[i]), r + 1);
	if (j > r || aa[j] >= aa[i])
		update2(i + 1, j - 1, x);
}

int main() {
	int n, q, i, j;

	scanf("%d", &n);
	for (i = 0; i < n; i++)
		scanf("%d", &aa[i]);
	build(aa, n);
	scanf("%d", &q);
	for (i = 0; i < n; i++)
		upd(0, n - 1, i, 1);
	while (q--) {
		static char state[N];
		int t, a, l, r, lg;

		scanf("%d", &t);
		if (t == 1) {
			scanf("%d%d", &i, &a), i--;
			upd(0, n - 1, i, -1), state[i] = 1;
			for (lg = 0; lg <= LG; lg++) {
				j = queryl1(i, lg);
				if (j >= 0 && state[j] == 0)
					upd(0, n - 1, j, -1), state[j] = 1;
				j = queryr1(i, lg);
				if (j < n && state[j] == 0)
					upd(0, n - 1, j, -1), state[j] = 1;
			}
			state[i] = 0;
			for (lg = 0; lg <= LG; lg++) {
				j = queryl1(i, lg);
				if (j >= 0)
					state[j] = 0;
				j = queryr1(i, lg);
				if (j < n)
					state[j] = 0;
			}
			aa[i] = a, update1(i, a);
			upd(0, n - 1, i, 1), state[i] = 1;
			for (lg = 0; lg <= LG; lg++) {
				j = queryl1(i, lg);
				if (j >= 0 && state[j] == 0)
					upd(0, n - 1, j, 1), state[j] = 1;
				j = queryr1(i, lg);
				if (j < n && state[j] == 0)
					upd(0, n - 1, j, 1), state[j] = 1;
			}
			state[i] = 0;
			for (lg = 0; lg <= LG; lg++) {
				j = queryl1(i, lg);
				if (j >= 0)
					state[j] = 0;
				j = queryr1(i, lg);
				if (j < n)
					state[j] = 0;
			}
		} else {
			scanf("%d%d", &l, &r), l--, r--;
			if (l == 0 && r == n - 1)
				printf("%d\n", query2(l, r));
			else {
				for (i = l; i <= r; i++)
					upd(l, r, i, 1);
				printf("%d\n", query2(l, r));
				for (i = l; i <= r; i++)
					upd(l, r, i, -1);
			}
		}
	}
	return 0;
}

Compilation message

fish2.c: In function 'main':
fish2.c:166:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  166 |  scanf("%d", &n);
      |  ^~~~~~~~~~~~~~~
fish2.c:168:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  168 |   scanf("%d", &aa[i]);
      |   ^~~~~~~~~~~~~~~~~~~
fish2.c:170:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  170 |  scanf("%d", &q);
      |  ^~~~~~~~~~~~~~~
fish2.c:177:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  177 |   scanf("%d", &t);
      |   ^~~~~~~~~~~~~~~
fish2.c:179:4: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  179 |    scanf("%d%d", &i, &a), i--;
      |    ^~~~~~~~~~~~~~~~~~~~~
fish2.c:218:4: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  218 |    scanf("%d%d", &l, &r), l--, r--;
      |    ^~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Incorrect 10 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 65 ms 4464 KB Output is correct
3 Correct 72 ms 4424 KB Output is correct
4 Correct 66 ms 4344 KB Output is correct
5 Correct 69 ms 4428 KB Output is correct
6 Correct 51 ms 4340 KB Output is correct
7 Correct 48 ms 4476 KB Output is correct
8 Correct 60 ms 4356 KB Output is correct
9 Correct 56 ms 4372 KB Output is correct
10 Correct 57 ms 4456 KB Output is correct
11 Correct 57 ms 4476 KB Output is correct
12 Correct 49 ms 4412 KB Output is correct
13 Correct 48 ms 4408 KB Output is correct
14 Correct 54 ms 4428 KB Output is correct
15 Correct 61 ms 4388 KB Output is correct

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Incorrect 10 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 65 ms 4464 KB Output is correct
3 Correct 72 ms 4424 KB Output is correct
4 Correct 66 ms 4344 KB Output is correct
5 Correct 69 ms 4428 KB Output is correct
6 Correct 51 ms 4340 KB Output is correct
7 Correct 48 ms 4476 KB Output is correct
8 Correct 60 ms 4356 KB Output is correct
9 Correct 56 ms 4372 KB Output is correct
10 Correct 57 ms 4456 KB Output is correct
11 Correct 57 ms 4476 KB Output is correct
12 Correct 49 ms 4412 KB Output is correct
13 Correct 48 ms 4408 KB Output is correct
14 Correct 54 ms 4428 KB Output is correct
15 Correct 61 ms 4388 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Execution timed out 4062 ms 4372 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 65 ms 4464 KB Output is correct
3 Correct 72 ms 4424 KB Output is correct
4 Correct 66 ms 4344 KB Output is correct
5 Correct 69 ms 4428 KB Output is correct
6 Correct 51 ms 4340 KB Output is correct
7 Correct 48 ms 4476 KB Output is correct
8 Correct 60 ms 4356 KB Output is correct
9 Correct 56 ms 4372 KB Output is correct
10 Correct 57 ms 4456 KB Output is correct
11 Correct 57 ms 4476 KB Output is correct
12 Correct 49 ms 4412 KB Output is correct
13 Correct 48 ms 4408 KB Output is correct
14 Correct 54 ms 4428 KB Output is correct
15 Correct 61 ms 4388 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Incorrect 876 ms 5508 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Incorrect 10 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -