Physical Education Lessons-动态开点线段树

看到数据范围头就痛起来了，还抱着是不是打印错误的想法上去交了一发结果re，然后在本地捣鼓，开了个巨大的数组，直接给我clion卡退了，内存瞬间爆满。然后乖乖百度，发现了一个叫动态开点线段树的线段树，折腾了一会，看懂了但没有完全看懂（下次一定去认真学学 ）。就大概是要用到的节点才会开这个点，其他的不管，据说空间复杂度$O(nlogn)$.

代码

#include <iostream>
#include <cstring>
#include <cmath>
#include <bitset>
#include <queue>
#include <vector>
#include <cstdio>
#include <queue>
#include <sstream>
#include <string>
#include <algorithm>
#include <map>
#define rep(i, a, b) for (ll i = a; i <= b; i++)
#define reps(i, a, b) for (int i = a; i >= b; i--)
#define mk make_pair
using namespace std;
const int N = 15e6 + 10;
const int M = 1e5+ 7;
const int inf = 0x3f3f3f3f;
const int mod = 1000000007;
typedef long long ll;
struct node
{
    int sum, lazy=-1;
} tree[N];
int cnt;
int lc[N],rc[N];
void pushup(int j)
{
    tree[j].sum = tree[lc[j]].sum + tree[rc[j]].sum;
}
void pushdown(int j,int l,int r)
{
    if(tree[j].lazy != -1)
    {
        int mid=(l+r)>>1;
        if(!lc[j])lc[j]=++cnt;
        if(!rc[j])rc[j]=++cnt;
        tree[lc[j]].sum=(mid-l+1)*tree[j].lazy;
        tree[rc[j]].sum=(r-mid)*tree[j].lazy;
        tree[lc[j]].lazy=tree[rc[j]].lazy=tree[j].lazy;
        tree[j].lazy = -1;
    }
}
void update(int &j, int ll, int rr, int val,int l,int r)
{
    if(!j)j+=++cnt;
    if(ll <= l && r <= rr)
    {
        tree[j].lazy = val;
        tree[j].sum = val*(r-l+1);
        return ;
    }
    pushdown(j,l,r);
    int mid = (l+r) >> 1;
    if(ll <= mid)
        update(lc[j], ll, rr, val,l,mid);
    if(rr > mid)
        update(rc[j], ll, rr, val,mid+1,r);
    pushup(j);
}
int main()
{
    int n,q;
    int node=0;
    scanf("%d%d",&n,&q);
    rep(i,1,q){
        int k,l,r;
        scanf("%d%d%d",&l,&r,&k);
        if(k==1){
            update(node,l,r,1,1,n);
        }else{
            update(node,l,r,0,1,n);
        }
        printf("%d\n",n-tree[node].sum);
    }
    return 0;
}