SRM 464 DIV1 500 2-sat 思路和hdu3622基本差不多

来源：互联网发布：华3c多镜像端口配置编辑：程序博客网时间：2024/05/21 12:39
SRM 464 DIV1 500
#include<iostream>#include<cstring>#include<algorithm>#include<cstdio>#include<vector>#include<sstream>#include<string>#include<climits>#include<stack>#include<set>#include<bitset>#include<cmath>#include<deque>#include<map>#include<queue>#define iinf 2000000000#define linf 1000000000000000000LL#define dinf 1e200#define eps 1e-11#define all(v) (v).begin(),(v).end()#define sz(x)  x.size()#define pb push_back#define mp make_pair#define lng long long#define sqr(a) ((a)*(a))#define pii pair<int,int>#define pll pair<lng,lng>#define pss pair<string,string>#define pdd pair<double,double>#define X first#define Y second#define pi 3.14159265359#define ff(i,xi,n) for(int i=xi;i<=(int)(n);++i)#define ffd(i,xi,n) for(int i=xi;i>=(int)(n);--i)#define ffl(i,r) for(int i=head[r];i!=-1;i=edge[i].next)#define cc(i,j) memset(i,j,sizeof(i))#define two(x)((lng)1<<(x))#define N 1000#define M 1000000#define lson l , mid , rt << 1#define rson mid + 1 , r , rt << 1 | 1#define Mod  n#define Pmod(x) (x%Mod+Mod)%Modusing namespace std;typedef vector<int>  vi;typedef vector<string>  vs;typedef unsigned int uint;typedef unsigned lng ulng;template<class T> inline void checkmax(T &x,T y){if(x<y) x=y;}template<class T> inline void checkmin(T &x,T y){if(x>y) x=y;}template<class T> inline T Min(T x,T y){return (x>y?y:x);}template<class T> inline T Max(T x,T y){return (x<y?y:x);}template<class T> T gcd(T a,T  b){return (a%b)==0?b:gcd(b,a%b);}template<class T> T lcm(T a,T b){return a*b/gcd(a,b);}template<class T> T Abs(T a){return a>0?a:(-a);}template<class T> inline T lowbit(T n){return (n^(n-1))&n;}template<class T> inline int countbit(T n){return (n==0)?0:(1+countbit(n&(n-1)));}template<class T> inline bool isPrimeNumber(T n){if(n<=1)return false;for (T i=2;i*i<=n;i++) if (n%i==0) return false;return true;}template<class T> inline T Minmin(T a,T b,T c,T d){return Min(Min(a,b),Min(c,d));}struct tarjan_seg{int head[N],tot,id[N],pre[N],low[N],sta[N],top,n,m,Index,newid,newhead[N],*cur;struct pp   {        int v,next;    }edge[N*20];    void add(int u,int v)    {        edge[tot].v=v;        edge[tot].next=cur[u];        cur[u]=tot++;    }    void init()    {        cc(head,-1);        tot=0;        newid=0;        cur=head;        cc(pre,-1);        cc(low,-1);        top=0;        cc(id,-1);        Index=0;    }    void tarjan(int r,int p)    {        bool xx=false;        pre[r]=low[r]=++Index;        sta[++top]=r;        ffl(i,r)        {            int v=edge[i].v;            if(v==p&&xx==0)            {                xx=1;                continue;            }            if(pre[v]==-1)            {                tarjan(v,r);                checkmin(low[r],low[v]);            }            else            if(id[v]==-1)            checkmin(low[r],pre[v]);        }        if(pre[r]==low[r])        {            int v;            ++newid;            do            {                v=sta[top--];                id[v]=newid;            }while(v!=r);        }    }    void solve()    {        ff(i,1,n)        if(pre[i]==-1)        tarjan(i,-1);    }    void build_map()    {        int  hash[N]={};        cur=newhead;        ff(i,1,n)        {            ffl(j,i)            {                int v=edge[j].v;                if(id[i]!=id[v]&&hash[id[i]]!=id[j])                add(id[i],id[j]),hash[id[i]]=id[j];            }        }    }    bool two_sat()    {        solve();        for(int i=1;i<=n/2;i+=2)        if(id[i]==id[i+n/2])        return false;        return true;    }};int z;class ColorfulDecoration{    public:      int getMaximum(vector <int> xa, vector <int> ya, vector <int> xb, vector <int> yb)      {          int l=0,r=1000000000,mid;          z=xa.size();          while(l<=r)          {              mid=(l+r)/2;              tarjan_seg G;              G.n=2*z;              G.init();            ff(i,0,z-1)            {                ff(j,0,z-1)            {if(i==j) continue;                else                if(Abs(xa[i]-xb[j])<mid&&Abs(ya[i]-yb[j])<mid)                G.add(i+1,j+1),G.add(j+z+1,i+z+1);                if(Abs(xa[i]-xa[j])<mid&&Abs(ya[i]-ya[j])<mid)                G.add(i+1,j+z+1),G.add(j+1,i+z+1);                if(Abs(xb[i]-xb[j])<mid&&Abs(yb[i]-yb[j])<mid)                G.add(i+z+1,j+1),G.add(j+z+1,i+1);            }            }              if(G.two_sat())              l=mid+1;              else              r=mid-1;          }          return r;      }};int main(){    ColorfulDecoration K;    vi k[4];    k[0].pb(10);    k[0].pb(4);    k[0].pb(19);    k[1].pb(6);    k[1].pb(19);    k[1].pb(11);    k[2].pb(17);    k[2].pb(8);    k[2].pb(20);    k[3].pb(7);    k[3].pb(9);    k[3].pb(16);    cout<<K.getMaximum(k[0],k[1],k[2],k[3]);    return 0;}