竟然作死 lower_bound(s[u].begin(),s[u].end(),*it1); T的不明所以QAQ
#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<set>
#include<time.h>
using namespace std;
const int MAXN=(int)1e5+10;
int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
typedef long long ll;
struct edge{
int to,nxt;
}ed[MAXN<<1];
int head[MAXN],cnt;
void addedge(int u,int v){
ed[cnt].to=v;
ed[cnt].nxt=head[u];
head[u]=cnt++;
}
struct node{
int l,r;
node(){}node(int _l,int _r){l=_l;r=_r;}
bool operator < (const node &a)const{
if(l==a.l)return r<a.r;
else return l<a.l;
}
};
set<node>s[MAX