oj.uz

Submission #1004157

# Submission time Handle Problem Language Result Execution time Memory
1004157 2024-06-21T05:57:20 Z coolboy19521 Horses (IOI15_horses) C++17
17 / 100
 64 ms 60264 KB 
#include "bits/stdc++.h"
#include "horses.h"
#define i64 long long

using namespace std;

const int sz = 5e5 + 25;
const i64 md = 1e9 + 7;
const i64 inf = 1e18;

i64 lzm[sz * 4], lzd[sz * 4];
i64 a[sz], b[sz], c[sz];
i64 st[sz * 4];
int n;

void build(int le, int ri, int v) {
	if (le == ri) {
		st[v] = c[le] * b[le];
		return;
	}
	int mi = le + (ri - le) / 2;
	build(le, mi, v * 2);
	build(mi + 1, ri, v * 2 + 1);
	st[v] = max(st[v * 2], st[v * 2 + 1]);
}

void relax(int v) {
	st[v] *= lzm[v];
	st[v] /= lzd[v];
	if (v * 2 < sz * 4) {
		lzm[v * 2] *= lzm[v];
		lzm[v * 2 + 1] *= lzm[v];
		lzd[v * 2] *= lzd[v];
		lzd[v * 2 + 1] *= lzd[v];
	}
	lzm[v] = lzd[v] = 1;
}

void rupdate(int le, int ri, int ql, int qr, int v, i64 m, i64 d) {
	relax(v);
	if (le > qr || ri < ql) return;
	if (ql <= le && ri <= qr) {
		lzm[v] = m;
		lzd[v] = d;
		relax(v);
		return;
	}
	int mi = le + (ri - le) / 2;
	rupdate(le, mi, ql, qr, v * 2, m, d);
	rupdate(mi + 1, ri, ql, qr, v * 2 + 1, m, d);
	st[v] = max(st[v * 2], st[v * 2 + 1]);
}

void pupdate(int le, int ri, int ix, int v, i64 m, i64 d) {
	relax(v);
	if (le > ix || ri < ix) return;
	if (le == ix && ix == ri) {
		st[v] *= m;
		st[v] /= d;
		return;
	}
	int mi = le + (ri - le) / 2;
	pupdate(le, mi, ix, v * 2, m, d);
	pupdate(mi + 1, ri, ix, v * 2 + 1, m, d);
	st[v] = max(st[v * 2], st[v * 2 + 1]);
}

i64 query(int le, int ri, int ql, int qr, int v) {
	if (le > qr || ri < ql) {
		return -1;
	}
	relax(v);
	if (ql <= le && ri <= qr) {
		return st[v];
	}
	int mi = le + (ri - le) / 2;
	i64 lq = query(le, mi, ql, qr, v * 2);
	i64 rq = query(mi + 1, ri, ql, qr, v * 2 + 1);
	return max(lq, rq);
}

int init(int N, int X[], int Y[]) {
	c[0] = 1;
	n = N;

	for (int i = 1; i <= N; i ++) {
		c[i] = c[i - 1] * X[i - 1];
		a[i] = X[i - 1];
		b[i] = Y[i - 1];
	}

	for (int i = 0; i < sz * 4; i ++) {
		lzm[i] = lzd[i] = 1;
	}

	build(1, N, 1);

	i64 r = query(1, n, 1, n, 1) % md;

	return (int) r;
}

int updateX(int pos, int val) {	
	pos ++;
	rupdate(1, n, pos, n, 1, val, a[pos]);
	a[pos] = val;
	i64 r = query(1, n, 1, n, 1) % md;
	return (int) r;
}

int updateY(int pos, int val) {
	pos ++;
	// cout << "MUL " << val << ' ' << "DIV " << b[pos] << '\n';
	pupdate(1, n, pos, 1, val, b[pos]);
	b[pos] = val;
	i64 r = query(1, n, 1, n, 1) % md;
	return (int) r;
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 31576 KB Output is correct
2 Correct 13 ms 31552 KB Output is correct
3 Correct 11 ms 31580 KB Output is correct
4 Correct 10 ms 31712 KB Output is correct
5 Correct 12 ms 31580 KB Output is correct
6 Correct 15 ms 31732 KB Output is correct
7 Correct 10 ms 31580 KB Output is correct
8 Correct 11 ms 31624 KB Output is correct
9 Correct 13 ms 31576 KB Output is correct
10 Correct 12 ms 31580 KB Output is correct
11 Correct 10 ms 31576 KB Output is correct
12 Correct 11 ms 31580 KB Output is correct
13 Correct 11 ms 31576 KB Output is correct
14 Correct 12 ms 31580 KB Output is correct
15 Correct 11 ms 31568 KB Output is correct
16 Correct 11 ms 31676 KB Output is correct
17 Correct 10 ms 31580 KB Output is correct
18 Correct 10 ms 31676 KB Output is correct
19 Correct 11 ms 31576 KB Output is correct
20 Correct 10 ms 31580 KB Output is correct

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 31576 KB Output is correct
2 Correct 9 ms 31668 KB Output is correct
3 Correct 9 ms 31580 KB Output is correct
4 Correct 10 ms 31576 KB Output is correct
5 Correct 14 ms 31576 KB Output is correct
6 Correct 9 ms 31580 KB Output is correct
7 Correct 11 ms 31776 KB Output is correct
8 Correct 10 ms 31704 KB Output is correct
9 Correct 11 ms 31580 KB Output is correct
10 Correct 10 ms 31580 KB Output is correct
11 Correct 10 ms 31576 KB Output is correct
12 Correct 14 ms 31664 KB Output is correct
13 Correct 12 ms 31576 KB Output is correct
14 Correct 13 ms 31724 KB Output is correct
15 Correct 13 ms 31656 KB Output is correct
16 Correct 12 ms 31580 KB Output is correct
17 Correct 12 ms 31580 KB Output is correct
18 Correct 12 ms 31632 KB Output is correct
19 Correct 12 ms 31684 KB Output is correct
20 Correct 13 ms 31624 KB Output is correct
21 Incorrect 12 ms 31560 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 64 ms 60264 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 31680 KB Output is correct
2 Correct 12 ms 31604 KB Output is correct
3 Correct 12 ms 31580 KB Output is correct
4 Correct 12 ms 31580 KB Output is correct
5 Correct 11 ms 31564 KB Output is correct
6 Correct 11 ms 31672 KB Output is correct
7 Correct 12 ms 31544 KB Output is correct
8 Correct 13 ms 31668 KB Output is correct
9 Correct 11 ms 31624 KB Output is correct
10 Correct 12 ms 31640 KB Output is correct
11 Correct 11 ms 31780 KB Output is correct
12 Correct 12 ms 31580 KB Output is correct
13 Correct 11 ms 31668 KB Output is correct
14 Correct 12 ms 31596 KB Output is correct
15 Correct 11 ms 31584 KB Output is correct
16 Correct 11 ms 31752 KB Output is correct
17 Correct 13 ms 31556 KB Output is correct
18 Correct 13 ms 31672 KB Output is correct
19 Correct 12 ms 31588 KB Output is correct
20 Correct 12 ms 31592 KB Output is correct
21 Incorrect 13 ms 31604 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 31592 KB Output is correct
2 Correct 10 ms 31592 KB Output is correct
3 Correct 11 ms 31688 KB Output is correct
4 Correct 11 ms 31640 KB Output is correct
5 Correct 12 ms 31624 KB Output is correct
6 Correct 13 ms 31592 KB Output is correct
7 Correct 12 ms 31772 KB Output is correct
8 Correct 11 ms 31772 KB Output is correct
9 Correct 12 ms 31704 KB Output is correct
10 Correct 13 ms 31708 KB Output is correct
11 Correct 12 ms 31540 KB Output is correct
12 Correct 12 ms 31640 KB Output is correct
13 Correct 12 ms 31612 KB Output is correct
14 Correct 12 ms 31580 KB Output is correct
15 Correct 12 ms 31672 KB Output is correct
16 Correct 11 ms 31784 KB Output is correct
17 Correct 11 ms 31680 KB Output is correct
18 Correct 12 ms 31580 KB Output is correct
19 Correct 12 ms 31580 KB Output is correct
20 Correct 11 ms 31676 KB Output is correct
21 Incorrect 12 ms 31604 KB Output isn't correct
22 Halted 0 ms 0 KB -