# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
707896 | Koful123 | Monkey and Apple-trees (IZhO12_apple) | C++17 | 337 ms | 200076 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 int long long
#define endl "\n"
#define pb push_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
struct node{
int sum,lazy,l,r,tl,tr;
node(): sum(0), lazy(0), l(0), r(0), tl(1), tr(1e9) {};
};
struct SegTree{
vector<node> seg;
SegTree(){
seg.pb(node());
};
void push(int v,int tl,int tr){
int tm = (tl + tr) / 2;
if(seg[v].l == 0){
seg[v].l = seg.size();
seg.pb(node());
seg[seg[v].l].tl = tl;
seg[seg[v].l].tr = tm;
seg[v].r = seg.size();
seg.pb(node());
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |