답안 #964463

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
964463	2024-04-17T00:23:59 Z	beaboss	말 (IOI15_horses)	C++14	17 / 100	197 ms	28432 KB

horses

// Source: https://oj.uz/problem/view/IOI15_horses
// 

#include "bits/stdc++.h"

using namespace std;

#define s second
#define f first
#define pb push_back

typedef long long ll;

typedef pair<ll, ll> pii;
typedef vector<pii> vpii;

typedef vector<ll> vi;

#define FOR(i, a, b) for (ll i = (a); i<b; i++)

bool ckmin(ll& a, ll b){ return b < a ? a = b, true : false; }

bool ckmax(ll& a, ll b){ return b > a ? a = b, true : false; }

const ll N = 1e5 + 10;
const ll MOD = 1e9 + 7;
#define lc i << 1
#define rc (i << 1) + 1



ll binpow(ll x, ll n) { // x ^ n
	ll res = 1;
	while (n > 0) {
		if (n & 1) res = (res * x) % MOD;
		x = (x * x) % MOD;
		n/=2;
	}
	return res;
}

struct node {
	ll val, lz;
} st[4 * N];

void down(ll i) {
	if (st[i].lz == 1) return;
	st[lc].lz = st[lc].lz * st[i].lz % MOD;
	st[rc].lz = st[rc].lz * st[i].lz %MOD;
	st[lc].val = st[lc].val * st[i].lz % MOD;
	st[rc].val = st[rc].val * st[i].lz % MOD;
	st[i].lz = 1;

}

void up(ll i) {
	st[i].val = max(st[lc].val, st[rc].val);
}

void update(ll ul, ll ur, ll val, ll i = 1, ll l = 0, ll r = N) {
	// cout << l << r << ' ' << st[i].lz << ' ' << val << endl;

	if (r == l) return;
	if (ul <= l && r <= ur) {
		st[i].lz = (st[i].lz*val) % MOD;
		st[i].val = (st[i].val * val) % MOD;
		// cout << l << r <<  ' ' << st[i].lz << ' ' << val  << endl;

		return;
	}
	if (l == r-1) return;

	down(i);
	ll m = (l + r) / 2;
	if (ul < m) update(ul, ur, val, lc, l, m);
	if (m  < ur) update(ul, ur, val, rc, m, r);

	up(i);

	// cout << l << r << ' ' << st[i].lz << ' ' << val << endl;
}

vi fx, fy;
ll nn;
ll init(int n, int X[], int Y[]) {
	nn = n;
	vi x(n), y(n);
	FOR(i, 0, n) {
		x[i] = X[i];
		y[i] = Y[i];
	}
	fx = x, fy = y;
	FOR(i, 0, 4 * N) {
		st[i].val = st[i].lz = 1;
	}
	FOR(i, 0, n) {
		update(i, n, x[i]);
		// break;
		update(i, i + 1, y[i]);
		// break;

	}

	return st[1].val;
}

ll updateX(int pos, int val) {
	update(pos, nn, binpow(fx[pos], MOD-2));
	fx[pos]=val;
	update(pos, nn, fx[pos]);
	return st[1].val;
}

ll updateY(int pos, int val) {
	update(pos, pos + 1, binpow(fy[pos], MOD-2));
	fy[pos]=val;
	update(pos, pos, fy[pos]);
	return st[1].val;
}


// int main() {
// 	ios::sync_with_stdio(false);
// 	cin.tie(nullptr);

// 	cout << init(3, {2, 1, 3}, {3, 4, 1}) << endl;
// 	cout << updateY(1, 2) << endl;

// }

Subtask #1
17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	6488 KB	Output is correct
2	Correct	2 ms	6492 KB	Output is correct
3	Correct	2 ms	6592 KB	Output is correct
4	Correct	3 ms	6492 KB	Output is correct
5	Correct	2 ms	6492 KB	Output is correct
6	Correct	2 ms	6492 KB	Output is correct
7	Correct	2 ms	6592 KB	Output is correct
8	Correct	2 ms	6492 KB	Output is correct
9	Correct	2 ms	6488 KB	Output is correct
10	Correct	3 ms	6488 KB	Output is correct
11	Correct	2 ms	6492 KB	Output is correct
12	Correct	2 ms	6492 KB	Output is correct
13	Correct	2 ms	6584 KB	Output is correct
14	Correct	2 ms	6492 KB	Output is correct
15	Correct	2 ms	6492 KB	Output is correct
16	Correct	2 ms	6492 KB	Output is correct
17	Correct	2 ms	6488 KB	Output is correct
18	Correct	2 ms	6588 KB	Output is correct
19	Correct	2 ms	6492 KB	Output is correct
20	Correct	2 ms	6492 KB	Output is correct

Subtask #2
0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	6592 KB	Output is correct
2	Correct	2 ms	6488 KB	Output is correct
3	Correct	3 ms	6500 KB	Output is correct
4	Correct	2 ms	6496 KB	Output is correct
5	Correct	2 ms	6492 KB	Output is correct
6	Correct	2 ms	6492 KB	Output is correct
7	Correct	2 ms	6496 KB	Output is correct
8	Correct	2 ms	6584 KB	Output is correct
9	Correct	2 ms	6488 KB	Output is correct
10	Correct	2 ms	6496 KB	Output is correct
11	Correct	2 ms	6500 KB	Output is correct
12	Correct	2 ms	6496 KB	Output is correct
13	Correct	2 ms	6492 KB	Output is correct
14	Correct	3 ms	6492 KB	Output is correct
15	Correct	2 ms	6492 KB	Output is correct
16	Correct	2 ms	6492 KB	Output is correct
17	Correct	2 ms	6492 KB	Output is correct
18	Correct	2 ms	6744 KB	Output is correct
19	Correct	2 ms	6492 KB	Output is correct
20	Correct	2 ms	6496 KB	Output is correct
21	Incorrect	2 ms	6492 KB	Output isn't correct
22	Halted	0 ms	0 KB	-

Subtask #3
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	197 ms	28432 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #4
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	6488 KB	Output is correct
2	Correct	2 ms	6492 KB	Output is correct
3	Correct	2 ms	6492 KB	Output is correct
4	Correct	5 ms	6488 KB	Output is correct
5	Correct	4 ms	6492 KB	Output is correct
6	Correct	3 ms	6492 KB	Output is correct
7	Correct	3 ms	6492 KB	Output is correct
8	Correct	4 ms	6508 KB	Output is correct
9	Correct	2 ms	6492 KB	Output is correct
10	Correct	3 ms	6492 KB	Output is correct
11	Correct	5 ms	6492 KB	Output is correct
12	Correct	2 ms	6492 KB	Output is correct
13	Correct	3 ms	6492 KB	Output is correct
14	Correct	2 ms	6492 KB	Output is correct
15	Correct	5 ms	6488 KB	Output is correct
16	Correct	2 ms	6492 KB	Output is correct
17	Correct	3 ms	6588 KB	Output is correct
18	Correct	2 ms	6488 KB	Output is correct
19	Correct	3 ms	6492 KB	Output is correct
20	Correct	4 ms	6644 KB	Output is correct
21	Incorrect	2 ms	6584 KB	Output isn't correct
22	Halted	0 ms	0 KB	-

Subtask #5
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	6488 KB	Output is correct
2	Correct	2 ms	6492 KB	Output is correct
3	Correct	2 ms	6492 KB	Output is correct
4	Correct	2 ms	6492 KB	Output is correct
5	Correct	2 ms	6492 KB	Output is correct
6	Correct	2 ms	6492 KB	Output is correct
7	Correct	2 ms	6492 KB	Output is correct
8	Correct	2 ms	6492 KB	Output is correct
9	Correct	2 ms	6492 KB	Output is correct
10	Correct	2 ms	6492 KB	Output is correct
11	Correct	2 ms	6492 KB	Output is correct
12	Correct	2 ms	6488 KB	Output is correct
13	Correct	2 ms	6492 KB	Output is correct
14	Correct	2 ms	6524 KB	Output is correct
15	Correct	2 ms	6488 KB	Output is correct
16	Correct	2 ms	6492 KB	Output is correct
17	Correct	2 ms	6492 KB	Output is correct
18	Correct	2 ms	6492 KB	Output is correct
19	Correct	2 ms	6492 KB	Output is correct
20	Correct	2 ms	6500 KB	Output is correct
21	Incorrect	2 ms	6500 KB	Output isn't correct
22	Halted	0 ms	0 KB	-

답안 #964463

Compilation message

Subtask #1 17.0 / 17.0

Subtask #2 0 / 17.0

Subtask #3 0 / 20.0

Subtask #4 0 / 23.0

Subtask #5 0 / 23.0

Subtask #1
17.0 / 17.0

Subtask #2
0 / 17.0

Subtask #3
0 / 20.0

Subtask #4
0 / 23.0

Subtask #5
0 / 23.0