离散化

这道题最刻骨铭心的是

。。。离散化数组要开大

https://www.luogu.com.cn/problem/P1955

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
typedef long long ll;
#define N 100050
int T,n;
int fa[N];
ll b[N<<2];
struct node{
    ll l,r;
    int w;
    bool operator <(const node &x)const{
    return w>x.w;}
}e[N];
int find(int x){
    return fa[x]==x?x:fa[x]=find(fa[x]);
}
int main(){
    scanf("%d",&T);
    while(T--){
        memset(b,0,sizeof(b));
        memset(e,0,sizeof(e));
        scanf("%d",&n);
        int len=0,flag=0;
        for(int i=1;i<=n;i++){
            scanf("%lld%lld%d",&e[i].l,&e[i].r,&e[i].w);
            b[++len]=e[i].l;b[++len]=e[i].r;
        }
        sort(b+1,b+1+len);int m=unique(b+1,b+1+len)-b-1;
        for(int i=1;i<=n;i++){
            e[i].l=lower_bound(b+1,b+1+m,e[i].l)-b;
            e[i].r=lower_bound(b+1,b+1+m,e[i].r)-b;
        }
        for(int i=1;i<=m;i++)fa[i]=i;
        sort(e+1,e+1+n);
        for(int i=1;i<=n;i++){
            int fx=find(e[i].l),fy=find(e[i].r);
            if(e[i].w){
                if(fx!=fy)fa[fx]=fy;
            }
            else{
                if(fx==fy){puts("NO");flag=1;break;}
            }
        }
        if(!flag)puts("YES");
    }
    return 0;
}

int len=0;
int len=0,flag=0;
for(int i=1;i<=n;i++){
    scanf("%lld%lld%d",&e[i].l,&e[i].r,&e[i].w);
    b[++len]=e[i].l;b[++len]=e[i].r;
}
sort(b+1,b+1+len);int m=unique(b+1,b+1+len)-b-1;
for(int i=1;i<=n;i++){
    e[i].l=lower_bound(b+1,b+1+m,e[i].l)-b;
    e[i].r=lower_bound(b+1,b+1+m,e[i].r)-b;
}