답안 #1004915

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1004915	2024-06-22T03:25:08 Z	pawned	말 (IOI15_horses)	C++17	54 / 100	1500 ms	25524 KB

horses

#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")

#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back
typedef long long ll;
typedef pair<ll, ll> ii;
typedef vector<ll> vi;

#include "horses.h"

const ll MOD = 1e9 + 7;
const ll MAX = 1e9 + 5;

ll norm(ll x) {
	x %= MOD;
	x += MOD;
	x %= MOD;
	return x;
}

ll binpow(ll x, ll y) {
	x = norm(x);
	ll res = 1;
	while (y > 0) {
		if (y % 2 == 1)
			res = norm(res * x);
		x = norm(x * x);
		y /= 2;
	}
	return res;
}

ll inv(ll x) {
	return binpow(x, MOD - 2);
}

int N;

vi X;
vi Y;

ll prodall = 1;	// product of all X_i

ll solve() {
	int bestp = N - 1;
	ll currn = Y[N - 1];
	ll currd = 1;
	ll bestn = currn;
	ll bestd = currd;
	for (int i = N - 2; i >= 0; i--) {
		currn = Y[i];
		currd *= X[i + 1];
		if (currd >= MAX)
			break;
		if (currn * bestd > bestn * currd) {
			bestp = i;
			bestn = currn;
			bestd = currd;
		}
	}
	ll ans = prodall;
	for (int i = bestp + 1; i < N; i++) {
		ans *= inv(X[i]);
		ans = norm(ans);
	}
	ans *= Y[bestp];
	ans = norm(ans);
	return ans;
}

int init(int n, int x[], int y[]) {
	N = n;
	X = vi(N); Y = vi(N);
	for (int i = 0; i < N; i++) {
		X[i] = x[i];
		Y[i] = y[i];
	}
	for (int i = 0; i < N; i++) {
		prodall *= X[i];
		prodall = norm(prodall);
	}
	ll ans = solve();
	return (int)(ans);
}

int updateX(int pos, int val) {
	prodall = norm(prodall * inv(X[pos]));
	X[pos] = val;
	prodall = norm(prodall * X[pos]);
	ll ans = solve();
	return (int)(ans);
}

int updateY(int pos, int val) {
	Y[pos] = val;
	ll ans = solve();
	return (int)(ans);
}

Subtask #1
17.0 / 17.0

#	결과	메모리	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	348 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	348 KB	Output is correct
8	Correct	348 KB	Output is correct
9	Correct	348 KB	Output is correct
10	Correct	348 KB	Output is correct
11	Correct	348 KB	Output is correct
12	Correct	348 KB	Output is correct
13	Correct	348 KB	Output is correct
14	Correct	344 KB	Output is correct
15	Correct	348 KB	Output is correct
16	Correct	348 KB	Output is correct
17	Correct	348 KB	Output is correct
18	Correct	348 KB	Output is correct
19	Correct	348 KB	Output is correct
20	Correct	348 KB	Output is correct

Subtask #2
17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	3 ms	464 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	3 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	21 ms	464 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	2 ms	456 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	154 ms	348 KB	Output is correct
32	Correct	55 ms	348 KB	Output is correct

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	553 ms	14676 KB	Output is correct
2	Correct	73 ms	25524 KB	Output is correct
3	Correct	42 ms	16856 KB	Output is correct
4	Correct	70 ms	20704 KB	Output is correct

Subtask #4
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	360 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	344 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	3 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	3 ms	344 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	19 ms	456 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	2 ms	348 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	148 ms	432 KB	Output is correct
32	Correct	58 ms	440 KB	Output is correct
33	Execution timed out	1509 ms	12124 KB	Time limit exceeded
34	Halted	0 ms	0 KB	-

Subtask #5
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	344 KB	Output is correct
16	Correct	0 ms	344 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	4 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	3 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	21 ms	348 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	2 ms	348 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	156 ms	348 KB	Output is correct
32	Correct	53 ms	344 KB	Output is correct
33	Correct	530 ms	14676 KB	Output is correct
34	Correct	73 ms	25500 KB	Output is correct
35	Correct	42 ms	16876 KB	Output is correct
36	Correct	69 ms	20732 KB	Output is correct
37	Execution timed out	1562 ms	15956 KB	Time limit exceeded
38	Halted	0 ms	0 KB	-

답안 #1004915

Compilation message

Subtask #1 17.0 / 17.0

Subtask #2 17.0 / 17.0

Subtask #3 20.0 / 20.0

Subtask #4 0 / 23.0

Subtask #5 0 / 23.0

Subtask #1
17.0 / 17.0

Subtask #2
17.0 / 17.0

Subtask #3
20.0 / 20.0

Subtask #4
0 / 23.0

Subtask #5
0 / 23.0