题意
有一些双向或者单向的路,问图中存不存在环。
思路
分成两部分。
无向图部分用并查集判断,然后重新缩点建一个有向图用强连通去判断。
如果一个强连通分量里有2个以上的点,就符合题目条件。
代码
#include <stack>
#include <cstdio>
#include <list>
#include <cassert>
#include <set>
#include <fstream>
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <functional>
#include <cstring>
#include <algorithm>
#include <cctype>
#pragma comment(linker, "/STACK:102400000,102400000")
#include <string>
#include <map>
#include <cmath>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/hash_policy.hpp>
using namespace std;
#define LL long long
#define ULL unsigned long long
#define SZ(x) (int)x.size()
#define Lowbit(x) ((x) & (-x))
#define MP(a, b) make_pair(a, b)
#define MS(arr, num) memset(arr, num, sizeof(arr))
#define PB push_back
#define X first
#define Y second
#define ROP freopen("input.txt", "r", stdin);
#define MID(a, b) (a + ((b - a) >> 1))
#define LC rt << 1, l, mid
#define RC rt << 1|1, mid + 1, r
#define LRT rt << 1
#define RRT rt << 1|1
#define FOR(i, a, b) for (int i=(a); (i) < (b); (i)++)
#define FOOR(i, a, b) for (int i = (a); (i)<=(b); (i)++)
const double PI = acos(-1.0);
const int INF = 0x3f3f3f3f;
const double eps = 1e-8;
const int MAXN = 1e6+10;
const int MOD = 1e9;
const int dir[][2] = { {-1, 0}, {1, 0}, {0, -1}, {0, 1} };
const int seed = 131;
int cases = 0;
typedef pair<int, int> pii;
int sccno[MAXN], time_stamp[MAXN], lowlink[MAXN], pa[MAXN];
int dfs_clock, scc_cnt, n;
vector<int> G[MAXN];
stack<int> stk;
bool flag;
void dfs(int u)
{
if (flag) return;
time_stamp[u] = lowlink[u] = ++dfs_clock;
stk.push(u);
FOR(i, 0, SZ(G[u]))
{
int v = G[u][i];
if (!time_stamp[v])
{
dfs(v);
lowlink[u] = min(lowlink[u], lowlink[v]);
}
else if (!sccno[v]) lowlink[u] = min(lowlink[u], time_stamp[v]);
}
if (time_stamp[u] == lowlink[u])
{
++scc_cnt;
int cnt = 0;
while (true)
{
int cur = stk.top(); stk.pop();
sccno[cur] = scc_cnt;
cnt++;
if (cur == u) break;
}
if (cnt >= 2)
{
flag = true;
return;
}
}
}
void Solve()
{
flag = false;
MS(time_stamp, 0); MS(sccno, 0);
dfs_clock = scc_cnt = 0;
FOOR(i, 1, n)
{
if (flag) break;
if (pa[i] == i && !time_stamp[i]) dfs(i);
}
puts(flag ? "YES" : "NO");
}
void init()
{
FOOR(i, 0, n)
{
G[i].clear();
pa[i] = i;
}
}
int find(int a)
{
return pa[a] = (pa[a] == a ? a : find(pa[a]));
}
int main()
{
//ROP;
int T;
cin >> T;
while (T--)
{
flag = false;
int m1, m2;
cin >> n >> m1 >> m2;
init();
FOR(i, 0, m1)
{
int a, b;
scanf("%d%d", &a, &b);
int x = find(a), y = find(b);
if (x == y) flag = true;
pa[x] = y;
}
FOR(i, 0, m2)
{
int a, b;
scanf("%d%d", &a, &b);
int x = find(a), y = find(b);
if (x == y) flag = true;
if (flag) continue;
G[x].PB(y);
}
if (flag) { puts("YES"); continue; }
Solve();
}
return 0;
}