http://codeforces.com/problemset/problem/999/E

題意 有向圖??? 給你n個(gè)點(diǎn)，m條邊，以及一個(gè)初始點(diǎn)s，問(wèn)你至少還需要增加多少條邊，使得初始點(diǎn)s與剩下其他的所有點(diǎn)都連通。

第一個(gè)想法自然是通過(guò)上標(biāo)記的方法，對(duì)每一個(gè)入度為0的點(diǎn)跑dfs。

但是問(wèn)題在于剩下沒(méi)有上標(biāo)記的點(diǎn)，是成環(huán)的點(diǎn)。這些點(diǎn)不能有效的形成我們希望的拓?fù)湫颉?/p>

第一個(gè)想法是可以考慮上特殊標(biāo)記，順序枚舉每個(gè)環(huán)上的點(diǎn)跑dfs，對(duì)每個(gè)隨機(jī)跑的點(diǎn)上標(biāo)記，在dfs的過(guò)程中如果可以經(jīng)過(guò)之前枚舉跑到的起點(diǎn)，就去掉這個(gè)點(diǎn)的標(biāo)記，隨后統(tǒng)計(jì)特殊標(biāo)記的數(shù)量，經(jīng)過(guò)測(cè)試，確實(shí)可以AC

#include <map> #include <set> #include <ctime> #include <cmath> #include <queue> #include <stack> #include <vector> #include <string> #include <cstdio> #include <cstdlib> #include <cstring> #include <sstream> #include <iostream> #include <algorithm> #include <functional> using namespace std; #define For(i, x, y) for(int i=x;i<=y;i++) #define _For(i, x, y) for(int i=x;i>=y;i--) #define Mem(f, x) memset(f,x,sizeof(f)) #define Sca(x) scanf("%d", &x) #define Scl(x) scanf("%lld",&x); #define Pri(x) printf("%d\n", x) #define Prl(x) printf("%lld\n",x); #define CLR(u) for(int i=0;i<=N;i++)u[i].clear(); #define LL long long #define ULL unsigned long long #define mp make_pair #define PII pair<int,int> #define PIL pair<int,long long> #define PLL pair<long long,long long> #define pb push_back #define fi first #define se second typedef vector<int> VI; const double eps = 1e-9; const int maxn = 5010; const int INF = 0x3f3f3f3f; const int mod = 1e9 + 7; int N,M,tmp,K,s; bool vis[maxn]; bool vis2[maxn]; bool vis3[maxn]; int ind[maxn]; struct Edge{int to,next; }edge[maxn]; int head[maxn],tot,ans; void init(){Mem(head,0);tot = 0; } void add(int u,int v){edge[++tot].next = head[u];edge[tot].to = v;head[u] = tot; } void dfs(int t){vis[t] = 1;for(int i = head[t]; i;i = edge[i].next){int v = edge[i].to;if(vis[v]) continue;dfs(v);} } void dfs2(int t){vis3[t] = 1;vis[t] = 1;for(int i = head[t];i;i = edge[i].next){int v = edge[i].to;if(vis2[v]){vis2[v] = 0;ans--;}if(vis3[v]) continue;dfs2(v);} } int main() {scanf("%d%d%d",&N,&M,&s);init();For(i,1,M){int u,v;scanf("%d%d",&u,&v);add(u,v);ind[v]++;}dfs(s);ans = 0;For(i,1,N){if(!ind[i] && !vis[i]){ans++;dfs(i);}}For(i,1,N){if(!vis[i]){Mem(vis3,0);ans++;dfs2(i);vis2[i] = 1;}}Pri(ans);#ifdef VSCodesystem("pause");#endifreturn 0; } View Code

第二個(gè)想法是標(biāo)記覆蓋，順序dfs每一個(gè)點(diǎn)，以每一個(gè)點(diǎn)為起點(diǎn)經(jīng)過(guò)的點(diǎn)用不同標(biāo)記覆蓋，最后判斷所有標(biāo)記的數(shù)量

#include <map> #include <set> #include <ctime> #include <cmath> #include <queue> #include <stack> #include <vector> #include <string> #include <cstdio> #include <cstdlib> #include <cstring> #include <sstream> #include <iostream> #include <algorithm> #include <functional> using namespace std; #define For(i, x, y) for(int i=x;i<=y;i++) #define _For(i, x, y) for(int i=x;i>=y;i--) #define Mem(f, x) memset(f,x,sizeof(f)) #define Sca(x) scanf("%d", &x) #define Scl(x) scanf("%lld",&x); #define Pri(x) printf("%d\n", x) #define Prl(x) printf("%lld\n",x); #define CLR(u) for(int i=0;i<=N;i++)u[i].clear(); #define LL long long #define ULL unsigned long long #define mp make_pair #define PII pair<int,int> #define PIL pair<int,long long> #define PLL pair<long long,long long> #define pb push_back #define fi first #define se second typedef vector<int> VI; const double eps = 1e-9; const int maxn = 5010; const int INF = 0x3f3f3f3f; const int mod = 1e9 + 7; int N,M,tmp,K,s; int vis[maxn]; bool vis2[maxn]; bool vis3[maxn]; int ind[maxn]; struct Edge{int to,next; }edge[maxn]; int head[maxn],tot,ans; void init(){Mem(head,0);tot = 0; } void add(int u,int v){edge[++tot].next = head[u];edge[tot].to = v;head[u] = tot; } void dfs(int t){vis[t] = tmp;for(int i = head[t]; i;i = edge[i].next){int v = edge[i].to;if(vis[v] == tmp) continue;dfs(v);} } int main() {scanf("%d%d%d",&N,&M,&s);init();For(i,1,M){int u,v;scanf("%d%d",&u,&v);add(u,v);}tmp = 1;dfs(s);For(i,1,N){if(!vis[i]){tmp++;dfs(i);}}ans = 0;vis2[1] = 1;For(i,1,N){if(!vis2[vis[i]]){vis2[vis[i]] = 1;ans++;}}Pri(ans);#ifdef VSCodesystem("pause");#endifreturn 0; } View Code

當(dāng)然，以上兩個(gè)算法都是O(n2)的算法，這題5000的數(shù)據(jù)范圍可以跑，但是當(dāng)數(shù)據(jù)范圍擴(kuò)大的時(shí)候，就需要考慮更強(qiáng)的算法來(lái)解決；

用Tarjan算法將原圖縮點(diǎn)變成一個(gè)可拓?fù)涞膁ag圖，直接數(shù)入度為0的點(diǎn)即可。

#include <map> #include <set> #include <ctime> #include <cmath> #include <queue> #include <stack> #include <vector> #include <string> #include <cstdio> #include <cstdlib> #include <cstring> #include <sstream> #include <iostream> #include <algorithm> #include <functional> using namespace std; #define For(i, x, y) for(int i=x;i<=y;i++) #define _For(i, x, y) for(int i=x;i>=y;i--) #define Mem(f, x) memset(f,x,sizeof(f)) #define Sca(x) scanf("%d", &x) #define Scl(x) scanf("%lld",&x); #define Pri(x) printf("%d\n", x) #define Prl(x) printf("%lld\n",x); #define CLR(u) for(int i=0;i<=N;i++)u[i].clear(); #define LL long long #define ULL unsigned long long #define mp make_pair #define PII pair<int,int> #define PIL pair<int,long long> #define PLL pair<long long,long long> #define pb push_back #define fi first #define se second typedef vector<int> VI; const double eps = 1e-9; const int maxn = 5010; const int INF = 0x3f3f3f3f; const int mod = 1e9 + 7; int N,M,tmp,K,s; int vis[maxn]; struct Edge{int to,next; }edge[maxn]; int head[maxn],tot,ans; int Low[maxn],dfn[maxn],Stack[maxn],belong[maxn]; int index,top,scc; bool Instack[maxn]; int ind[maxn]; int num[maxn]; void Tarjan(int u){int v;Low[u] = dfn[u] = ++ index;Stack[top++] = u;Instack[u] = true;for(int i = head[u];i;i =edge[i].next){int v = edge[i].to;if(!dfn[v]){Tarjan(v);if(Low[u] > Low[v]) Low[u] = Low[v];}else if(Instack[v] && Low[u] > dfn[v]){Low[u] = dfn[v];}}if(Low[u] == dfn[u]){scc++;do{v = Stack[--top];Instack[v] = false;belong[v] = scc;num[scc]++;}while(v != u);} } void init(){Mem(head,0);tot = 0; } void add(int u,int v){edge[++tot].next = head[u];edge[tot].to = v;head[u] = tot; }int main() {scanf("%d%d%d",&N,&M,&s);init();For(i,1,M){int u,v;scanf("%d%d",&u,&v);add(u,v);}index = scc = top = 0;For(i,1,N) if(!dfn[i]) Tarjan(i);int ans = 0;For(i,1,N){for(int j = head[i];j;j = edge[j].next){int v = edge[j].to;if(belong[i] != belong[v]){ind[belong[v]] = 1;}}}vis[belong[s]] = 1;For(i,1,N){if(!ind[belong[i]] && !vis[belong[i]]){vis[belong[i]] = 1;ans++;}}Pri(ans);#ifdef VSCodesystem("pause");#endifreturn 0; }

?

轉(zhuǎn)載于:https://www.cnblogs.com/Hugh-Locke/p/9595021.html

創(chuàng)作挑戰(zhàn)賽新人創(chuàng)作獎(jiǎng)勵(lì)來(lái)咯，堅(jiān)持創(chuàng)作打卡瓜分現(xiàn)金大獎(jiǎng)

總結(jié)

以上是生活随笔為你收集整理的CodeForces999E 双dfs // 标记覆盖 // tarjan缩点的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。