显然是不能在一起的连边后二分图染色
似乎可以直接用
s
e
t
set
set维护一下可行的点染色
不过更简单的是
如果有三个
[
l
i
,
r
i
]
[l_i,r_i]
[li,ri]互相不交显然无解
可以得到若不考虑
t
,
T
t,T
t,T的限制
显然
n
1
=
max
l
,
n
2
=
min
r
n_1=\max l,n_2=\min r
n1=maxl,n2=minr是一个可行解
若
n
1
+
n
2
<
t
n_1+n_2<t
n1+n2<t则把
n
1
n_1
n1变大
若
n
1
+
n
2
>
T
n_1+n_2>T
n1+n2>T则把
n
2
n_2
n2变小
这样为最优的解
然后看如果某个人的限制只满足一个
n
n
n
那么显然颜色是固定的
所有颜色固定和题目给的边连完之后
剩下随便连都是可行的
#include<bits/stdc++.h>
using namespace std;
#define cs const
#define re register
#define pb push_back
#define pii pair<int,int>
#define ll long long
#define fi first
#define se second
#define bg begin
cs int RLEN=1<<20|1;
inline char gc(){
static char ibuf[RLEN],*ib,*ob;
(ib==ob)&&(ob=(ib=ibuf)+fread(ibuf,1,RLEN,stdin));
return (ib==ob)?EOF:*ib++;
}
inline int read(){
char ch=gc();
int res=0;bool f=1;
while(!isdigit(ch))f^=ch=='-',ch=gc();
while(isdigit(ch))res=(res+(res<<2)<<1)+(ch^48),ch=gc();
return f?res:-res;
}
inline ll readll(){
char ch=gc();
ll res=0;bool f=1;
while(!isdigit(ch))f^=ch=='-',ch=gc();
while(isdigit(ch))res=(res+(res<<2)<<1)+(ch^48),ch=gc();
return f?res:-res;
}
inline int readstring(char *s){
int top=0;char ch=gc();
while(isspace(ch))ch=gc();
while(!isspace(ch)&&ch!=EOF)s[++top]=ch,ch=gc();
return top;
}
template<typename tp>inline void chemx(tp &a,tp b){a<b?a=b:0;}
template<typename tp>inline void chemn(tp &a,tp b){a>b?a=b:0;}
cs int N=100005;
int l[N],r[N],n,m,t,T,n1,n2,col[N];
vector<int> e[N];
bool dfs(int u){
for(int &v:e[u]){
if(col[v]!=-1){
if(col[v]==col[u])return false;
continue;
}
col[v]=col[u]^1;
if(!dfs(v))return false;
}return true;
}
int main(){
#ifdef Stargazer
freopen("lx.in","r",stdin);
#endif
t=read(),T=read();
n=read(),m=read();n2=1e9;
for(int i=1;i<=n;i++){
l[i]=read(),r[i]=read();
chemx(n1,l[i]),chemn(n2,r[i]);
}
if(n1+n2>T)n2=T-n1;
if(n1+n2<t)n1=t-n2;
if(n1<0||n2<0)return puts("IMPOSSIBLE"),0;
memset(col,-1,sizeof(col));
for(int i=1;i<=n;i++){
int f1=(l[i]<=n1&&n1<=r[i]),f2=(l[i]<=n2&&n2<=r[i]);
if(!f1&&!f2)return puts("IMPOSSIBLE"),0;
if(f1&&!f2)col[i]=0;
if(!f1&&f2)col[i]=1;
}
for(int i=1;i<=m;i++){
int u=read(),v=read();
e[u].pb(v),e[v].pb(u);
}
for(int i=1;i<=n;i++)if(col[i]!=-1){
if(!dfs(i))return puts("IMPOSSIBLE"),0;
}
for(int i=1;i<=n;i++)if(col[i]==-1){col[i]=0;
if(!dfs(i))return puts("IMPOSSIBLE"),0;
}
puts("POSSIBLE");
cout<<n1<<" "<<n2<<'\n';
for(int i=1;i<=n;i++)cout<<col[i]+1;
puts("");return 0;
}