# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
755284 | DonMichael | 원숭이와 사과 나무 (IZhO12_apple) | C++14 | 96 ms | 3020 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.
#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
static constexpr int N = 1e9;
static constexpr int LGN = 30;
static constexpr int M = 1e5;
struct Node {
Node(void) = default;
Node(int l, int r);
int cl, cr;
int l, r;
bool red;
};
class DynamicSegmentTree {
public:
DynamicSegmentTree(void);
int query(int l, int r);
void modify(int l, int r);
private:
void add_left(int i);
void add_right(int i);
int _query(int i, int l, int r);
void _modify(int i, int l, int r);
Node t[M * LGN * 2];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |