HDU 3713 Go deeper

HDU 3713 Go deeper

二分+2Sat问题
由于它的m值并不会很大且具有单调性，故可以二分枚举最大m取值，然后每一个m的情况对应的就是一个2-sat问题（百度）。

代码：

#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <stack>
#include <cstdio>
using namespace std;
const int N = 220;
const int NN = 1e4+10;
int a[NN],b[NN],c[NN],n,m;
int DFN[2*N],Low[2*N],id,belong[2*N],cnt;
int st[2*N],instack[2*N],stop,vis[2*N];
struct Edge
{
    vector<int>to;
};
void init()
{
    memset(DFN,0,sizeof(DFN));
    memset(Low,0,sizeof(Low));
    memset(instack,0,sizeof(instack));
    id = 0;
}
void Tarjan(int u,Edge *edges)
{
    DFN[u]=Low[u]=++id;
    instack[st[++stop]=u]= 1;
    for(int i=0;i<edges[u].to.size();i++)
    {
        int to = edges[u].to[i];
        if(!vis[to])
        {
            vis[to] = 1;
            Tarjan(to,edges);
            Low[u] = min(Low[u],Low[to]);
        }
        else if(instack[to])
            Low[u] = min(DFN[to],Low[u]);
    }
    if(DFN[u]==Low[u])
    {
        ++cnt;
        int top ;
        do
        {
            top = st[stop--];
            instack[top] = 0;
            belong[top] = cnt;
        }while(top!=u);
    }
}
bool check(int k)
{
    memset(belong,0,sizeof(belong));
    memset(vis,0,sizeof(vis));
    cnt=0;
    stop=-1;
    Edge edges[2*n+10];
    for(int i=0;i<k;i++)
    {
        if(c[i]==0)
        {
            edges[a[i]].to.push_back(b[i]+n);
            //edges[b[i]+n].to.push_back(a[i]);
            edges[b[i]].to.push_back(a[i]+n);
            //edges[a[i]+n].to.push_back(b[i]);
        }
        else if (c[i]==1)
        {
            edges[a[i]+n].to.push_back(b[i]+n);
            edges[b[i]+n].to.push_back(a[i]+n);
            edges[a[i]].to.push_back(b[i]);
            edges[b[i]].to.push_back(a[i]);
        }
        else if(c[i]==2)
        {
            edges[a[i]+n].to.push_back(b[i]);
            //edges[b[i]].to.push_back(a[i]+n);
            edges[b[i]+n].to.push_back(a[i]);
            //edges[a[i]].to.push_back(b[i]+n);
        }
    }
    for(int i=0;i<n;i++)if(!vis[i]){init();Tarjan(i,edges);}
    for(int i=0;i<n;i++)
    {
        if(belong[i]==belong[i+n])return false;
    }
    return true;
}
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d",&n,&m);
        for(int i = 0;i<m;i++)
        {
            scanf("%d%d%d",&a[i],&b[i],&c[i]);
        }
        int l = 1,r = m,f=-1;
        //cout << "f: " << f << endl;
        while(r>=l)
        {
            int mid = (l+r)/2;
            if(check(mid))l = mid+1,f = max(mid,f);
            else r = mid-1;
        }
        printf("%d\n",f);
    }
    return 0;
}