oj.uz

Submission #247420

# Submission time Handle Problem Language Result Execution time Memory
247420 2020-07-11T10:54:24 Z ernestvw Horses (IOI15_horses) C++11
34 / 100
 139 ms 13324 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

const ll mod = 1e9 + 7;

int n;
vector<ll> C, P;

ll preprod = 1;

ll fp(ll x, ll y){
	ll res=1;
	while(y){
		if(y%2LL)res%=x;
		res%=mod;
		x*=x;
		x%=mod;
		y/=2LL;
	}
	return res;
}

ll inv(ll x){return fp(x,mod-2LL);}

int solve() {
	ll prod = C[n - 1];
	int best = n - 1;
	long double ldprod = (long double)C[n-1];
	for(int i = n - 2; i >= 0; --i) {
		prod *= C[i];
		ldprod *= C[i];
		long double x = ldprod * (long double)P[best];
		if(x >= 1.5e18) break;
		if(prod * P[best] <= C[i] * P[i]) {
			best = i;
			prod = C[i];
			ldprod = (long double)C[i];
		}
	}
	prod = 1;
	if(n > 1000) {
		prod = preprod;
		for(int i = n - 100; i <= best; ++i)
			prod = (prod * C[i]) % mod;
		prod = (prod * P[best]) % mod;
		return int(prod % mod);
	}
	for(int i = 0; i <= best; ++i) {
		prod *= C[i];
		prod %= mod;
	}
	prod *= P[best];
	prod %= mod;
	return int(prod % mod);
}

int init(int N, int X[], int Y[]) {
	n = N;
	C.resize(n);
	P.resize(n);
	for(int i = 0; i < n; ++i) C[i] = X[i];
	for(int i = 0; i < n; ++i) P[i] = Y[i];
	if(n > 1000) {
		preprod = 1;
		for(int i = 0; i < n - 100; ++i) {
			preprod *= C[i];
			preprod %= mod;
		}
	}
	return solve();
}

int updateX(int pos, int val) {
	C[pos] = val;
	if(pos < n - 100) {
		preprod *= inv(val);
		preprod %= mod;
		preprod *= val;
		preprod %= mod;
	}
	return solve();
}

int updateY(int pos, int val) {
	P[pos] = val;
	return solve();
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 256 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 256 KB Output is correct
13 Correct 4 ms 256 KB Output is correct
14 Correct 4 ms 256 KB Output is correct
15 Correct 4 ms 256 KB Output is correct
16 Correct 5 ms 256 KB Output is correct
17 Correct 5 ms 256 KB Output is correct
18 Correct 4 ms 256 KB Output is correct
19 Correct 4 ms 256 KB Output is correct
20 Correct 4 ms 256 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 4 ms 256 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 288 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 4 ms 256 KB Output is correct
11 Correct 4 ms 256 KB Output is correct
12 Correct 4 ms 256 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 4 ms 256 KB Output is correct
15 Correct 5 ms 436 KB Output is correct
16 Correct 4 ms 256 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 256 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 4 ms 256 KB Output is correct
22 Correct 4 ms 256 KB Output is correct
23 Correct 10 ms 384 KB Output is correct
24 Correct 10 ms 384 KB Output is correct
25 Correct 10 ms 384 KB Output is correct
26 Correct 10 ms 384 KB Output is correct
27 Correct 11 ms 384 KB Output is correct
28 Correct 10 ms 384 KB Output is correct
29 Correct 12 ms 384 KB Output is correct
30 Correct 10 ms 384 KB Output is correct
31 Correct 8 ms 384 KB Output is correct
32 Correct 10 ms 384 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 13168 KB Output is correct
2 Incorrect 139 ms 13304 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 256 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 4 ms 256 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 256 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 256 KB Output is correct
10 Correct 5 ms 256 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 4 ms 256 KB Output is correct
13 Correct 4 ms 256 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 4 ms 256 KB Output is correct
16 Correct 5 ms 256 KB Output is correct
17 Correct 5 ms 256 KB Output is correct
18 Correct 4 ms 256 KB Output is correct
19 Correct 4 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 4 ms 256 KB Output is correct
22 Correct 4 ms 256 KB Output is correct
23 Correct 10 ms 384 KB Output is correct
24 Correct 10 ms 408 KB Output is correct
25 Correct 10 ms 384 KB Output is correct
26 Correct 10 ms 384 KB Output is correct
27 Correct 11 ms 384 KB Output is correct
28 Correct 10 ms 384 KB Output is correct
29 Correct 11 ms 384 KB Output is correct
30 Correct 10 ms 384 KB Output is correct
31 Correct 9 ms 384 KB Output is correct
32 Correct 11 ms 512 KB Output is correct
33 Incorrect 136 ms 12280 KB Output isn't correct
34 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 4 ms 256 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 256 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 4 ms 256 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 4 ms 256 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 5 ms 256 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 4 ms 256 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 4 ms 256 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 256 KB Output is correct
22 Correct 5 ms 256 KB Output is correct
23 Correct 12 ms 384 KB Output is correct
24 Correct 10 ms 384 KB Output is correct
25 Correct 10 ms 384 KB Output is correct
26 Correct 10 ms 384 KB Output is correct
27 Correct 11 ms 384 KB Output is correct
28 Correct 10 ms 384 KB Output is correct
29 Correct 11 ms 384 KB Output is correct
30 Correct 9 ms 384 KB Output is correct
31 Correct 10 ms 384 KB Output is correct
32 Correct 10 ms 384 KB Output is correct
33 Correct 100 ms 13176 KB Output is correct
34 Incorrect 138 ms 13324 KB Output isn't correct
35 Halted 0 ms 0 KB -