# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
299203 | ASDF123 | Horses (IOI15_horses) | C++17 | 1558 ms | 8824 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
using namespace std;
const int N = (int)5e5 + 5;
const int MOD = (int)1e9 + 7;
int x[N], y[N];
int n;
int calc() {
ll ans = 0;
ll mult = 1;
for (int i = 0; i < n; i++) {
mult *= x[i];
ans = max(ans, mult * y[i]);
}
return ans % MOD;
}
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();
}
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... |