# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
654312 | resting | Radio Towers (IOI22_towers) | C++17 | 2617 ms | 538472 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;
#define ll long long
#define mx 100005
struct tree {
struct node {
node(int l, int r) : l(l), r(r) {}
int l = 0; int r = 0; int v = 0;
node* lc = nullptr;
node* rc = nullptr;
};
vector<node*> rt;
vector<int> nums;
tree() {
nums.push_back(numeric_limits<int>::min());
rt.push_back(build(0, mx));
}
void upd(int idx, int val, int v) {
//cout << "index: " << idx << "," << "value: " << val << "," << "time: " << v << endl;
nums.push_back(v); // v = time
rt.push_back(upd2(rt.back(), idx, val));
}
node* build(int l, int r) {
node* rt = new node(l, r);
if (l == r) return rt;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |