# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1100190 | vladilius | New Home (APIO18_new_home) | C++17 | 5091 ms | 334204 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;
using ll = long long;
using pii = pair<int, int>;
#define pb push_back
#define ff first
#define ss second
const int inf = 1e8;
struct IT{
struct node{
node *l, *r;
multiset<int> st;
int m;
node(){
l = r = 0;
m = 0;
}
};
node *rt;
void init(){
rt = new node();
}
void add(node *v, int tl, int tr, int& p, int& x){
if (tl == tr){
(v -> st).insert(x);
(v -> m) = max(v -> m, x);
return;
}
int tm = (tl + tr) / 2;
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |