【2019牛客暑期训练营第八场 E Explorer】线段树分治+可撤销并查集

牛客E

这个树要左闭右开
因为你不左闭右开 会跨过中间的区间 无法算贡献
学到了

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
//#pragma comment(linker, "/STACK:10240000,10240000")
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))

typedef pair<int,int> pll;
typedef long long ll;
typedef unsigned long long ull;
const ull hash1 = 201326611;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);
//ull ha[MAX_N],pp[MAX_N];

inline int read()
{
    int date = 0,m = 1; char ch = 0;
    while(ch!='-'&&(ch<'0'|ch>'9'))ch = getchar();
    if(ch=='-'){m = -1; ch = getchar();}
    while(ch>='0' && ch<='9')
    {
        date = date*10+ch-'0';
        ch = getchar();
    }return date*m;
}
const int N = 200000;
const int MAX_N = 200025;
ll ans = 0;
map<int ,int > mp;
int b[MAX_N<<1],top,n,size[MAX_N],fa[MAX_N];
struct node{int x,y;}st[MAX_N],CG[MAX_N];
struct query
{
    int u,v,l,r;
}arr[MAX_N];
vector<int> vt[MAX_N<<2];
namespace sgt
{
    #define mid ((l+r)>>1)
    void update(int rt,int l,int r,int x,int y,int id)
    {
        if(x<=l&&r<=y)
        {
            vt[rt].push_back(id);
            return;
        }
        if(x>mid) update(rt<<1|1,mid+1,r,x,y,id);
        else if(y<=mid) update(rt<<1,l,mid,x,y,id);
        else update(rt<<1,l,mid,x,y,id),update(rt<<1|1,mid+1,r,x,y,id);
    }
    #undef mid
}
int Find(int x)
{
    if(x==fa[x]) return x;
    return x = Find(fa[x]);
}
void Merge(int x,int y)
{
    x = Find(x);y = Find(y);
    if(x!=y)
    {
        if(size[x]>size[y]) swap(x,y);
        st[++top] = (node){x,y};
        size[y]+=size[x];
        fa[x] = y;
    }
}
void del(int now)
{
    while(now<top)
    {
        int x = st[top].x,y = st[top--].y;
        size[y]-=size[x];fa[x] = x;
    }
}
void dfs(int rt,int l,int r)
{
    int now = top;
    for(int i = 0;i<vt[rt].size();++i)
        Merge(CG[vt[rt][i]].x,CG[vt[rt][i]].y);
    if(l==r)
    {
        if(Find(1)==Find(n)) ans+=b[r+1]-b[r];
    }
    else
    {
        int mid =(l+r)>>1;
        dfs(rt<<1,l,mid);dfs(rt<<1|1,mid+1,r);
    }
    del(now);
}
/*int root[MAX_N],cnt,sz;
namespace hjt
{
    #define mid ((l+r)>>1)
    struct node{int l,r,maxx;}T[MAX_N*40];

    #undef mid
}*/

int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int m,cnt = 0;
    scanf("%d%d",&n,&m);
    mp[0] = 0;
    for(int i = 1;i<=m;++i)
    {
        scanf("%d%d%d%d",&arr[i].u,&arr[i].v,&arr[i].l,&arr[i].r);
        b[++cnt] = arr[i].l;b[++cnt] = arr[i].r+1;
    }
    for(int i = 1;i<=n;++i) size[i] = 1,fa[i] = i;
    sort(b+1,b+1+cnt);
    int sz = unique(b+1,b+1+cnt)-b-1;
    for(int i = 1;i<=m;++i)
    {
        int t = arr[i].l,t_ = arr[i].r;
        arr[i].l = lower_bound(b+1,b+1+sz,arr[i].l)-b;mp[arr[i].l] = t;
        arr[i].r = lower_bound(b+1,b+1+sz,arr[i].r+1)-b-1;mp[arr[i].r] = t_;
    }
    for(int i = 1;i<=m;++i)
    {
        CG[i] = (node){arr[i].u,arr[i].v};
        sgt::update(1,1,N,arr[i].l,arr[i].r,i);
    }
    dfs(1,1,N);
    printf("%lld\n",ans);
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}