# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
957937 | bmh123456789asdf | Monkey and Apple-trees (IZhO12_apple) | C++14 | 0 ms | 0 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>
#pragma GCC optimize("O3")
#define int long long
using namespace std;
const int N = 12345;
struct Node {
int sum, lazy, tl, tr, l, r;
Node() : sum(0), lazy(0), l(-1), r(-1) {}
};
Node segtree[64 * N];
int cnt = 2;
vonode pushlazy(int node)
{
if(segtree[node].lazy)
{
segtree[node].sum = segtree[node].tr - segtree[node].tl + 1;
int mnode = (segtree[node].tr + segtree[node].tl) / 2;
if(segtree[node].l == -1)
{
segtree[node].l = cnt++;
segtree[cnt].tl = segtree[node].tl;
segtree[cnt].tr = mnode;
}
if(segtree[node].r == -1)
{
segtree[node].r = cnt++;