# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
719452 | thimote75 | Horses (IOI15_horses) | C++14 | 94 ms | 55988 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 <bits/stdc++.h>
using namespace std;
#define ld long double
#define num long long
const num MOD = 1e9 + 7;
vector<num> X;
vector<num> Y;
vector<ld> lX;
vector<ld> lY;
int compute () {
ld max_v = 0;
ld sum_v = 0;
num prod_v = 1;
num mx_p_v = 0;
for (int j = 0; j < lX.size(); j ++) {
sum_v += lX[j];
ld cur_v = sum_v + lY[j];
prod_v *= X[j];
prod_v %= MOD;
if (cur_v > max_v) {
max_v = cur_v;
mx_p_v = (prod_v * Y[j]) % MOD;
}
}
int res0 = mx_p_v;
int res1 = round(exp(max_v));
//cout << res0 << " " << res1 << endl;
if (res0 != res1) assert(false);
return res0;
}
int init(int N, int _X[], int _Y[]) {
X.resize(N);
Y.resize(N);
lX.resize(N);
lY.resize(N);
for (int i = 0; i < N; i ++) {
X [i] = _X[i];
Y [i] = _Y[i];
lX[i] = log((ld) _X[i]);
lY[i] = log((ld) _Y[i]);
}
return compute();
}
int updateX(int pos, int val) {
X [pos] = val;
lX[pos] = log((ld) val);
return compute();
}
int updateY(int pos, int val) {
Y [pos] = val;
lY[pos] = log((ld) val);
return compute();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |