# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
292346 | VodkaInTheJar | Horses (IOI15_horses) | C++14 | 907 ms | 53496 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>
using namespace std;
const int maxn = 5e5 + 3;
const int mod = 1e9 + 7;
int n, x[maxn], y[maxn];
set <int> s;
pair <int, int> tr[maxn * 4];
void merge(int v)
{
tr[v].first = max(tr[v * 2].first, tr[v * 2 + 1].first);
tr[v].second = 1ll * tr[v * 2].second * tr[v * 2 + 1].second % mod;
}
void build(int v, int l, int r)
{
if (l == r)
{
tr[v] = {y[l], x[l]};
return;
}
int mid = (l + r) / 2;
build(v * 2, l, mid);
build(v * 2 + 1, mid + 1, r);
merge(v);
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... |