POJ 3683 2-SAT

题意

传送门 POJ 3683 Priest John’s Busiest Day

题解

定义布尔变量 $x_i$ $$x_i为真\iff 仪式i在婚礼开始时举行$$ $O(N^2)$ 枚举婚礼开始与结束可举行仪式的时间段，对属于不同婚礼的冲突的两段仪式写出和取范式，并对应建图。$Tarjan$ 算法求解 $2-SAT$ 问题。总时间复杂度 $O(N^2)$。

#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn = 2 * 1005, maxm = maxn * maxn;
int N, S[maxn], T[maxn], D[maxn];
int tot, head[maxn], to[maxm], nxt[maxm];
int num, scc, sc[maxn], dfn[maxn], low[maxn];
int top, st[maxn];
bool ins[maxn];

inline void add(int x, int y) { to[++tot] = y, nxt[tot] = head[x], head[x] = tot; }

void tarjan(int x)
{
    low[x] = dfn[x] = ++num;
    st[++top] = x, ins[x] = 1;
    for (int i = head[x]; i; i = nxt[i])
    {
        int y = to[i];
        if (!dfn[y])
            tarjan(y), low[x] = min(low[x], low[y]);
        else if (ins[y])
            low[x] = min(low[x], dfn[y]);
    }
    if (low[x] == dfn[x])
    {
        ++scc;
        int y;
        do
        {
            y = st[top--], ins[y] = 0, sc[y] = scc;
        } while (y != x);
    }
}

int main()
{
    scanf("%d", &N);
    for (int i = 1, h, m; i <= N; ++i)
    {
        scanf("%d:%d", &h, &m), S[i] = h * 60 + m;
        scanf("%d:%d", &h, &m), T[i] = h * 60 + m;
        scanf("%d", D + i);
    }
    for (int i = 1; i <= N; ++i)
        for (int j = i + 1; j <= N; ++j)
        {
            if (max(S[i], S[j]) < min(S[i] + D[i], S[j] + D[j]))
                add(i, j + N), add(j, i + N);
            if (max(S[i], T[j] - D[j]) < min(S[i] + D[i], T[j]))
                add(i, j), add(j + N, i + N);
            if (max(T[i] - D[i], S[j]) < min(T[i], S[j] + D[j]))
                add(i + N, j + N), add(j, i);
            if (max(T[i] - D[i], T[j] - D[j]) < min(T[i], T[j]))
                add(i + N, j), add(j + N, i);
        }
    int lim = N << 1;
    for (int i = 1; i <= lim; ++i)
        if (!dfn[i])
            tarjan(i);
    for (int i = 1; i <= N; ++i)
        if (sc[i] == sc[i + N])
        {
            puts("NO");
            return 0;
        }
    puts("YES");
    for (int i = 1, x, y; i <= N; ++i)
    {
        if (sc[i] < sc[i + N])
            x = S[i], y = S[i] + D[i];
        else
            x = T[i] - D[i], y = T[i];
        printf("%02d:%02d %02d:%02d\n", x / 60, x % 60, y / 60, y % 60);
    }
    return 0;
}