链接:小希的迷宫
刚开始拿到这道题的时候, 由于是并查集专题,满脑子想的都是怎么用并查集来做,但是我肯定这道题肯定是能用dfs来做的, 需要判断是否有环并且所有的点都联通即可。
其实这道题很多方法都可以做,我用的dfs 100+ms过的。
后来用并查集做了一下, 是60+ms, 并且并查集的代码要短很多, 以后遇到问题要先想一下!
dfs.
#include <iostream>
#include <unordered_set>
#include <cstring>
using namespace std;
const int N = 1e5 + 10;
int h[N], ne[10 * N], e[10 * N], idx;
int vis[N];
void add(int a, int b)
{
e[idx] = b, ne[idx] = h[a], h[a] = idx ++;
}
bool dfs(int x, int pre)
{
vis[x] = pre;
for(int i = h[x]; i != -1; i = ne[i])
{
int j = e[i];
if(j != pre)
{
if(vis[j] != -1)
{
if(vis[j] != x) return false;
}
else if(!dfs(j, x)) return false;
}
}
return true;
}
int main()
{
int a, b, res;
while(scanf("%d %d", &a, &b))
{
if(a == -1 &&b == -1) return 0;
else if(a == 0 && b == 0)
{
cout << "Yes" << endl;
continue;
}
int sum = 1;
memset(h, -1, sizeof h);
memset(vis, -1, sizeof vis);
idx = 0, res = a;
unordered_set<int> S;
S.insert(a); S.insert(b);
while(scanf("%d %d", &a, &b) && a != 0)
{
if(a == -1) return 0;
S.insert(a); S.insert(b);
add(a, b), add(b, a);
sum ++;
}
if(dfs(res, res) && S.size() == sum + 1) cout << "Yes" << endl;
else cout << "No" << endl;
}
return 0;
}
并查集~
#include <iostream>
#include <cstring>
#include <unordered_set>
using namespace std;
const int N = 100010;
int p[N];
int find(int x)
{
if (p[x] == -1) return x;
if (p[x] != x) p[x] = find(x);
return p[x];
}
int main()
{
int a, b;
while (scanf("%d %d", &a, &b))
{
bool flag = true;
if (a == -1) return 0;
else if (a == 0 && b == 0)
{
cout << "Yes" << endl;
continue;
}
memset(p, -1, sizeof p);
unordered_set<int> S;
S.insert(a); S.insert(b);
int sum = 1;
while (scanf("%d %d", &a, &b))
{
if (a == 0 && b == 0) break;
a = find(a), b = find(b);
if (a == b) flag = false;
if(flag)
{
S.insert(a); S.insert(b);
sum++;
}
}
if (flag && sum + 1 == S.size()) cout << "Yes" << endl;
else cout << "No" << endl;
}
return 0;
}