POJ3683 Priest John's Busiest Day(2-SAT)

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 11049		Accepted: 3767		Special Judge

Description

John is the only priest in his town. September 1st is the John's busiest day in a year because there is an old legend in the town that the couple who get married on that day will be forever blessed by the God of Love. This year N couples plan to get married on the blessed day. The i-th couple plan to hold their wedding from time S_i to time T_i. According to the traditions in the town, there must be a special ceremony on which the couple stand before the priest and accept blessings. The i-th couple need D_i minutes to finish this ceremony. Moreover, this ceremony must be either at the beginning or the ending of the wedding (i.e. it must be either from S_i to S_i + D_i, or from T_i - D_i to T_i). Could you tell John how to arrange his schedule so that he can present at every special ceremonies of the weddings.

Note that John can not be present at two weddings simultaneously.

Input

The first line contains a integer N ( 1 ≤ N ≤ 1000). 
The next N lines contain the S_i, T_i and D_i. S_i and T_i are in the format of hh:mm.

Output

The first line of output contains "YES" or "NO" indicating whether John can be present at every special ceremony. If it is "YES", output another N lines describing the staring time and finishing time of all the ceremonies.

Sample Input

2
08:00 09:00 30
08:15 09:00 20

Sample Output

YES
08:00 08:30
08:40 09:00

Source

题意：

POJ Founder Monthly Contest – 2008.08.31, Dagger and Facer

 

题意：有一个小镇上只有一个牧师。这个小镇上有一个传说，在九月一日结婚的人会受到爱神的保佑，但是要牧师举办一个仪式。这个仪式要么在婚礼刚刚开始的时候举行，要么举行完婚礼正好结束。 现在已知有n场婚礼，告诉你每一场的开始和结束时间，以及举行仪式所需要的时间。问牧师能否参加所有的婚礼，如果能则输出一种方案。

 

对于每一场婚礼，我们可以把它抽象成一个点对

对于冲突的点，我们可以看做是利用选A不能选B的关系来进行限制

这样这道题就变成了一道2-SAT问题

然后按照套路用tarjan缩点，暴力建反向图，拓扑排序

 

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<stack>
#include<vector>
#include<queue>
#define Pair pair<int,int>
#define F first
#define S second
using namespace std;
const int MAXN=1e6+;
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<20,stdin),p1==p2)?EOF:*p1++)
char buf[<<],*p1=buf,*p2=buf;
inline int read()
{    char c=getchar();int x=,f=;
    while(c<''||c>''){if(c=='-')f=-;c=getchar();}
    while(c>=''&&c<=''){x=x*+c-'';c=getchar();}
    return x*f;
}
Pair P[MAXN];
bool check(int x,int y)
{
    if((P[x].S<=P[y].F)||(P[x].F>=P[y].S)) return ;
    else return ;
}
struct node
{
    int u,v,nxt;
}edge[MAXN];
int head[MAXN],num=;
inline void AddEdge(int x,int y)
{
    edge[num].u=x;
    edge[num].v=y;
    edge[num].nxt=head[x];
    head[x]=num++;
}
int dfn[MAXN],low[MAXN],vis[MAXN],color[MAXN],colornum=,tot;
stack<int>s;
void tarjan(int now)
{
    dfn[now]=low[now]=++tot;
    vis[now]=;
    s.push(now);
    for(int i=head[now];i!=-;i=edge[i].nxt)
    {
        if(!dfn[edge[i].v])
            tarjan(edge[i].v),low[now]=min(low[now],low[edge[i].v]);
        else if(vis[edge[i].v])
            low[now]=min(low[now],dfn[edge[i].v]);
    }
    if(dfn[now]==low[now])
    {
        int h;colornum++;
        do
        {
            h=s.top();s.pop();
            color[h]=colornum;
            vis[h]=;
        }while(h!=now);
    }
}
vector<int>E[MAXN];
int enemy[MAXN],inder[MAXN],ans[MAXN];
void Topsort()
{
    queue<int>q;
    for(int i=;i<=colornum;i++)
        if(inder[i]==)
            q.push(i);
    while(q.size()!=)
    {
        int p=q.front();q.pop();
        if(!ans[p]) ans[p]=,ans[enemy[p]]=-;
        for(int i=;i<E[p].size();i++)
        {
            inder[E[p][i]]--;
            if(inder[E[p][i]]==) q.push(E[p][i]);
        }
    }
}
int main()
{
    #ifdef WIN32
    freopen("a.in","r",stdin);
    #else
    #endif
    memset(head,-,sizeof(head));
    int N=read();
    for(int i=;i<=N;i++)
    {
        int a,b,c,d,len;
        scanf("%d:%d %d:%d %d",&a,&b,&c,&d,&len);
        P[i].F=a*+b;
        P[i].S=a*+b+len;
        P[i+N].F=c*+d-len;
        P[i+N].S=c*+d;
    }
    for(int i=;i<=N;i++)
    {
        for(int j=;j<=N;j++)
        {
            if(i==j) continue;
            if(check(i,j)) AddEdge(i,j+N);
            if(check(i,j+N)) AddEdge(i,j);
            if(check(i+N,j)) AddEdge(i+N,j+N);
            if(check(i+N,j+N)) AddEdge(i+N,j);
        }
    }
    for(int i=;i<=N;i++)
        if(!dfn[i])
             tarjan(i);
    for(int i=;i<=N;i++)
        if(color[i]==color[i+N])
            {printf("NO\n");return ;}
    printf("YES\n");
    for(int i=;i<=N;i++)
        enemy[color[i]]=color[i+N],
        enemy[color[i+N]]=color[i];
    for(int i=;i<=N<<;i++)
    {
        for(int j=head[i];j!=-;j=edge[j].nxt)
        {
            if(color[i]!=color[edge[j].v])
            {
                E[color[edge[j].v]].push_back(color[i]);
                 inder[color[i]]++;
            }
        }
    }
    Topsort();
    for(int i=;i<=N;i++)
    {
        if(ans[color[i]]==)
            printf("%.2d:%.2d %.2d:%.2d\n",P[i].F/,P[i].F%,P[i].S/,P[i].S%);
        else
            printf("%.2d:%.2d %.2d:%.2d\n",P[i+N].F/,P[i+N].F%,P[i+N].S/,P[i+N].S%);
    }
    return ;

}