#include <bits/stdc++.h>
using namespace std;
long long N, E;
void dfs(long long n, vector<vector<long long>>& g, vector<bool>& v) {
v[n] = true;
for (long long e : g[n]) {
if (!v[e]) {
dfs(e, g, v);
}
}
}
long long c(long long N, vector<pair<long long, long long>>& d) {
vector<vector<long long>> g(N);
for (auto d : d) {
g[d.first].push_back(d.second);
g[d.second].push_back(d.first);
}
vector<bool> v(N, false);
long long u = 0;
for (long long i = 0; i < N; ++i) {
if (!v[i]) {
u++;
dfs(i,g,v);
}
}
return u;
}
int main() {
cin >> N >> E;
vector<pair<long long, long long>> d(E);
for (long long i = 0; i < E; ++i) {
char sodifjsd;
cin >> d[i].first >> d[i].second >> sodifjsd;
}
if (c(N,d) == 1) cout << N;
else cout << 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
286 ms |
36432 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
11352 KB |
Output is correct |
2 |
Runtime error |
1 ms |
348 KB |
Execution killed with signal 11 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
348 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
348 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
286 ms |
36432 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |