제출 #410568

#제출 시각UTC-0아이디문제언어결과실행 시간메모리
4105682021-05-23 02:33:06dreezyMonkey and Apple-trees (IZhO12_apple)C++17
100 / 100
652 ms186340 KiB
#include <bits/stdc++.h>
using namespace std;
struct node {
int sum, lazy, tl, tr, l, r;
node() : sum(0), lazy(0), l(-1), r(-1) {}
};
const int MAXN = 123456;
node segtree[64*MAXN];
int cnt = 2;
void push_lazy(int n){
if(segtree[n].lazy){
segtree[n].sum = segtree[n].tr - segtree[n].tl + 1;
int mid = (segtree[n].tr + segtree[n].tl) /2;
if(segtree[n].l == -1){
segtree[n].l = cnt++;
segtree[segtree[n].l].tl = segtree[n].tl;
segtree[segtree[n].l].tr = mid;
}
if(segtree[n].r == -1){
segtree[n].r = cnt++;
segtree[segtree[n].r].tl = mid +1;
segtree[segtree[n].r].tr = segtree[n].tr;
}
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...