# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
868332 | anha3k25cvp | medians (balkan11_medians) | C++14 | 91 ms | 24384 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>
#define ll long long
#define ull unsigned long long
#define dl double
#define st first
#define nd second
#define II pair <int, int>
using namespace std;
const int N = 5 + 1e5;
const int inf = 7 + 1e9;
struct Segment {
int n;
vector <II> tree;
Segment (int _n = 0) : n(_n) {
tree.assign(4 * n + 1, {inf, inf});
}
void update(int l, int r, int node, int u, int val) {
if (r < u || u < l)
return;
if (l == r) {
tree[node] = {val, l};
return;
}
int mid = (l + r) / 2;
if (u <= mid)
update(l, mid, 2 * node, u, val);
else
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |