# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1004797 | magikarp23 | Horses (IOI15_horses) | C++17 | 1556 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 <bits/stdc++.h>
#include "horses.h"
using namespace std;
const int MAX_N = 500000 + 1;
long long MOD = 1000000000 + 7;
int X_store[MAX_N];
int Y_store[MAX_N];
int N_store;
int init(int N, int X[], int Y[]) {
N_store = N;
int max_profit = 0;
int num_horses = 1;
for (int i=0; i<N; i++) {
X_store[i] = X[i];
Y_store[i] = Y[i];
num_horses *= X[i];
max_profit = max(max_profit, num_horses * Y[i]);
}
return max_profit % MOD;
}
int updateX(int pos, int val) {
X_store[pos] = val;
int max_profit = 0;
int num_horses = 1;
for (int i=0; i<N_store; i++) {
num_horses *= X_store[i];
max_profit = max(max_profit, num_horses * Y_store[i]);
}
return max_profit % MOD;
}
int updateY(int pos, int val) {
Y_store[pos] = val;
int max_profit = 0;
int num_horses = 1;
for (int i=0; i<N_store; i++) {
num_horses *= X_store[i];
max_profit = max(max_profit, num_horses * Y_store[i]);
}
return max_profit % MOD;
}
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... |