# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
41873 | funcsr | Horses (IOI15_horses) | C++14 | 28 ms | 8820 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 <vector>
#include <iostream>
#include <algorithm>
#include <queue>
#define rep(i, n) for (int i=0; i<(n); i++)
using namespace std;
int N;
int init(int NN, int X[], int Y[]) {
N = NN;
int mx = 0;
int x = 1;
rep(i, N) {
x *= X[i];
mx = max(mx, x*Y[i]);
}
return mx;
}
int updateX(int pos, int val) {
return 0;
}
int updateY(int pos, int val) {
return 0;
}
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... |