# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
529216 | Cyanmond | 말 (IOI15_horses) | C++17 | 1576 ms | 15908 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.
// clang-format off
#include <bits/stdc++.h>
using i64 = int64_t;
template <typename T> bool setmax(T &v, const T a) {
if (v < a) {
v = a;
return true;
} else {
return false;
}
}
namespace mycode {
int N;
std::vector<int> X, Y;
constexpr i64 mod = 1000000007;
constexpr int max_v = 1000000000;
void mul(i64 &v, i64 d) {
v = v * d % mod;
}
int calc() {
i64 v = 1;
double best = (double)(Y[N - 1]);
int best_pos = N - 1;
for (int i = N - 2; i >= 0; --i) {
# | 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... |