2-SAT模板

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL maxn = 2000000 + 100;
const LL maxm = 10000000 + 100;
LL age[maxn],a[maxn][2],vis[maxn];
LL he[maxn],ver[maxm],ne[maxm],tot,n;
LL dfn[maxn],low[maxn],c[maxn],st[maxn],top,tim,color;
vector bcc[maxn];
void add( LL x,LL y ){
ver[++tot] = y;
ne[tot] = he[x];
he[x] = tot;
}
void tarjan( LL x ){
st[top++] = x;
dfn[x] = low[x] = ++tim;
for( LL cure = he[x]; cure; cure = ne[cure] ){
LL y = ver[cure];
if( !dfn[y] ){
tarjan(y);
low[x] = min( low[x],low[y] );
}else if( !c[y] ){
low[x] = min( low[x],dfn[y] );
}
}
if( low[x] == dfn[x] ){
LL cur;
color++;
do{
cur = st[–top];
c[cur] = color;
bcc[color].push_back( cur );
}while( cur != x );
}
}
struct sat{
void init(){
for( LL i = 0; i < 2n;i ++ ){
he[i] = 0;
dfn[i] = 0;
c[i] = 0;
bcc[i].clear();
}
tim = top = color = 0;
tot = 1;
}
void add_clause( LL x,LL p,LL y,LL q ){
add( x+pn,y+(q^(LL)1)n );
add( y+qn,x+(p ^(LL)1 )*n );
}
bool solve(){
for( LL i = 0; i < 2 * n;i++ ){
if( dfn[i] ) continue;
tarjan(i);
}
for( LL i = 0; i < n;i ++ ){
if( c[i] == c[i+n] ) return false;
}
return true;
}
void print(){
for( LL i = 0; i < n;i ++ ){
if( c[i] < c[i+n] ){
printf("%c\n", a[i][0] ? ‘A’ : ‘B’ );
}else {
printf(“C\n”);
}
}
}
}solver;

int main()
{
//freopen( “123.txt”,“r”,stdin );
LL m,sum,av,x,y;
while( 2 == scanf("%lld%lld",&n,&m) && n && m ){
solver.init();
for( LL i = 0; i < n;i ++ ){
a[i][0] = a[i][1] = 0;
}
sum = 0;
for( LL i = 0; i < n; i ++ ){
scanf("%lld",&age[i]);
sum += age[i];
}
if( (sum % n) == 0 ){
av = sum / n;
}else{
av = sum / n + 1;
}
for( LL i = 0; i < n; i ++ ){
if( age[i] >= av ){
a[i][0] = 1;
}else{
a[i][1] = 1;
}
}
for( LL i = 0; i < m;i ++ ){
scanf("%lld%lld",&x,&y );
x–;y–;
if( x == y ) continue;
solver.add_clause( x,1,y,1 );
if( a[x][0] && a[y][0] ){
solver.add_clause( x,0,y,0 );
}else if( a[x][1] && a[y][1] ){
solver.add_clause( x,0,y,0 );
}
}
if( solver.solve() ){
solver.print();
}else {
printf(“No solution.\n”);
}
}
return 0;
}