UVALive - 3211 - Now or later（图论——2-SAT）

Problem   UVALive - 3211 - Now or later

Time Limit: 9000 mSec

Problem Description

 

Input

 

Output

 

Sample Input

10 44 156 153 182 48 109 160 201 55 186 54 207 55 165 17 58 132 160 87 197

Sample Output

10

 

题解：2-SAT问题板子题，这个问题主要是理论难度比较大，有了结论之后代码很容易，有专门的论文阐释算法的正确性，看了几位大佬写的，基本上明白是怎么一回事，理解不深刻，就不在这里胡扯了，直接上代码。

 

#include <bits/stdc++.h>

using namespace std;

#define REP(i, n) for (int i = 1; i <= (n); i++)
#define sqr(x) ((x) * (x))

const int maxn = 2000 + 10;
const int maxm = 30 + 10;
const int maxs = 10000 + 10;

typedef long long LL;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;

const LL unit = 1LL;
const int INF = 0x3f3f3f3f;
const LL mod = 1000000007;
const double eps = 1e-14;
const double inf = 1e15;
const double pi = acos(-1.0);

struct TwoSAT
{
    int n;
    vector<int> G[maxn * 2];
    bool mark[maxn * 2];
    int S[maxn * 2], c;

    bool dfs(int x)
    {
        if (mark[x ^ 1])
            return false;
        if (mark[x])
            return true;
        mark[x] = true;
        S[c++] = x;
        for (auto v : G[x])
        {
            if (!dfs(v))
                return false;
        }
        return true;
    }

    void init(int n)
    {
        this->n = n;
        for (int i = 0; i < n * 2; i++)
        {
            G[i].clear();
        }
        memset(mark, 0, sizeof(mark));
    }

    void add_clause(int x, int xval, int y, int yval)
    {
        x = x * 2 + xval;
        y = y * 2 + yval;
        G[x ^ 1].push_back(y);
        G[y ^ 1].push_back(x);
    }

    bool solve()
    {
        for (int i = 0; i < n * 2; i += 2)
        {
            if (!mark[i] && !mark[i + 1])
            {
                c = 0;
                if (!dfs(i))
                {
                    while (c > 0)
                    {
                        mark[S[--c]] = false;
                    }
                    if (!dfs(i + 1))
                        return false;
                }
            }
        }
        return true;
    }
};

TwoSAT solver;

int n, T[maxn][2];

bool Judge(int lim)
{
    solver.init(n);
    for (int i = 0; i < n; i++)
    {
        for (int a = 0; a < 2; a++)
        {
            for (int j = i + 1; j < n; j++)
            {
                for (int b = 0; b < 2; b++)
                {
                    if (abs(T[i][a] - T[j][b]) < lim)
                    {
                        solver.add_clause(i, a ^ 1, j, b ^ 1);
                    }
                }
            }
        }
    }
    return solver.solve();
}

main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    while (cin >> n && n)
    {
        int le = 0, ri = 0;
        for (int i = 0; i < n; i++)
        {
            for (int j = 0; j < 2; j++)
            {
                cin >> T[i][j];
                ri = max(ri, T[i][j]);
            }
        }

        int ans = 0;
        while (le <= ri)
        {
            int mid = (le + ri) >> 1;
            if (Judge(mid))
            {
                ans = mid;
                le = mid + 1;
            }
            else
            {
                ri = mid - 1;
            }
        }
        cout << ans << endl;
    }
    return 0;
}