DFS及其应用专题

最新推荐文章于 2023-04-19 22:02:48 发布

nike0good

最新推荐文章于 2023-04-19 22:02:48 发布

阅读量732

点赞数

分类专栏： # 系列文章标签： uva

本文链接：https://blog.csdn.net/nike0good/article/details/52016878

版权

系列专栏收录该内容

38 篇文章 0 订阅

订阅专栏

UVA 1364 Knights of the Round Table
UVA 1108 Mining Your Own Business
UVA 12167 Proving Equivalences
HDU 4635 Strongly connected
UVA 11324 The Largest Clique
UVA 1146 Now or later
UVA 1391 Astronauts
UVA 11396 Claw Decomposition
UVA 1357 Cells
UVA 10765 Doves and bombs
uva 11294 Wedding
UVA 1086 The Ministers Major Mess
UVA 1361 Cactus
UVA 10972 RevolC FaeLoN

UVA 1364 Knights of the Round Table

无向图的双连通分量(Bicconected Component,BCC)中的一个点，不在任何奇环中当且仅当该双连通分量是二分图

#include<bits/stdc++.h>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=Pre[x];p;p=Next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=Next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (100000007)
#define pb push_back
#define mp make_pair 
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
#define MAXN (1000+10)
#define MAXM (1000000+10)
struct Edge{
    int u,v;
    Edge(int _u=0,int _v=0):u(_u),v(_v){}
};
int pre[MAXN],post[MAXN],iscut[MAXN],bccno[MAXN],dfs_clock,bcc_cnt;
vi G[MAXN],bcc[MAXN]; 
int low[MAXN];
stack<Edge> S;
void PREVISIT(int u){ pre[u]=++dfs_clock;}
void POSTVISIT(int u){ post[u]=++dfs_clock;}
int dfs(int u,int fa) {
    int lowu=pre[u] = ++dfs_clock;
    int child = 0;
    int sz = G[u].size();
    Rep(i,sz) {
        int v=G[u][i];
        Edge e = Edge(u,v);
        if (!pre[v]) {
            S.push(e);
            child++;
            int lowv=dfs(v,u);
            lowu=min(lowu,lowv);
            if (lowv>=pre[u]) {
                iscut[u]=1;
                bcc_cnt++; bcc[bcc_cnt].clear();
                while(1) {
                    Edge x = S.top(); S.pop();
                    if (bccno[x.u]!=bcc_cnt) {bcc[bcc_cnt].pb(x.u); bccno[x.u]=bcc_cnt; }
                    if (bccno[x.v]!=bcc_cnt) {bcc[bcc_cnt].pb(x.v); bccno[x.v]=bcc_cnt; }
                    if (x.u==u && x.v==v) break;
                }
            }
        }
        else if (pre[v]<pre[u]&&v!=fa) {
            S.push(e);
            lowu = min(lowu , pre[v]);
        }
    }
    if (fa<0 && child == 1 ) iscut[u] = 0;
    low[u] = lowu;
    return lowu;
}
void find_bcc(int n) {
    MEM(pre) MEM(iscut) MEM(bccno)
    dfs_clock = bcc_cnt = 0;
    Rep(i,n) if (!pre[i]) dfs(i,-1); 
}
int odd[MAXN],color[MAXN];
bool bipartite(int u,int b) {
    int sz=G[u].size();
    Rep(i,sz) {
        int v=G[u][i];
        if (bccno[v]!=b) continue;
        if (color[v]==color[u]) return 0;
        if (!color[v]) {
            color[v]=3-color[u];
            if (!bipartite(v,b)) return 0;
        }
    }
    return 1;
}
int A[MAXN][MAXN];
int main()
{
//  freopen("uva1364.in","r",stdin);
//  freopen(".out","w",stdout);
    int n,m;
    while(cin>>n>>m&&n) {
        MEM(A)
        For(i,m) {
            int u=read()-1,v=read()-1;
            A[u][v]=A[v][u]=1;
        }
        Rep(i,n) Fork(j,i+1,n-1) if (!A[i][j]) {
            G[i].pb(j);
            G[j].pb(i);
        }
        find_bcc(n);
        MEM(odd)
        For(i,bcc_cnt) {
            MEM(color)
            int u=bcc[i][0];
            color[u]=1;
            if (!bipartite(u,i)) {
                int sz=bcc[i].size();
                Rep(j,sz) odd[bcc[i][j]]=1;
            }
        }
        int ans=0;
        Rep(i,n) ans+=odd[i];
        cout<<n-ans<<endl;
        Rep(i,n) G[i].clear();
        while(!S.empty()) S.pop();
    }

    return 0;
}

UVA 1108 Mining Your Own Business

每个双连通分量中，太平井的数量不超过1。
注意只有一个双连通分量的情况

#include<bits/stdc++.h>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=Pre[x];p;p=Next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=Next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (100000007)
#define pb push_back
#define mp make_pair 
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans1,ans2) printf("Case %d: %lld %lld\n",kcase,ans1,ans2);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
#define MAXN (100000+10)
#define MAXM (100000+10)
struct Edge{
    int u,v;
    Edge(int _u=0,int _v=0):u(_u),v(_v){}
};
int pre[MAXN],post[MAXN],iscut[MAXN],bccno[MAXN],dfs_clock,bcc_cnt;
vi G[MAXN],bcc[MAXN]; 
int low[MAXN];
stack<Edge> S;
void PREVISIT(int u){ pre[u]=++dfs_clock;}
void POSTVISIT(int u){ post[u]=++dfs_clock;}
int dfs(int u,int fa) {
    int lowu=pre[u] = ++dfs_clock;
    int child = 0;
    int sz = G[u].size();
    Rep(i,sz) {
        int v=G[u][i];
        Edge e = Edge(u,v);
        if (!pre[v]) {
            S.push(e);
            child++;
            int lowv=dfs(v,u);
            lowu=min(lowu,lowv);
            if (lowv>=pre[u]) {
                iscut[u]=1;
                bcc_cnt++; bcc[bcc_cnt].clear();
                while(1) {
                    Edge x = S.top(); S.pop();
                    if (bccno[x.u]!=bcc_cnt) {bcc[bcc_cnt].pb(x.u); bccno[x.u]=bcc_cnt; }
                    if (bccno[x.v]!=bcc_cnt) {bcc[bcc_cnt].pb(x.v); bccno[x.v]=bcc_cnt; }
                    if (x.u==u && x.v==v) break;
                }
            }
        }
        else if (pre[v]<pre[u]&&v!=fa) {
            S.push(e);
            lowu = min(lowu , pre[v]);
        }
    }
    if (fa<0 && child == 1 ) iscut[u] = 0;
    low[u] = lowu;
    return lowu;
}
void find_bcc(int n) {
    MEM(pre) MEM(iscut) MEM(bccno)
    dfs_clock = bcc_cnt = 0;
    Rep(i,n) if (!pre[i]) dfs(i,-1); 
}
int main()
{
//  freopen("uva1108.in","r",stdin);
//  freopen(".out","w",stdout);
    int n,m;
    int kcase=1;
    while(cin>>n&&n) {
        int N=0;
        For(i,n) {
            int u=read()-1,v=read()-1;
            G[u].pb(v);
            G[v].pb(u);
            N=max(N,max(u,v));
        }
        N+=2;
        find_bcc(N);
        if (bcc_cnt==1) {
            ll sz=bcc[1].size();
            Pr(kcase,2,sz*(sz-1)/2)
        } else {
            ll ans1=0,ans2=1;
            For(i,bcc_cnt) {
                int sz=bcc[i].size(),cut_cnt=0;
                Rep(j,sz) cut_cnt+=(bool)iscut[bcc[i][j]];
                if (cut_cnt==1) {
                    ++ans1; ans2*=(ll)(sz-1);
                }
            }
            Pr(kcase,ans1,ans2)
        }
        Rep(i,N) G[i].clear();
        ++kcase;
    }

    return 0;
}

UVA 12167 Proving Equivalences

Kosaraju
有向图中连接尽量少的边使原图强连通
强连通分量(SSC)缩点后,得到DAG
$ans=max(入度为0的点,出度为0的点)$
注意特判只有一个SSC的情况

#include<bits/stdc++.h>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=Pre[x];p;p=Next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=Next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (100000007)
#define pb push_back
#define mp make_pair 
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
#define MAXN (20000+10)
vi G[MAXN],G2[MAXN];
vi S;
int vis[MAXN],sccno[MAXN],scc_cnt;
void dfs1(int u) {
    if (vis[u]) return ;
    vis[u] = 1;
    int sz=SI(G[u]);
    Rep(i,sz) dfs1(G[u][i]);
    S.pb(u);
}
void dfs2(int u) {
    if (sccno[u]) return;
    sccno[u] = scc_cnt;
    int sz=SI(G2[u]);
    Rep(i,sz) dfs2(G2[u][i]);
}
void find_scc(int n) {
    scc_cnt=0;
    S.clear();
    MEM(sccno) MEM(vis) 
    Rep(i,n) dfs1(i);
    RepD(i,n-1)
        if (!sccno[S[i]]) {
            scc_cnt++; dfs2(S[i]);
        }
}
int in0[MAXN],out0[MAXN];
int main()
{
//  freopen("uva12167.in","r",stdin);
//  freopen(".out","w",stdout);

    int T=read();
    while(T--) {
        int n=read(),m=read();
        Rep(i,m) {
            int u=read()-1,v=read()-1;
            G[u].pb(v);G2[v].pb(u);
        }
        find_scc(n);
        For(i,scc_cnt) in0[i]=out0[i]=1;
        Rep(u,n) {
            int sz=SI(G[u]);
            Rep(i,sz) {
                int v=G[u][i];
                if (sccno[u]^sccno[v]) in0[sccno[v]]=out0[sccno[u]]=0;
            }
        }
        int a=0,b=0;
        For(i,scc_cnt) a+=in0[i],b+=out0[i];
        if (scc_cnt==1) puts("0"); else cout<<max(a,b)<<endl;
        Rep(i,n) G[i].clear(),G2[i].clear();    
    }

    return 0;
}

HDU 4635 Strongly connected

有向图中添加最多几条边使原图仍不强连通

假设有一个部分为A，令一个部分为B
A,B是完全图，A中任意一点连到B中任意一点

那么只要让|A-B|尽量大就行
找到原图最小的强连通分量即可

特判只有1个SSC的情况

#include<bits/stdc++.h>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=Pre[x];p;p=Next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=Next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (100000007)
#define pb push_back
#define mp make_pair 
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case %d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
#define MAXN (200010+10) 
vi G[MAXN];
int pre[MAXN],lowlink[MAXN],sccno[MAXN],dfs_clock,scc_cnt;
stack<int> S; 
void dfs(int u) {
    pre[u] = lowlink[u] = ++dfs_clock;
    S.push(u);
    int sz=SI(G[u]);
    Rep(i,sz) {
        int v=G[u][i];
        if (!pre[v]) {
            dfs(v);
            lowlink[u]=min(lowlink[u],lowlink[v]);
        } else if (!sccno[v]) {
            lowlink[u]=min(lowlink[u],pre[v]);
        } 
    } 
    if (lowlink[u]==pre[u]) {
        scc_cnt++;  
        while(1) {
            int x=S.top();S.pop();
            sccno[x]=scc_cnt;
            if (x==u) break;  
        } 
    }       
} 
void find_scc(int n) {
    dfs_clock = scc_cnt = 0;
    MEM(sccno) 
    MEM(pre)
    Rep(i,n) if (!pre[i]) dfs(i);
}
int in[MAXN],out[MAXN],val[MAXN];
int main()
{
    freopen("hdu4635.in","r",stdin);
//  freopen(".out","w",stdout);
    int T=read();
    For(kcase,T) {
        int n=read(),m=read();
        Rep(i,m) {
            int u=read()-1,v=read()-1;
            G[u].pb(v);
        }
        find_scc(n);
        ll ans=0;
        if (scc_cnt==1) ans=-1;
        else {
            MEM(in) MEM(out) MEM(val)
            Rep(u,n) {
                val[sccno[u]]++;
                int sz=SI(G[u]);
                Rep(i,sz) {
                    int v = G[u][i];
                    if (sccno[u]^sccno[v]) in[sccno[v]]=out[sccno[u]]=1;
                }
            }
            For(i,scc_cnt) {
                if (!in[i] || !out[i]) {
                    ll tmp = val[i];
                    ans=max(ans,(ll)tmp*(tmp-1) + (ll)tmp*(n-tmp) + (ll)(n-tmp)*(n-tmp-1) - m);
                }
            }
        }
        Pr(kcase,ans)
        Rep(i,n) G[i].clear();
    }
    return 0;
}

UVA 11324 The Largest Clique

Tarjan

#include<bits/stdc++.h>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=Pre[x];p;p=Next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=Next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (100000007)
#define pb push_back
#define mp make_pair 
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
#define MAXN (1000+10)
#define MAXM (50000+10)
vi G[MAXN],G2[MAXN],G3[MAXN];
vi S;
int vis[MAXN],sccno[MAXN],scc_cnt;
void dfs1(int u) {
    if (vis[u]) return ;
    vis[u] = 1;
    int sz=SI(G[u]);
    Rep(i,sz) dfs1(G[u][i]);
    S.pb(u);
}
void dfs2(int u) {
    if (sccno[u]) return;
    sccno[u] = scc_cnt;
    int sz=SI(G2[u]);
    Rep(i,sz) dfs2(G2[u][i]);
}
void find_scc(int n) {
    scc_cnt=0;
    S.clear();
    MEM(sccno) MEM(vis) 
    Rep(i,n) dfs1(i);
    RepD(i,n-1)
        if (!sccno[S[i]]) {
            scc_cnt++; dfs2(S[i]);
        }
}
int f[MAXN],val[MAXN];
int dfs(int x) {
    if (f[x]) return f[x];
    int sz=G3[x].size();
    Rep(i,sz) f[x]=max(f[x],dfs(G3[x][i]));
    return f[x]=f[x]+val[x];

}
int main()
{
//  freopen("uva11324.in","r",stdin);
//  freopen(".out","w",stdout);

    int T=read();
    while(T--) {
        int n=read(),m=read();
        Rep(i,m) {
            int u=read()-1,v=read()-1;
            G[u].pb(v);G2[v].pb(u);
        }
        find_scc(n);
        MEM(val)    MEM(f)  
        Rep(u,n) {
            val[sccno[u]]++;
            int sz=G[u].size();
            Rep(i,sz) {
                int v=G[u][i];
                if (sccno[u]^sccno[v]) {
                    G3[sccno[u]].pb(sccno[v]);
                }
            }
        }
        int ans=0;
        For(i,scc_cnt) ans=max(ans,dfs(i));
        cout<<ans<<endl;
        Rep(i,n) G[i].clear(),G2[i].clear();
        For(i,scc_cnt) G3[i].clear();           
    }

    return 0;
}

UVA 1146 Now or later

2SAT

#include<bits/stdc++.h>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=Pre[x];p;p=Next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=Next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (100000007)
#define pb push_back
#define mp make_pair 
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
ll Abs(ll x){return (x<0)?-x:x;}
int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
#define MAXN (2000+10)
struct TwoSat{
    int n;
    vi G[MAXN*2]; 
    bool mark[MAXN*2];
    int S[MAXN*2],c;
    bool dfs(int x) {
        if (mark[x^1]) return 0;
        if (mark[x]) return 1;
        mark[x]=1;
        S[c++]=x;
        int sz=SI(G[x]);
        Rep(i,sz) if (!dfs(G[x][i])) return 0;
        return 1;
    }
    void init(int n) {
        this -> n = n;
        Rep(i,n*2) G[i].clear();
        MEM(mark)
    }
    //x = xval or y = yval
    void add_clause(int x,int xval,int y,int yval) {
        x=x*2+xval;
        y=y*2+yval;
        G[x^1].pb(y);
        G[y^1].pb(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) mark[S[--c]] = 0;
                    if (!dfs(i+1)) return 0;
                }
            }
        }
        return 1;
    }
}solver;
int T[MAXN][2],n;
bool check(ll diff) {
    solver.init(n);
    Rep(i,n) Rep(j,2) Fork(k,i+1,n-1) Rep(l,2) {
        if (Abs(T[i][j]-T[k][l])<diff) {
            solver.add_clause(i,j^1,k,l^1);
        }
    } 
    return solver.solve();
} 
int main()
{
    freopen("uva1146.in","r",stdin);
//  freopen(".out","w",stdout);
    while(cin>>n) {
        Rep(i,n) Rep(j,2) T[i][j]=read();
        ll L=0,ans=0,R=1e9;
        while(L<=R) {
            ll M=(L+R)/2;
            if (check(M)) ans=M,L=M+1;else R=M-1;
        } 
        cout<<ans<<endl;
    }   

    return 0;
}

UVA 1391 Astronauts

#include<bits/stdc++.h>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=Pre[x];p;p=Next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=Next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (100000007)
#define pb push_back
#define mp make_pair 
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
ll Abs(ll x){return (x<0)?-x:x;}
int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
#define MAXN (100000+10)
struct TwoSat{
    int n;
    vi G[MAXN*2]; 
    bool mark[MAXN*2];
    int S[MAXN*2],c;
    bool dfs(int x) {
        if (mark[x^1]) return 0;
        if (mark[x]) return 1;
        mark[x]=1;
        S[c++]=x;
        int sz=SI(G[x]);
        Rep(i,sz) if (!dfs(G[x][i])) return 0;
        return 1;
    }
    void init(int n) {
        this -> n = n;
        Rep(i,n*2) G[i].clear();
        MEM(mark)
    }
    //x = xval or y = yval
    void add_clause(int x,int xval,int y,int yval) {
        x=x*2+xval;
        y=y*2+yval;
        G[x^1].pb(y);
        G[y^1].pb(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) mark[S[--c]] = 0;
                    if (!dfs(i+1)) return 0;
                }
            }
        }
        return 1;
    }
}solver;
int age[MAXN];
int n,m;
int main()
{
    freopen("uva1391.in","r",stdin);
//  freopen(".out","w",stdout);
    while(cin>>n>>m&&n&&m) {
        double S=0;
        Rep(i,n) S+=(age[i]=read());
        S/=(double) n;
        solver.init(n);
        Rep(i,m) {
            int u=read(),v=read();
            u--,v--;
            solver.add_clause(u,1,v,1);
            if ((age[u]<S) ^ (age[v]>=S)) solver.add_clause(u,0,v,0);
        }
        if (!solver.solve()) puts("No solution.");
        else {
            Rep(i,n) if (solver.mark[2*i]) puts("C");
            else puts((age[i]<S)? "B":"A");
        }
    }   
    return 0;
}

UVA 11396 Claw Decomposition

一个点度数均为3的图能被分解成爪，当且仅当这是二分图

#include<bits/stdc++.h>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=Pre[x];p;p=Next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=Next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (100000007)
#define pb push_back
#define mp make_pair 
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
#define MAXN (310+10)
vi G[MAXN]; 
int color[MAXN];
bool bipartite(int u) {
    int sz=G[u].size();
    Rep(i,sz) {
        int v=G[u][i];
        if (color[v]==color[u]) return 0;
        if (!color[v]) {
            color[v]=3-color[u];
            if (!bipartite(v)) return 0;
        }
    }
    return 1;
}
int main()
{
//  freopen("uva11396.in","r",stdin);
//  freopen(".out","w",stdout);
    int n,m;
    while(cin>>n&&n) {
        while(1) {
            int u=read()-1,v=read()-1;
            if (u<0) break;
            G[u].pb(v);
            G[v].pb(u);
        }
        MEM(color)
        bool fl=1;
        Rep(i,n) if (!color[i]){
            color[i]=1; 
            if (!bipartite(i)) {
                fl=0; break;
            }       
        }
        if (fl) puts("YES");
        else puts("NO");
        Rep(i,n) G[i].clear();
    }

    return 0;
}

UVA 1357 Cells

给定所有点的子节点个数，保证节点编号按顺序出现，询问某2点是否构成祖先关系
用栈模拟一下dfs

#include<bits/stdc++.h>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=Pre[x];p;p=Next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=Next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (100000007)
#define pb push_back
#define mp make_pair 
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase) printf("Case %d:\n",kcase);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
#define MAXN (20000000+10)
#define MAXM (1000000+10)
int pre[MAXN],post[MAXN],dfs_clock=0; 
void PREVISIT(int u){ pre[u]=++dfs_clock;}
void POSTVISIT(int u){ post[u]=++dfs_clock;}
int c[MAXN],s[MAXN],n;
stack<int> S;
void dfs() {
    S.push(0);
    while(!S.empty()) {
        int x=S.top(); 
        if (pre[x]) {
            POSTVISIT(x);
            S.pop();
            continue;
        }
        PREVISIT(x);
        Fork(i,s[x],s[x]+c[x]-1) {
            if (i<n) {
//              pre[i]=0;
                S.push(i);
            } else{
                PREVISIT(i);
                POSTVISIT(i);
            }
        }
    }
}
int main()
{
//  freopen("uva1357.in","r",stdin);
//  freopen(".out","w",stdout);
    int T=read();
    For(kcase,T) {
        n=read();
        s[0]=1;
        Rep(i,n) {
            c[i]=read();
            if (i) s[i]=s[i-1]+c[i-1];
        }
        dfs_clock=0;
        MEM(pre) MEM(post)
        dfs();
        int Q=read();
        Pr(kcase)
        while(Q--) {
            int u=read(),v=read();
            printf("%s\n", pre[u] < pre[v] && post[u] > post[v] ? "Yes" : "No" );  
        }
        if (kcase<T) puts(""); 
    }

    return 0;
}

UVA 10765 Doves and bombs

向下的连通块数(成为几次割点)+向上的连通块数(最多为1)

#include<bits/stdc++.h>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=Pre[x];p;p=Next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=Next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (100000007)
#define pb push_back
#define mp make_pair 
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
#define MAXN (10000+10)
#define MAXM (1000000+10)
struct Edge{
    int u,v;
    Edge(int _u=0,int _v=0):u(_u),v(_v){}
};
int pre[MAXN],post[MAXN],iscut[MAXN],bccno[MAXN],dfs_clock,bcc_cnt;
vi G[MAXN],bcc[MAXN]; 
int low[MAXN];
stack<Edge> S;
void PREVISIT(int u){ pre[u]=++dfs_clock;}
void POSTVISIT(int u){ post[u]=++dfs_clock;}
int dfs(int u,int fa) {
    int lowu=pre[u] = ++dfs_clock;
    int child = 0;
    int sz = G[u].size();
    Rep(i,sz) {
        int v=G[u][i];
        Edge e = Edge(u,v);
        if (!pre[v]) {
            S.push(e);
            child++;
            int lowv=dfs(v,u);
            lowu=min(lowu,lowv);
            if (lowv>=pre[u]) {
                iscut[u]++;
                bcc_cnt++; bcc[bcc_cnt].clear();
                while(1) {
                    Edge x = S.top(); S.pop();
                    if (bccno[x.u]!=bcc_cnt) {bcc[bcc_cnt].pb(x.u); bccno[x.u]=bcc_cnt; }
                    if (bccno[x.v]!=bcc_cnt) {bcc[bcc_cnt].pb(x.v); bccno[x.v]=bcc_cnt; }
                    if (x.u==u && x.v==v) break;
                }
            }
        }
        else if (pre[v]<pre[u]&&v!=fa) {
            S.push(e);
            lowu = min(lowu , pre[v]);
        }
    }
    if (fa<0 && child == 1 ) iscut[u] = 0;
    low[u] = lowu;
    return lowu;
}
void find_bcc(int n) {
    MEM(pre) MEM(iscut) MEM(bccno)
    dfs_clock = bcc_cnt = 0;
    Rep(i,n) if (!pre[i]) {
        iscut[i]=-1;
        dfs(i,-1);
    }
}
int main()
{
//  freopen("uva10765.in","r",stdin);
//  freopen(".out","w",stdout);
    int n,m;
    while(cin>>n>>m&&n) {
        while(1) {
            int u=read(),v=read();
            if (u==-1) break;
            G[u].pb(v);
            G[v].pb(u);
        }       
        find_bcc(n);

        vector<pi> v;
        Rep(i,n) v.pb(mp(-iscut[i]-1,i));
        sort(v.begin(),v.end());
        Rep(i,m) printf("%d %d\n",v[i].se,-v[i].fi);
        puts("");

        Rep(i,n) G[i].clear();
    }
    return 0;
}

uva 11294 Wedding

#include<bits/stdc++.h>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=Pre[x];p;p=Next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=Next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (100000007)
#define pb push_back
#define mp make_pair 
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
ll Abs(ll x){return (x<0)?-x:x;}
int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
#define MAXN (100000+10)
struct TwoSat{
    int n;
    vi G[MAXN*2]; 
    bool mark[MAXN*2];
    int S[MAXN*2],c;
    bool dfs(int x) {
        if (mark[x^1]) return 0;
        if (mark[x]) return 1;
        mark[x]=1;
        S[c++]=x;
        int sz=SI(G[x]);
        Rep(i,sz) if (!dfs(G[x][i])) return 0;
        return 1;
    }
    void init(int n) {
        this -> n = n;
        Rep(i,n*2) G[i].clear();
        MEM(mark)
    }
    //x = xval or y = yval
    void add_clause(int x,int xval,int y,int yval) {
        x=x*2+xval;
        y=y*2+yval;
        G[x^1].pb(y);
        G[y^1].pb(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) mark[S[--c]] = 0;
                    if (!dfs(i+1)) return 0;
                }
            }
        }
        return 1;
    }
}solver;
int n,m;
int main()
{
//  freopen("uva11294.in","r",stdin);
//  freopen(".out","w",stdout);
    while(scanf("%d %d\n",&n,&m)!=EOF&&n&&m) {
        solver.init(n);
        Rep(i,m) {
            int x,y;
            char c,c2;
            scanf("%d%c %d%c\n",&x,&c,&y,&c2);
            solver.add_clause(x,c=='w',y,c2=='w');
        }       
        solver.add_clause(0,1,0,1);
        if (!solver.solve()) puts("bad luck");
        else {
            For(i,n-1) {
                printf("%d",i);
                if (solver.mark[i*2+1]) putchar('w'); else putchar('h');
                if (i<n-1)putchar(' ');
            }
            puts("");
        }
    }   
    return 0;
}

UVA 1086 The Ministers’ Major Mess

#include<bits/stdc++.h>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=Pre[x];p;p=Next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=Next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (100000007)
#define pb push_back
#define mp make_pair 
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
ll Abs(ll x){return (x<0)?-x:x;}
int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
#define MAXN (500+10)
struct TwoSat{
    int n;
    vi G[MAXN*2]; 
    bool mark[MAXN*2];
    int S[MAXN*2],c;
    bool dfs(int x) {
        if (mark[x^1]) return 0;
        if (mark[x]) return 1;
        mark[x]=1;
        S[c++]=x;
        int sz=SI(G[x]);
        Rep(i,sz) if (!dfs(G[x][i])) return 0;
        return 1;
    }
    void init(int n) {
        this -> n = n;
        Rep(i,n*2) G[i].clear();
        MEM(mark)
    }
    //x = xval or y = yval
    void add_clause(int x,int xval,int y,int yval) {
        x=x*2+xval;
        y=y*2+yval;
        G[x^1].pb(y);
        G[y^1].pb(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) mark[S[--c]] = 0;
                    if (!dfs(i+1)) return 0;
                }
            }
        }
        return 1;
    }
    bool check(int i) {
        MEM(mark) c=0;
        if (!dfs(i)) return 0;
        return solve();
    }
    void work() {
        Rep(i,n) {
            bool b=check(2*i+1),b2=check(2*i);
            if (b&&b2) putchar('?');
            else if (b) putchar('y');
            else putchar('n');
        }
        puts("");
    }
}solver;
int n,m;
int main()
{
//  freopen("uva1086.in","r",stdin);
//  freopen(".out","w",stdout);
    int kcase=1;
    while(cin>>n>>m&&n&&m) { 
        printf("Case %d: ",kcase++);

        solver.init(n);
        Rep(i,m) {
            int k=read();
            vector< pi > v;
            Rep(j,k) {
                int p; char s[2];
                scanf("%d%s",&p,s);--p;
                v.pb(mp(p,s[0]=='y'));
            }
            if (k<=2) {
                Rep(j,k) solver.add_clause(v[j].fi,v[j].se,v[j].fi,v[j].se);
            } else {
                Rep(j,k) Fork(l,j+1,k-1)
                    solver.add_clause(v[j].fi,v[j].se,v[l].fi,v[l].se);
            }
        }
        if (!solver.solve()) puts("impossible");                
        else solver.work();
    }   
    return 0;
}

UVA 1361 Cactus

#include<bits/stdc++.h>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=Pre[x];p;p=Next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=Next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (100000007)
#define pb push_back
#define mp make_pair 
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
#define MAXN (20000+10)
#define MAXM (1000000+10)
struct Edge{
    int u,v;
    Edge(int _u=0,int _v=0):u(_u),v(_v){}
};
int pre[MAXN],post[MAXN],iscut[MAXN],bccno[MAXN],dfs_clock,bcc_cnt;
vi G[MAXN],bcc[MAXN]; 
int low[MAXN];
stack<Edge> S;
class bingchaji
{
public:
    int father[MAXN],n,sum;
    void mem(int _n)
    {
        n=_n; sum=0;
        For(i,n) father[i]=i;
    }
    int getfather(int x) 
    {
        if (father[x]==x) return x;
        return father[x]=getfather(father[x]);
    }
    void unite(int x,int y)
    {
        father[x]=getfather(father[x]);
        father[y]=getfather(father[y]);
        if (father[x]!=father[y]) ++sum;
        father[father[x]]=father[father[y]];
    }
    bool same(int x,int y)
    {
        return getfather(x)==getfather(y);
    }
}SS;
bool flag=0;
int dfs(int u,int fa) {
    int lowu=pre[u] = ++dfs_clock;
    int child = 0 ,cnt = 0;
    int sz = G[u].size();
    Rep(i,sz) {
        int v=G[u][i];
        Edge e = Edge(u,v);
        if (!pre[v]) {
            S.push(e);
            child++;
            int lowv=dfs(v,u);
            lowu=min(lowu,lowv);
            if (lowv<pre[u]) ++cnt;
            if (lowv>=pre[u]) {
                iscut[u]=1;
                bcc_cnt++; bcc[bcc_cnt].clear();
                while(1) {
                    Edge x = S.top(); S.pop();
                    if (bccno[x.u]!=bcc_cnt) {bcc[bcc_cnt].pb(x.u); bccno[x.u]=bcc_cnt; }
                    if (bccno[x.v]!=bcc_cnt) {bcc[bcc_cnt].pb(x.v); bccno[x.v]=bcc_cnt; }
                    if (x.u==u && x.v==v) break;
                }
            }
        }
        else if (pre[v]<pre[u]&&v!=fa) {
            cnt++;
            S.push(e);
            lowu = min(lowu , pre[v]);
        }
    }
    if (fa<0 && child == 1 ) iscut[u] = 0;
    low[u] = lowu;
    if (cnt>=2) flag=1;
    return lowu;
}
typedef long long LL;
const double EPS = 1e-10;
struct BigInt
{
#define IntMod 10000
private:
    vector<int> A;
    bool Positive;
    int VecNum;
public:
    inline int GetLength(LL a) {int t=0; while (a>0) {a/=IntMod; t++;} return t;}
    BigInt() { Positive = 1; VecNum = 0; }
    BigInt(const BigInt &a) { A = a.A; VecNum = a.VecNum; Positive = a.Positive; }
    BigInt(const LL &b)
    {
        LL a=b;
        Positive=(a>=0);
        VecNum=GetLength(abs(a));
        A.resize(VecNum);
        Rep(i,VecNum)
        {
            A[i]=a%IntMod;
            a/=IntMod;
        }
    }
    friend ostream& operator << (ostream &out, BigInt &a)
    {
        if (a.VecNum==0)
        {
            out<<"0";
            return out;
        }   
        if (!a.Positive) out << "-";
        out << a.A[a.VecNum - 1];
        RepD(i,a.VecNum - 2 )
        {
            if (a.A[i] == 0) { out << "0000"; continue; }
            Rep(j, (int)(4 - log(a.A[i]) / log(10) - EPS) ) out << '0';
            out << a.A[i];
        }
        return out;
    }
    BigInt operator * (const BigInt& b) const
    {
        BigInt x=*this;
        BigInt y=b;
        BigInt ans;
        if ((x.Positive && y.Positive) || (!x.Positive && !y.Positive)) ans.Positive=1;
        else ans.Positive=0;
        int m=x.VecNum,n=y.VecNum;
        int L=m+n+1;
        ans.VecNum=L;
        ans.A.resize(L+3);
        Rep(i,m)
            Rep(j,n)
            {
                int pos=i+j;
                LL t=x.A[i]*y.A[j];
                int post=0;
                while (t>0)
                {
                    ans.A[pos+post]+=t%IntMod;
                    t/=IntMod;
                    post++;
                }
            }
        Rep(i,L) { ans.A[i + 1] += ans.A[i] / IntMod; ans.A[i] %= IntMod; }
        while (ans.A[L - 1] == 0 && ((L-1)!=0) ) { ans.VecNum--; ans.A.pop_back(); L--; }
        return ans;
    }

};
void find_bcc(int n) {
    MEM(pre) MEM(iscut) MEM(bccno)
    dfs_clock = bcc_cnt = 0;
    Rep(i,n) if (!pre[i]) dfs(i,-1); 
}
void calc() {
    BigInt t=1;
    For(i,bcc_cnt) {
        int sz=bcc[i].size();
        if (sz<3) continue;
        t=t*BigInt(sz+1);
    }
    cout<<t<<endl;
}
int main()
{
//  freopen("uva1361.in","r",stdin);
//  freopen(".out","w",stdout);
    int n,m;
    int fl=0;
    while(cin>>n>>m&&n) {
        if (fl) puts(""); fl=1;
        SS.mem(n);
        Rep(i,m) {
            int k=read(),u=read()-1;
            For(j,k-1) {
                int v=read()-1;
                G[u].pb(v);
                G[v].pb(u);
                SS.unite(u+1,v+1);
                u=v;
            }
        }
        if (SS.sum!=n-1) {
            puts("0");
            Rep(i,n) G[i].clear();
            continue;
        }
        flag=0;
        find_bcc(n);
        if (flag) {
            puts("0");
            Rep(i,n) G[i].clear();
            continue;
        }
        calc();
        Rep(i,n) G[i].clear();
    }

    return 0;
}

UVA 10972 RevolC FaeLoN

边连通分量

#include<bits/stdc++.h>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=Pre[x];p;p=Next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=Next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (100000007)
#define pb push_back
#define mp make_pair 
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
#define MAXN (1000+10)
#define MAXM (1000000+10)
struct Edge{
    int u,v;
    Edge(int _u=0,int _v=0):u(_u),v(_v){}
};
int pre[MAXN],post[MAXN],iscut[MAXN],bccno[MAXN],dfs_clock,bcc_cnt;
vi G[MAXN],P[MAXN],bcc[MAXN]; 
int low[MAXN];
int dfs(int u,int fa) {
    int lowu=pre[u] = ++dfs_clock;
    int sz = G[u].size();
    Rep(i,sz) {
        int v=G[u][i];
        if (!pre[v]) {
            int lowv=dfs(v,u);
            lowu=min(lowu,lowv);
            if (lowv>pre[u]) {
                P[u].pb(v);
                P[v].pb(u);
            }
        }
        else if (pre[v]<pre[u]&&v!=fa) {
            lowu = min(lowu , pre[v]);
        }
    }
    low[u] = lowu;
    return lowu;
}
int dfs2(int u,int fa) {
    bccno[u]=bcc_cnt;
    int sz=SI(G[u]);
    Rep(i,sz) {
        int v=G[u][i];
        int sz2=SI(P[u]);
        bool flag=0;
        Rep(j,sz2) {
            if (P[u][j]==v) {
                flag=1; break;
            }   
        }
        if (flag||bccno[v]) continue;
        dfs2(v,u);
    }
}
void find_bcc(int n) {
    MEM(pre) MEM(bccno)
    dfs_clock = bcc_cnt = 0;
    Rep(i,n) if (!pre[i]) dfs(i,-1); 
    Rep(i,n) if (!bccno[i]){
        bcc_cnt++;
        dfs2(i,-1);
    }
}
int degree[MAXN];
int main()
{
//  freopen("uva10972.in","r",stdin);
//  freopen(".out","w",stdout);
    int n,m;
    while(cin>>n>>m&&n) {
        Rep(i,m) {
            int u=read(),v=read();
            u--,v--;
            G[u].pb(v);
            G[v].pb(u);
        }
        find_bcc(n);
        ll ans=0;
        if (bcc_cnt==1) ans=0;
        else {
            MEM(degree)
            Rep(i,n) {
                int sz=SI(G[i]);
                Rep(j,sz) {
                    int v=G[i][j];
                    if (bccno[i]^bccno[v]) {
                        degree[bccno[i]]++;
                    }
                }
            }
            For(i,bcc_cnt) {
                if (!degree[i]) ans+=2;
                if (degree[i]==1) ans++;
            }           
            ans=(1+ans)/2;
        }
        cout<<ans<<endl;
        Rep(i,n) G[i].clear(),P[i].clear();
    }
    return 0;
}

nike0good

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
DFS及其应用专题

UVA 1364 Knights of the Round TableUVA 1108 Mining Your Own BusinessUVA 12167 Proving EquivalencesHDU 4635 Strongly connectedUVA 11324 The Largest CliqueUVA 1364 Knights of the Round Table无向图的双连通分量
复制链接

扫一扫