# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
299220 | ASDF123 | Horses (IOI15_horses) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "horses.h"
#include "grader.cpp"
#include <bits/stdc++.h>
#define ll long long
#define double long double
using namespace std;
const int N = (int)5e5 + 5;
const int MOD = (int)1e9 + 7;
const double eps = 1e-9;
int x[N], y[N];
int n;
double get(double x) {
double r = 10;
double l = 0;
while(r-l>eps){
double m = (l+r)/2;
if ( pow(10, m) > x)
r=m;
else
l=m;
}
return l;
}
int calc() {
int pos = -1;
double best = 0;
double pref = 0;
for (int i = 0; i < n; i++) {
pref += (double)get(x[i]*1.0);
if (pref + (double)get(y[i]*1.0) - best > eps) {
best = pref + get(y[i]*1.0);
pos = i;
}
}
long long ans = 1;
for (int i = 0; i <= pos; i++) {
ans *= x[i], ans %= MOD;
}
ans *= y[pos], ans %= MOD;
return ans;
}
int init(int NN, int X[], int Y[]) {
n = NN;
for (int i = 0; i < n; i++) {
x[i] = X[i];
y[i] = Y[i];
}
return calc();
}
int updateX(int pos, int val) {
x[pos] = val;
return calc();
}
int updateY(int pos, int val) {
y[pos] = val;
return calc();
}