专题链接
关于tarjan
A - Network of Schools 原题地址
本题有2个问题,第一个是要算最少要给多少个点软件,才能使所有点都可以收到副本
第二个是要算最少加多少条边,使得图变成强连通
1:tarjan求强连通,然后缩点,计算入度为0的强连通分量
2:设现在有a个入度为0的点,b个出度为0的点(缩完点后的点),最合理的加边方法肯定是从出度为0的点向入度为0的点添加有向边,
如果a > b, 添加a条边,所有点的入度都大于0,所有点的出度也大于0,问题解决,答案是a
如果 a <= b,添加a条边,所有点入度大于0,但是还有b-a个点,它们的出度是0,所以还要再加b-a条边,所以答案是b
综合两种情况,答案是max(a,b)
当然如果图原来就是强连通的话,输出就是1 和 0 了
B - Network 原题地址
求割点数目,模版题
C - Critical Links
求桥,模版题,这题似乎不用判重边
关于tarjan
A - Network of Schools 原题地址
本题有2个问题,第一个是要算最少要给多少个点软件,才能使所有点都可以收到副本
第二个是要算最少加多少条边,使得图变成强连通
1:tarjan求强连通,然后缩点,计算入度为0的强连通分量
2:设现在有a个入度为0的点,b个出度为0的点(缩完点后的点),最合理的加边方法肯定是从出度为0的点向入度为0的点添加有向边,
如果a > b, 添加a条边,所有点的入度都大于0,所有点的出度也大于0,问题解决,答案是a
如果 a <= b,添加a条边,所有点入度大于0,但是还有b-a个点,它们的出度是0,所以还要再加b-a条边,所以答案是b
综合两种情况,答案是max(a,b)
当然如果图原来就是强连通的话,输出就是1 和 0 了
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 110;
struct node
{
int next;
int to;
}edge[N * N];
int st[N];
int tot, ord, sccnum, top;
int head[N];
int low[N];
int DFN[N];
int in_deg[N];
int out_deg[N];
int block[N];
bool instack[N];
void addedge(int from, int to)
{
edge[tot].to = to;
edge[tot].next = head[from];
head[from] = tot++;
}
void tarjan (int u)
{
DFN[u] = low[u] = ++ord;
instack[u] = 1;
st[top++] = u;
for (int i = head[u]; ~i; i = edge[i].next)
{
int v = edge[i].to;
if (DFN[v] == -1)
{
tarjan (v);
if (low[u] > low[v])
{
low[u] = low[v];
}
}
else if (instack[v])
{
low[u] = min(low[u], DFN[v]);
}
}
int v;
if (DFN[u] == low[u])
{
sccnum++;
do
{
v = st[--top];
block[v] = sccnum;
instack[v] = 0;
}while (v != u);
}
}
void init ()
{
memset (DFN, -1, sizeof(DFN));
memset (low, 0, sizeof(low));
memset (head, -1, sizeof(head));
memset (in_deg, 0, sizeof(in_deg));
memset (out_deg, 0, sizeof(out_deg));
memset (instack, 0, sizeof(instack));
top = 0;
tot = 0;
sccnum = 0;
ord = 0;
}
void solve (int n)
{
for (int i = 1; i <= n; ++i)
{
if (DFN[i] == -1)
{
tarjan (i);
}
}
if (sccnum == 1)
{
printf("1\n0\n");
return;
}
for (int u = 1; u <= n; ++u)
{
for (int j = head[u]; ~j; j = edge[j].next)
{
int v = edge[j].to;
if (block[u] == block[v])
{
continue;
}
out_deg[block[u]]++;
in_deg[block[v]]++;
}
}
int a, b;
a = 0;
b = 0;
for (int i = 1; i <= sccnum; ++i)
{
if (in_deg[i] == 0)
{
a++;
}
else if (out_deg[i] == 0)
{
b++;
}
}
printf("%d\n", a);
printf("%d\n", max(a, b));
}
int main()
{
int n;
int u, v;
while (~scanf("%d", &n))
{
init();
for (int u = 1; u <= n; ++u)
{
while (scanf("%d", &v), v)
{
addedge (u, v);
}
}
solve(n);
}
return 0;
}
B - Network 原题地址
求割点数目,模版题
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 110;
struct node
{
int next;
int to;
}edge[N * N];
bool instack[N];
bool cut[N];
int head[N];
int DFN[N];
int low[N];
int cnt, tot, ord, root;
void addedge (int from, int to)
{
edge[tot].to = to;
edge[tot].next = head[from];
head[from] = tot++;
}
void tarjan (int u, int fa)
{
DFN[u] = low[u] = ++ord;
instack[u] = 1;
int cnt = 0;
for (int i = head[u]; ~i; i = edge[i].next)
{
int v = edge[i].to;
if (v == fa)
{
continue;
}
if (DFN[v] == -1)
{
tarjan(v, u);
cnt++;
if (low[u] > low[v])
{
low[u] = low[v];
}
if (root == u && cnt > 1)
{
cut[u] = 1;
}
else if (u != root && low[v] >= DFN[u])
{
cut[u] = 1;
}
}
else if (instack[v])
{
low[u] = min(low[u], DFN[v]);
}
}
}
void init ()
{
memset (DFN, -1, sizeof(DFN));
memset (low, 0, sizeof(low));
memset (instack, 0, sizeof(instack));
memset (cut, 0, sizeof(cut));
memset (head, -1, sizeof(head));
tot = 0;
ord = 0;
}
void solve (int n)
{
root = 1;
tarjan (1, -1);
int ans = 0;
for (int i = 1; i <= n; ++i)
{
if (cut[i])
{
ans++;
}
}
printf("%d\n", ans);
}
int main()
{
int n;
int u, v;
while (~scanf("%d", &n), n)
{
init();
while (scanf("%d", &u), u)
{
while (getchar() != '\n')
{
scanf("%d", &v);
addedge (u, v);
addedge (v, u);
}
}
solve(n);
}
return 0;
}
C - Critical Links
求桥,模版题,这题似乎不用判重边
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream