【JZOJ 5446】【NOIP2017提高A组冲刺11.3】高考是不可能高考的

Description

Snuke 喜欢旗子.
Snuke 正在将N 个旗子摆在一条线上.
第i 个旗子可以被放在位置xi 或yi 上.
Snuke 认为两个旗子间的最小距离越大越好. 请你求出最大值.

Solution

很明显的2-SAT，
二分答案+判断，用线段树优化连边即可

Code

#include <cstdio>
#include <algorithm>
#include <cstring>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define efo(i,q) for(int i=A[q];i;i=B[i][0])
#define min(q,w) ((q)<(w)?(q):(w))
#define max(q,w) ((q)>(w)?(q):(w))
#define abs(q) ((q)>0?(q):(-(q)))
using namespace std;
const int N=100500;
int read(int &n)
{
    int w=1;char ch=' ';n=0;
    for(;ch!='-'&&(ch<'0'||ch>'9');ch=getchar());
    if(ch=='-')ch=getchar(),w=1;
    for(;ch<='9'&&ch>='0';ch=getchar())n=n*10+ch-48;
    return n=n*w;
}
int n,m,ans,oln;
struct qqww
{
    int v,i,k;
}a[N];
int zx[N][2];
int B[4*N][2],A[N*2],B0;
int g[N],za[N];
int dfn[N],low[N],dfn0;
int z[N],z1[N],TI;
bool PX(qqww q,qqww w){return q.v<w.v;}
void link(int q,int w){B[++B0][0]=A[q],A[q]=B0,B[B0][1]=w;}
int gf(int q){return g[q]==q?q:(g[q]=gf(g[q]));}
void tarjan(int q)
{
    za[++za[0]]=q;
    z[q]=z1[q]=TI;dfn[q]=low[q]=++dfn0;
    efo(i,q)if(z[B[i][1]]<TI)tarjan(B[i][1]),low[q]=min(low[q],low[B[i][1]]);
        else if(z1[B[i][1]]==TI)low[q]=min(low[q],low[B[i][1]]);
    if(low[q]==dfn[q])
    {
        for(;za[0]&&za[za[0]+1]!=q;za[0]--)g[za[za[0]]]=q,z1[za[za[0]]]=0,za[1+za[0]]=0;
    }
}
bool OK(int mid)
{
    B0=0;
    fo(i,1,2*n)A[i]=0,g[i]=i;
    fo(i,1,n)link(i,zx[a[i].i][!a[i].k]+n);
    int q=1;
    fo(i,1,n)
    {
        for(;q<n&&a[q+1].v-a[i].v<mid;q++);
        fo(j,i+1,q)link(i+n,j),link(j+n,i);
    }
    TI++;
    fo(i,1,n*2)if(z[i]<TI)tarjan(i);
    fo(i,1,n)if(gf(i)==gf(i+n))return 0;
    return 1;
}
int main()
{
    freopen("a.in","r",stdin);
    freopen("a.out","w",stdout);
    int q,w,mx=0;
    read(n);
    fo(i,1,n)
    {
        read(a[i].v),read(a[i+n].v);
        a[i].i=a[i+n].i=i;a[i+n].k=1;
    }
    n*=2;
    sort(a+1,a+1+n,PX);
    fo(i,1,n)zx[a[i].i][a[i].k]=i;
    ans=0;
    int l=0,r=(a[n].v-a[1].v)/(n/2-1)+2;
    while(l<r)
    {
        int mid=(l+r+1)>>1;
        q=OK(mid);
        if(q)l=mid;
        else r=mid-1;
    }
    printf("%d\n",l);
    return 0;
}