| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 1041954 |
2024-08-02T10:49:32 Z |
fv3 |
Horses (IOI15_horses) |
C++14 |
|
467 ms |
42000 KB |
#include <bits/stdc++.h>
#include "horses.h"
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
int N; vector<ll> X, Y;
int nt = 1;
vector<ll> st;
vector<ll> st_mod;
int mx_index = 0;
ll get_range(int l, int r, int k, int x, int y)
{
if (y < l || x > r) return 1;
if (x >= l && y <= r) return st[k];
int c = (x + y) / 2;
return get_range(l, r, k*2, x, c) * get_range(l, r, k*2|1, c+1, y);
}
ll get_mod_range(int l, int r, int k, int x, int y)
{
if (y < l || x > r) return 1;
if (x >= l && y <= r) return st_mod[k];
int c = (x + y) / 2;
return (get_mod_range(l, r, k*2, x, c) * get_mod_range(l, r, k*2|1, c+1, y)) % mod;
}
int get_full_max()
{
ll res = (X[0] * Y[0]) % mod, cnt = X[0];
mx_index = 0;
for (int i = 1; i < N; i++)
{
cnt = (cnt * X[i]) % mod;
ll last_mult = Y[mx_index];
ll mult_range = get_range(mx_index + 1, i, 1, 0, nt - 1);
if (mult_range >= last_mult || mult_range * Y[i] >= last_mult)
{
res = (cnt * Y[i]) % mod;
mx_index = i;
}
}
return (int)res;
}
int get_max()
{
int s = max(0, N - 61);
mx_index = s;
ll cnt = get_mod_range(0, s, 1, 0, nt - 1);
ll res = (cnt * Y[s]) % mod;
for (int i = s + 1; i < N; i++)
{
cnt = (cnt * X[i]) % mod;
ll last_mult = Y[mx_index];
ll mult_range = get_range(mx_index + 1, i, 1, 0, nt - 1);
if (mult_range >= last_mult || mult_range * Y[i] >= last_mult)
{
res = (cnt * Y[i]) % mod;
mx_index = i;
}
}
return (int)res;
}
int init(int n, int x[], int y[])
{
N = n;
X.resize(N);
Y.resize(N);
for (int i = 0; i < N; i++)
{
X[i] = x[i];
Y[i] = y[i];
}
while (nt < N) nt <<= 1;
st = st_mod = vector<ll>(2 * nt, 1);
for (int i = 0; i < N; i++)
{
st[nt + i] = X[i];
st_mod[nt + i] = X[i];
}
for (int i = nt-1; i >= 1; i--)
{
st[i] = st[i*2] * st[i*2|1];
st_mod[i] = (st_mod[i*2] * st_mod[i*2|1]) % mod;
}
return get_full_max();
}
int updateX(int pos, int val)
{
X[pos] = val;
pos += nt;
st[pos] = val;
st_mod[pos] = val;
for (pos /= 2; pos >= 1; pos /= 2)
{
st[pos] = st[pos*2] * st[pos*2|1];
st_mod[pos] = (st_mod[pos*2] * st_mod[pos*2|1]) % mod;
}
return get_max();
}
int updateY(int pos, int val)
{
Y[pos] = val;
return get_max();
}
| # |
Verdict |
Execution time |
Memory |
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 |
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 |
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 |
| # |
Verdict |
Execution time |
Memory |
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 |
344 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 |
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 |
344 KB |
Output is correct |
| 21 |
Correct |
0 ms |
348 KB |
Output is correct |
| 22 |
Correct |
0 ms |
348 KB |
Output is correct |
| 23 |
Incorrect |
2 ms |
348 KB |
Output isn't correct |
| 24 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
452 ms |
29524 KB |
Output is correct |
| 2 |
Correct |
449 ms |
42000 KB |
Output is correct |
| 3 |
Correct |
440 ms |
33360 KB |
Output is correct |
| 4 |
Correct |
467 ms |
37152 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 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 |
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 |
348 KB |
Output is correct |
| 16 |
Correct |
1 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 |
Incorrect |
2 ms |
348 KB |
Output isn't correct |
| 24 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
1 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 |
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 |
344 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 |
Incorrect |
3 ms |
348 KB |
Output isn't correct |
| 24 |
Halted |
0 ms |
0 KB |
- |
