# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
999522 | Alfraganus | Horses (IOI15_horses) | C++17 | 1569 ms | 9164 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;
const long long mod = 1e9 + 7;
vector<int> x, y;
int init(int n, int X[], int Y[]) {
for(int i = 0; i < n; i ++)
x.push_back(X[i]);
for(int i = 0; i < n; i ++)
y.push_back(Y[i]);
long long ans = 1, p = 1;
for(int i = 0; i < n; i ++){
p = (p * x[i]) % mod;
ans = max(ans, (p * y[i]) % mod);
}
int res = ans;
return res;
}
int updateX(int pos, int val) {
x[pos] = val;
long long ans = 1, p = 1;
for(int i = 0; i < (int)x.size(); i ++)
p = (p * x[i]) % mod, ans = max(ans, (p * y[i]) % mod);
int res = ans;
return res;
}
int updateY(int pos, int val) {
y[pos] = val;
long long ans = 1, p = 1;
for(int i = 0; i < (int)y.size(); i ++)
p = (p * x[i]) % mod, ans = max(ans, (p * y[i]) % mod);
int res = ans;
return res;
}
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... |