传送门:【POJ】3905 Perfect Election
题目分析:很明显的2-sat。四句话一个意思:x、y至少选一个。建边< ~x , y > , < ~y , x >跑2-sat即可。
倒是因为刷速度耽误了写题解的时间。不过很想吐嘈poj啊。。数据貌似给的不规范?也不知道是不是我测的姿势不对。。。反正样例测起来没问题的交上去就RE。
代码如下:
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std ;
#define REP( i , a , b ) for ( int i = ( a ) ; i < ( b ) ; ++ i )
#define FOR( i , a , b ) for ( int i = ( a ) ; i <= ( b ) ; ++ i )
#define REV( i , a , b ) for ( int i = ( a ) ; i >= ( b ) ; -- i )
#define CLR( a , x ) memset ( a , x , sizeof a )
#define CPY( a , x ) memcpy ( a , x , sizeof a )
const int MAXN = 2000 ;
const int MAXE = 2000000 ;
struct Edge {
int v ;
Edge* next ;
} E[MAXE] , *H[MAXN] , *cur ;
int dfn[MAXN] , low[MAXN] , scc[MAXN] , scc_cnt ;
int S[MAXN] , top , dfs_clock ;
int n , m ;
void init () {
cur = E ;
top = scc_cnt = dfs_clock = 0 ;
CLR ( H , 0 ) ;
CLR ( dfn , 0 ) ;
CLR ( scc , 0 ) ;
}
void addedge ( int u , int v ) {
cur -> v = v ;
cur -> next = H[u] ;
H[u] = cur ++ ;
}
void tarjan ( int u ) {
dfn[u] = low[u] = ++ dfs_clock ;
S[top ++] = u ;
for ( Edge* e = H[u] ; e ; e = e -> next ) {
int v = e -> v ;
if ( !dfn[v] ) {
tarjan ( v ) ;
low[u] = min ( low[u] , low[v] ) ;
} else if ( !scc[v] ) low[u] = min ( low[u] , dfn[v] ) ;
}
if ( low[u] == dfn[u] ) {
++ scc_cnt ;
do {
scc[S[-- top]] = scc_cnt ;
} while ( u != S[top] ) ;
}
}
int ok () {
REP ( i , 0 , n << 1 ) if ( !dfn[i] ) tarjan ( i ) ;
REP ( i , 0 , n ) if ( scc[i << 1] == scc[i << 1 | 1] ) return 0 ;
return 1 ;
}
void scanf ( int& x , char c = 0 ) {
while ( ( c = getchar () ) < '0' || c > '9' ) ;
x = c - '0' ;
while ( ( c = getchar () ) >= '0' && c <= '9' ) x = x * 10 + c - '0' ;
}
void solve () {
int x , y ;
char cx , cy ;
init () ;
while ( m -- ) {
while ( ( cx = getchar () ) != '+' && cx != '-' ) ;
scanf ( x ) ;
while ( ( cy = getchar () ) != '+' && cy != '-' ) ;
scanf ( y ) ;
x = ( x - 1 ) << 1 | ( cx == '-' ) ;
y = ( y - 1 ) << 1 | ( cy == '-' ) ;
addedge ( x ^ 1 , y ) ;
addedge ( y ^ 1 , x ) ;
}
printf ( "%d\n" , ok () ? 1 : 0 ) ;
}
int main () {
while ( ~scanf ( "%d%d" , &n , &m ) && ( n || m ) ) solve () ;
return 0 ;
}