# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
425015 | InternetPerson10 | Horses (IOI15_horses) | C++17 | 1569 ms | 15960 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>
typedef long long ll;
using namespace std;
const ll MOD = 1000000007;
vector<ll> x, y;
ll modpow(int n, int e = MOD-2) {
if(e == 0) return 1;
if(e == 1) return n;
ll xx = modpow(n, e/2);
xx *= xx;
xx %= MOD;
if(e%2) {
xx *= n;
xx %= MOD;
}
return xx;
}
ll getBest() {
ll horses = 1;
ll best = 1;
ll g = 1, k = 1;
for(int i = 0; i < x.size(); i++) {
horses *= ((x[i]*y[i])%MOD);
if(i > 0) {
horses %= MOD;
horses *= modpow(y[i-1]);
}
horses %= MOD;
k *= x[i];
if(k > g) {
g = y[i];
k = 1;
best = horses;
}
else if(k*y[i] > g) {
g = y[i];
k = 1;
best = horses;
}
}
return best%MOD;
}
int init(int N, int X[], int Y[]) {
x.resize(N);
y.resize(N);
for(int i = 0; i < N; i++) {
x[i] = X[i]; y[i] = Y[i];
}
return (int)getBest();
}
int updateX(int pos, int val) {
x[pos] = val;
return (int)getBest();
}
int updateY(int pos, int val) {
y[pos] = val;
return (int)getBest();
}
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... |