# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
252034 | DS007 | Horses (IOI15_horses) | C++14 | 1303 ms | 52324 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 long long N = 5e5, mod = 1e9 + 7;
int n, *x, *y;
set<int> s;
class SegmentTree1 {
int t[N * 4];
public:
SegmentTree1() {
fill(t, t + N * 4, 0);
}
void update(int v, int l, int r, int tl, int k) {
if (l == r && l == tl) {
t[v] = k;
return;
}
int mid = (l + r) / 2;
if (tl <= mid)
update(v * 2, l, mid, tl, k);
else
update(v * 2 + 1, mid + 1, r, tl, k);
t[v] = max(t[v * 2], t[v * 2 + 1]);
}
long long query(int v, int l, int r, int tl, int tr) {
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... |