# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1152074 | mnbvcxz123 | Monkey and Apple-trees (IZhO12_apple) | C++20 | 458 ms | 260428 KiB |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 1e9+10;
struct segnode {
int sum = 0;
int upd = 0;
segnode *segleft, *segright;
segnode() : sum(0), upd(0), segleft(nullptr), segright(nullptr) {}
};
segnode* root;
void pushdown(segnode* node, int s, int e)
{
if (node->upd != 1) return;
const int mid = (s + e) / 2;
if (!node->segleft && s < e)
node->segleft = new segnode();
if (s < e)
node->segleft->upd = 1;
if (!node->segright && s < e)
node->segright = new segnode();
if (s < e)
node->segright->upd = 1;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |