#include <bits/stdc++.h>
using namespace std;
const int mxN = 5e5 + 100;
set<int> adj[mxN];
bool vis[mxN];
int ans = 0;
void dfs(int u){
if(vis[u]) return;
vis[u] = 1, ++ans;
for(auto it : adj[u]) dfs(it);
}
int main(){
int n, m, u, v;
cin >> n >> m;
char ch;
for(int i = 0; i < m; ++i){
cin >> u >> v >> ch;
adj[u].insert(v);
adj[v].insert(u);
}
for(int i = 1; i <= n; ++i){
if(adj[i].size() == n - 1) ++ans;
}
cout << ans << endl;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |