# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1039458 | HappyCapybara | Horses (IOI15_horses) | C++17 | 1562 ms | 8028 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 ll long long
int n;
vector<int> x, y;
int init(int N, int X[], int Y[]){
n = N;
x.resize(N);
y.resize(N);
for (int i=0; i<N; i++){
y[i] = Y[i];
x[i] = X[i];
}
ll cur = 1, bsf = 0;
for (int i=0; i<N; i++){
cur *= x[i];
bsf = max(bsf, cur*y[i]);
}
return bsf;
}
int updateX(int pos, int val){
x[pos] = val;
double curd = 0, bsfd = 0;
ll cur = 1, bsf = 0;
for (int i=0; i<n; i++){
curd += log(x[i]);
cur = (cur*x[i]) % 1000000007;
if (curd+log(y[i]) > bsfd){
bsfd = curd+log(y[i]);
bsf = (cur*y[i]) % 1000000007;
}
}
return bsf;
}
int updateY(int pos, int val){
y[pos] = val;
double curd = 0, bsfd = 0;
ll cur = 1, bsf = 0;
for (int i=0; i<n; i++){
curd += log(x[i]);
cur = (cur*x[i]) % 1000000007;
if (curd+log(y[i]) > bsfd){
bsfd = curd+log(y[i]);
bsf = (cur*y[i]) % 1000000007;
}
}
return bsf;
}
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... |