立志用最少的代碼做最高效的表達(dá)

---

We never paid any heed to the ancient prophecies, like fools we clung to the old hatreds, and fought as we had for generations. Until one day the sky rained fire, and a new enemy came upon us. We stand now upon the brink of destruction, for the Reign of Chaos has come at last.

Thrall, the warchief of the Orcish Horde, all along, he led his tribe live in the fringe of Lordaeron under the human control. In a downpour night, Thrall falls into sleep in a Orc hall at Arathi Highlands, at this moment he heard a voice:

“The sands of time have run out, son of Durotan. The cries of war echo upon the winds, the remnants of the past scar the land which is besieged once again by conflict. Heroes arise to challenge fate, and lead their brethren to battle. As mortal armies rush blindly towards their doom, The Burning Shadow comes to consume us all. You must rally the Horde, and lead your people to their destiny.

I will answer all of your questions in time, young warchief. For now, rally your warriors and prepare to leave this land, cross the sea to the distant land of Kalimdor. We will speak again. ”

Thrall believes the prophesy of Blood Raven Medivh. Three days later, He and Grom Hellscream’s Warsong Clan meet in the Lordaeron coast to the distant lands of Kalimdor. But the Goblin Zeppelins they take encountered storms in the middle. Thrall and Grom falling to the islands, they want to find each other and then to Kalimdor.

For the sake of simplicity, we assume that Thrall and Grom may fall into any islands x and y, only by Thrall to find Grom or by Grom to find Thrall. Give you the map of this island, please judge that Thrall and Gtom can meet?

Input
There are multiple test case in the input file, first line is a case number T. Each test case will begin with two integers N (0 <= N < 2001) and M (0 <= M < 10001), where N is the number of islands and M is number of portal. Next M lines each line contains two integers a and b, indicated there is a portal in island a that people can go from a to b by this portal. The island numbered from 1 to N.

Output
For each test case, your output should be in one line with “Kalimdor is just ahead” (without quotes, hereinafter the same) if Thrall and Grom can meet or “The Burning Shadow consume us all” otherwise as indicated in the sample output.

Sample Input
2
3 2
1 2
1 3
3 2
1 2
2 3
Sample Output
Case 1: The Burning Shadow consume us all
Case 2: Kalimdor is just ahead

---

分析

題意：n個(gè)點(diǎn)，m條路，單向路(只能從a到b)。 問任意兩個(gè)點(diǎn)是否都連通。

分析：

1、BFS
模板題，開大數(shù)組存儲全部點(diǎn)，最后判斷即可。

2、強(qiáng)聯(lián)通分量
明天更新~

---

代碼一：BFS解法

#include<iostream> #include<queue> #include<cstring> #define maxn 2010 using namespace std; typedef long long gg;gg n, m; vector<gg>g[maxn]; bool has[maxn][maxn]; //連通數(shù)組 bool vis[maxn]; //每次bfs時(shí)判斷是否可見 bool ok;void bfs(int s) {memset(vis, 0, sizeof(vis)); //vis置0 vis[s] = 1;queue<int>q;q.push(s);while(!q.empty()) { //遍歷數(shù)組 int first = q.front();q.pop();int len = g[first].size();for(int i = 0; i < len; i++) {int v = g[first][i];if(vis[v]) continue; //如果已經(jīng)遍歷過，則跳過has[s][v] = 1;q.push(v);vis[v] = 1; }} }int main() {gg t, c = 1;scanf("%lld", &t);while(t--) {ok = true;scanf("%lld%lld", &n, &m);memset(has, 0, sizeof(has)); //1、初始化 for(gg i = 0; i < maxn; i++) g[i].clear();gg u, v;while(m--) { //2、數(shù)值存儲， scanf("%lld%lld", &u, &v);g[u].push_back(v);}for(gg i = 1; i <= n; i++) //3、逐個(gè)bfs，生成has數(shù)組 bfs(i);for(int i = 1; i <= n; i++) { //判斷是否連通 for(int j = i+1; j <= n; j++) {if(!has[i][j] && !has[j][i]) { //只要有一個(gè)不連通 ok = false; break;}}if(ok == false) break;} if(ok)printf("Case %d: Kalimdor is just ahead\n", c++);else printf("Case %d: The Burning Shadow consume us all\n",c++);}return 0; }

---

耗時(shí)

500ms

超強(qiáng)干貨來襲 云風(fēng)專訪：近40年碼齡，通宵達(dá)旦的技術(shù)人生

總結(jié)

以上是生活随笔為你收集整理的Thrall’s Dream HRBUST - 2048【BFS or 强连通分量】的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

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