# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
471170 | apostoldaniel854 | Financial Report (JOI21_financial) | C++14 | 874 ms | 26484 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;
struct node_info {
int mx;
node_info(int value = 0) {
this->mx = value;
}
node_info operator + (node_info other) const {
node_info RES;
RES.mx = max(mx, other.mx);
return RES;
}
};
class SegTree {
private:
vector <node_info> seg;
int n;
public:
SegTree(int n) {
seg.resize(1 + 4 * n);
this->n = n;
}
void update_pos(int node, int lb, int rb, int pos, node_info val) {
if (lb == rb) {
seg[node] = val;
return;
}
# | 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... |