题目:
http://poj.org/problem?id=3207
题意:
给定一个圆,圆上有按顺序分部的0至n-1共n个点,现在连接m对点,这m对点不会出现重复,连线可以在圆内或者圆外,问连线会不会有相交
思路:
两条交叉的连线是矛盾关系,只能一条在圆内一条在圆外,于是把连线看成点,连四条边(i, ~j)(j, ~i)(~i, j)(~j, i),判断i和~i和有没有在一个强连通分量内
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
const int N = 2000;
struct edge
{
int to, next;
}g[N*100];
int cnt, head[N];
int dfn[N], low[N], st[N], scc[N], top, idx, num;
bool vis[N];
int a[N], b[N];
int n, m;
void add_edge(int v, int u)
{
g[cnt].to = u, g[cnt].next = head[v], head[v] = cnt++;
}
void init()
{
memset(head, -1, sizeof head);
memset(dfn, -1, sizeof dfn);
memset(vis, 0, sizeof vis);
cnt = num = idx = top = 0;
}
void tarjan(int v)
{
dfn[v] = low[v] = ++idx;
vis[v] = true, st[top++] = v;
int u;
for(int i = head[v]; i != -1; i = g[i].next)
{
u = g[i].to;
if(dfn[u] == -1)
{
tarjan(u);
low[v] = min(low[v], low[u]);
}
else if(vis[u]) low[v] = min(low[v], dfn[u]);
}
if(dfn[v] == low[v])
{
++num;
do
{
u = st[--top], vis[u] = false, scc[u] = num;
}while(u != v);
}
}
int main()
{
while(~ scanf("%d%d", &n, &m))
{
init();
for(int i = 1; i <= m; i++)
{
scanf("%d%d", &a[i], &b[i]);
if(a[i] > b[i]) swap(a[i], b[i]);
}
for(int i = 1; i <= m; i++)
for(int j = i+1; j <= m; j++)
if((a[i] < a[j] && a[j] < b[i] && b[i] < b[j]) || (a[j] < a[i] && a[i] < b[j] && b[j] < b[i]))
{
add_edge(i, j + m), add_edge(j, i + m);
add_edge(i + m, j), add_edge(j + m, i);
}
for(int i = 1; i <= 2*m; i++)
if(dfn[i] == -1) tarjan(i);
bool flag = true;
for(int i = 1; i <= m; i++)
if(scc[i] == scc[i+m])
{
flag = false; break;
}
if(flag) printf("panda is telling the truth...\n");
else printf("the evil panda is lying again\n");
}
return 0;
}