CodeForces - 896C 珂朵莉树

传送门

用set搞的比较神奇的树吧，玄学时间复杂度，代码简洁好写，无聊学了用来水题再好不过了 ~ ~ ~

#include<cstdio>
#include<iostream>
#include<string>
#include<cstring>
#include<map>
#include<cmath>
#include<cctype>
#include<vector>
#include<set>
#include<queue>
#include<algorithm>
#include<sstream>
#define X first
#define Y second
#define Mid (tr[u].l+tr[u].r>>1)
#define Len(u) (tr[u].r-tr[u].l+1)
#define pb push_back
#define mk make_pair
#define IT set<node>::iterator
using namespace std;

typedef long long LL;
typedef pair<int,int> PII;

const int N=1000010,mod=1e9+7,INF=0x3f3f3f3f;
const double eps=1e-6;

int n,m;
LL seed,vmax;
struct node
{
   
    int l,r;
    mutable LL v;
    node(int L,int R=-1,LL V=0):l(L),r(R),v(V) {
   }
    bool operator < (const node& o) const
    {
   
        return l<o.l;
    }
};
set