P4171 [JSOI2010]满汉全席（2-sat）

最新推荐文章于 2022-01-06 11:51:52 发布

Mr.Gzj

最新推荐文章于 2022-01-06 11:51:52 发布

阅读量203

点赞数

分类专栏：连通图

本文链接：https://blog.csdn.net/Endeavor_G/article/details/102941156

版权

连通图专栏收录该内容

21 篇文章 1 订阅

订阅专栏

模型：两个至少选一个。

#include<bits/stdc++.h>
#define ll long long
#define MP make_pair
#define P pair<long long, long long>
using namespace std;
const int N = 2e3 + 10;
int t, n, m, h[N], cnt;
int dfn[N], scc[N], ins[N], low[N], ind, col;
stack<int> s;
char l[3], r[3];
struct node {
    int v, nt;
} no[N];
void add(int u, int v) {
    no[cnt] = node{v, h[u]};
    h[u] = cnt++;
}
void tarjan(int u) {
    dfn[u] = low[u] = ++ind;
    ins[u] = 1;
    s.push(u);
    for(int i = h[u]; ~i; i = no[i].nt) {
        int v = no[i].v;
        if(!dfn[v])
            tarjan(v), low[u] = min(low[u], low[v]);
        else if(ins[v])
            low[u] = min(low[u], dfn[v]);
    }
    if(low[u] == dfn[u]) {
        ++col;
        int v;
        do {
            v = s.top();
            s.pop();
            scc[v] = col;
            ins[v] = 0;
        } while(u != v);
    }
}
int check() {
    for(int i = 1; i <= n; i++)
        if(scc[i] == scc[i + n])
            return 0;
    return 1;
}
int main() {
    scanf("%d", &t);
    while(t--) {
        while(!s.empty())
            s.pop();
        scanf("%d%d", &n, &m);
        memset(h, -1, sizeof h), cnt = ind = col = 0;
        memset(dfn, 0, sizeof dfn);
        memset(ins, 0, sizeof ins);
        for(int x, y, i = 1; i <= m; i++) {
            scanf("%1s%d %1s%d", l, &x, r, &y);
            if(l[0] == 'm' && r[0] == 'm')
                add(x + n, y), add(y + n, x);
            if(l[0] == 'h' && r[0] == 'h')
                add(x, y + n), add(y, x + n);
            if(l[0] == 'h' && r[0] == 'm')
                add(x, y), add(y + n, x + n);
            if(l[0] == 'm' && r[0] == 'h')
                add(x + n, y + n), add(y, x);
        }
        for(int i = 1; i <= n * 2; i++)
            if(!dfn[i])
                tarjan(i);
        printf(check() ? "GOOD\n" : "BAD\n");
    }
    return 0;
}