Kirai[POJ3352]Road Construction（缩点，割边，桥，环）
题目链接：http://poj.org/problem?id=3352
给一个图，问加多少条边可以干掉所有的桥。
先找环，然后缩点。标记对应环的度，接着找桥。写几个例子就能知道要添加的边数是桥的个数/2取上整。
这题和3177不一样的地方在于，这个题考虑重边，而我的代码本身，饿哦考虑重边的。
考虑重边：
找出桥，然后缩点。计算缩点后度为1的连通块个数。
1 /* 2 ━━━━━┒ギリギリ♂ eye！ 3 ┓┏┓┏┓┃キリキリ♂ mind！ 4 ┛┗┛┗┛┃＼○／ 5 ┓┏┓┏┓┃ / 6 ┛┗┛┗┛┃ノ) 7 ┓┏┓┏┓┃ 8 ┛┗┛┗┛┃ 9 ┓┏┓┏┓┃ 10 ┛┗┛┗┛┃ 11 ┓┏┓┏┓┃ 12 ┛┗┛┗┛┃ 13 ┓┏┓┏┓┃ 14 ┃┃┃┃┃┃ 15 ┻┻┻┻┻┻ 16 */ 17 #include <algorithm> 18 #include <iostream> 19 #include <iomanip> 20 #include <cstring> 21 #include <climits> 22 #include <complex> 23 #include <fstream> 24 #include <cassert> 25 #include <cstdio> 26 #include <bitset> 27 #include <vector> 28 #include <deque> 29 #include <queue> 30 #include <stack> 31 #include <ctime> 32 #include <set> 33 #include <map> 34 #include <cmath> 35 using namespace std; 36 #define fr first 37 #define sc second 38 #define cl clear 39 #define BUG puts("here!!!") 40 #define W(a) while(a--) 41 #define pb(a) push_back(a) 42 #define Rint(a) scanf("%d", &a) 43 #define Rll(a) scanf("%lld", &a) 44 #define Rs(a) scanf("%s", a) 45 #define Cin(a) cin >> a 46 #define FRead() freopen("in", "r", stdin) 47 #define FWrite() freopen("out", "w", stdout) 48 #define Rep(i, len) for(int i = 0; i < (len); i++) 49 #define For(i, a, len) for(int i = (a); i < (len); i++) 50 #define Cls(a) memset((a), 0, sizeof(a)) 51 #define Clr(a, x) memset((a), (x), sizeof(a)) 52 #define Full(a) memset((a), 0x7f7f, sizeof(a)) 53 #define lp p << 1 54 #define rp p << 1 | 1 55 #define pi 3.14159265359 56 #define RT return 57 typedef long long LL; 58 typedef long double LD; 59 typedef unsigned long long ULL; 60 typedef pair<int, int> pii; 61 typedef pair<string, int> psi; 62 typedef map<string, int> msi; 63 typedef vector<int> vi; 64 typedef vector<LL> vl; 65 typedef vector<vl> vvl; 66 typedef vector<bool> vb; 67 68 typedef struct Edge { 69 int v; 70 bool cut; 71 Edge() {} 72 Edge(int vv) : v(vv) { cut = 0; } 73 }Edge; 74 75 const int maxn = 5500; 76 const int maxm = 555011; 77 int n, m; 78 int dig[maxn]; 79 int dfn[maxn], low[maxn], idx; 80 vector<Edge> G[maxn]; 81 bool vis[maxn]; 82 int st[maxn], top; 83 int belong[maxn], bcnt; 84 85 void tarjan(int u, int p) { 86 int v; 87 low[u] = dfn[u] = ++idx; 88 vis[u] = 1; 89 st[top++] = u; 90 Rep(i, G[u].size()) { 91 v = G[u][i].v; 92 if(v == p) continue; 93 if(!dfn[v]) { 94 tarjan(v, u); 95 low[u] = min(low[u], low[v]); 96 if(low[v] > dfn[u]) { 97 G[u][i].cut = 1; 98 Rep(j, G[v].size()) { 99 if(G[v][j].v== u) { 100 G[v][j].cut = 1; 101 break; 102 } 103 } 104 } 105 } 106 else if(vis[v]) low[u] = min(low[u], dfn[v]); 107 } 108 if(low[u] == dfn[u]) { 109 bcnt++; 110 do { 111 v = st[--top]; 112 vis[v] = 0; 113 belong[v] = bcnt; 114 } while(v != u); 115 } 116 } 117 118 int main() { 119 // FRead(); 120 int u, v; 121 while(~Rint(n) && ~Rint(m)) { 122 Rep(i, n+50) G[i].cl(); 123 Cls(vis); Cls(dig); Cls(dfn); Cls(low); 124 top = 0; idx = 0; bcnt = 0; 125 Rep(i, m) { 126 Rint(u); Rint(v); 127 G[u].pb(Edge(v)); G[v].pb(Edge(u)); 128 } 129 tarjan(1, 0); 130 int ret = 0; 131 For(u, 1, n+1) { 132 Rep(i, G[u].size()) { 133 if(G[u][i].cut) { 134 dig[belong[u]]++; 135 } 136 } 137 } 138 For(i, 1, bcnt+1) { 139 if(dig[i] == 1) ret++; 140 } 141 printf("%d\n", (ret+1)>>1); 142 } 143 RT 0; 144 }
不考虑重边：
1 /* 2 ━━━━━┒ギリギリ♂ eye！ 3 ┓┏┓┏┓┃キリキリ♂ mind！ 4 ┛┗┛┗┛┃＼○／ 5 ┓┏┓┏┓┃ / 6 ┛┗┛┗┛┃ノ) 7 ┓┏┓┏┓┃ 8 ┛┗┛┗┛┃ 9 ┓┏┓┏┓┃ 10 ┛┗┛┗┛┃ 11 ┓┏┓┏┓┃ 12 ┛┗┛┗┛┃ 13 ┓┏┓┏┓┃ 14 ┃┃┃┃┃┃ 15 ┻┻┻┻┻┻ 16 */ 17 #include <algorithm> 18 #include <iostream> 19 #include <iomanip> 20 #include <cstring> 21 #include <climits> 22 #include <complex> 23 #include <fstream> 24 #include <cassert> 25 #include <cstdio> 26 #include <bitset> 27 #include <vector> 28 #include <deque> 29 #include <queue> 30 #include <stack> 31 #include <ctime> 32 #include <set> 33 #include <map> 34 #include <cmath> 35 using namespace std; 36 #define fr first 37 #define sc second 38 #define cl clear 39 #define BUG puts("here!!!") 40 #define W(a) while(a--) 41 #define pb(a) push_back(a) 42 #define Rint(a) scanf("%d", &a) 43 #define Rll(a) scanf("%lld", &a) 44 #define Rs(a) scanf("%s", a) 45 #define Cin(a) cin >> a 46 #define FRead() freopen("in", "r", stdin) 47 #define FWrite() freopen("out", "w", stdout) 48 #define Rep(i, len) for(int i = 0; i < (len); i++) 49 #define For(i, a, len) for(int i = (a); i < (len); i++) 50 #define Cls(a) memset((a), 0, sizeof(a)) 51 #define Clr(a, x) memset((a), (x), sizeof(a)) 52 #define Full(a) memset((a), 0x7f7f, sizeof(a)) 53 #define lp p << 1 54 #define rp p << 1 | 1 55 #define pi 3.14159265359 56 #define RT return 57 typedef long long LL; 58 typedef long double LD; 59 typedef unsigned long long ULL; 60 typedef pair<int, int> pii; 61 typedef pair<string, int> psi; 62 typedef map<string, int> msi; 63 typedef vector<int> vi; 64 typedef vector<LL> vl; 65 typedef vector<vl> vvl; 66 typedef vector<bool> vb; 67 68 const int maxn = 1500; 69 const int maxm = 5011; 70 int n, m; 71 int dig[maxn]; 72 int pre[maxn], dfn[maxn], low[maxn]; 73 vector<int> G[maxn]; 74 bool vis[maxn]; 75 76 void dfs(int u, int p) { 77 vis[u] = 1; 78 pre[u] = p; 79 dfn[u] = low[u] = u; 80 Rep(i, G[u].size()) { 81 int v = G[u][i]; 82 if(!vis[v]) dfs(v, u); 83 else if(v != p) low[u] = min(low[u], dfn[v]); 84 } 85 } 86 87 void update(int u) { 88 int d = low[u]; 89 while(u != d && u != 0) { 90 low[u] = d; 91 u = pre[u]; 92 } 93 } 94 95 int main() { 96 // FRead(); 97 int u, v; 98 while(~Rint(n) && ~Rint(m)) { 99 Rep(i, n+50) G[i].cl(); 100 Cls(vis); Cls(dig); Cls(dfn); Cls(low); Cls(pre); 101 Rep(i, m) { 102 Rint(u); Rint(v); 103 G[u].pb(v); G[v].pb(u); 104 } 105 For(i, 1, n+1) if(!vis[i]) dfs(i, 0); 106 For(i, 1, n+1) if(dfn[i] != low[i]) update(i); 107 For(u, 1, n+1) { 108 Rep(i, G[u].size()) { 109 int v = G[u][i]; 110 if(low[u] != low[v]) { 111 dig[low[u]]++; dig[low[v]]++; 112 } 113 } 114 } 115 int ret = 0; 116 For(i, 1, n+1) dig[i] /= 2; 117 For(i, 1, n+1) if(low[i] == i && dig[low[i]] == 1) ret++; 118 printf("%d\n", ret % 2 == 0 ? ret / 2 : ret / 2 + 1); 119 } 120 RT 0; 121 }
