http://train.usaco.org/usacoprob2?a=nOsVamksRaE&S=telecow
题目大意:有N个点,M条双向边的图,要求去掉最少的点使得c1,c2不再联通,并且按升序打印出去掉的点(如果有多解要求N进制下最小)
基本思路:
预处理:
将点转化成边(而边仍旧是边),每个点分裂出来的入点与出点间的通量应该是这个点的权重(在这道题里只要相同即可)
求出割边(因为原始边的通量均为无穷,所以割边必为分裂出来的边)分析其原理:将某些点切开(断开)可以使得源汇点被分入两个部分中
操作:
Dinic求出最大流,即为第一问答案
枚举去除点(分裂出来的边),找到使流量减少的那一条加入答案
注意:在BFS时,将c1的两点(c1*2-1,c1*2)均看作源点,层次为1,在DFS时,c2的入点(c2*2-1)看作汇点,防止每次循环只能获得一条流量为1的增广路
/*
ID: frontie1
TASK: telecow
LANG: C++
*/
#include <iostream>
#include <cstdio>
#include <queue>
using namespace std;
const int INFI = 0x3f3f3f3f;
int N, M, c1, c2;
int det[1400], suc[1400];
int e = 1;
int head[205];
int tem1, tem2;
int adj[205][205];
int level[205];
bool dele[105];
void addedge(int p1, int p2)
{
det[e] = p2;
suc[e] = head[p1];
head[p1] = e++;
}
void makeadj()
{
for(int i = 1; i <= 2*N; ++i){
for(int k = 1; k <= 2*N; ++k){
adj[i][k] = 0;
}
}
for(int i = 1; i <= N; ++i){
for(int cur = head[i]; cur != 0; cur = suc[cur]){
adj[2*i][2*det[cur]-1] = INFI;
}
}
for(int i = 1; i <= N; ++i){
if(!dele[i])adj[2*i-1][2*i] = 1;
}
}
bool BFS()
{
queue<int> Q;
for(int i = 1; i <= 2*N; ++i){
level[i] = 0;
}
level[2*c1-1] = level[2*c1] = 1;
Q.push(2*c1);
while(!Q.empty()){
int u = Q.front(); Q.pop();
for(int i = 1; i <= 2*N; ++i){
if(adj[u][i] > 0 && level[i] == 0){
level[i] = level[u]+1;
Q.push(i);
}
}
}
if(level[2*c2-1] == 0) return false;
return true;
}
int DFS(int cur, int flow)
{
if(cur == 2*c2-1) return flow;
for(int i = 1; i <= 2*N; ++i){
if(adj[cur][i] > 0 && (level[i] == (level[cur]+1))){
int fl = DFS(i, min(flow, adj[cur][i]));
if(fl > 0){
adj[cur][i] -= fl;
adj[i][cur] += fl;
return fl;
}
}
}
return 0;
}
int Dinic()
{
int output = 0;
int d;
while(BFS()){
while(d = DFS(2*c1, INFI)){
output += d;
}
}
return output;
}
int main()
{
freopen("telecow.in", "r", stdin);
freopen("telecow.out", "w", stdout);
cin >> N >> M >> c1 >> c2;
for(int i = 0; i < M; ++i){
cin >> tem1 >> tem2;
addedge(tem1, tem2);
addedge(tem2, tem1);
}
makeadj();
int output = Dinic();
//int cnt = output;
cout << output << endl;
for(int i = 1; i <= N; ++i){
if(i == c1 || i == c2) continue;
dele[i] = true;
makeadj();
int tem = Dinic();
if(tem == output-1){
--output;
cout << i;
if(output != 0) cout << ' ';
else cout << endl;
}
else{
dele[i] = false;
}
if(output == 0) break;
}
//for(int i = 0; )
return 0;
}