This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int parent[500000];
int f(int a){
if(parent[a]==a){
return a;
}
return parent[a]=f(parent[a]);
}
void u(int a,int b){
parent[f(a)]=f(b);
}
int main()
{
int n,m;
cin>>n>>m;
for(int i{1};i<n+1;++i){
parent[i]=i;
}
map<int,vector<int>> ma;
for(int i{};i<m;++i){
int a,b;
char c;
cin>>a>>b>>c;
if(c=='T'){
u(a,b);
}else{
ma[a].push_back(b);
ma[b].push_back(a);
}
}
map<int,set<int>> mf;
map<int,int> cc;
for(int i{1};i<n+1;++i){
cc[parent[i]]++;
for(auto e:ma[i]){
mf[parent[i]].insert(parent[e]);
}
}
int counter=0;
for(auto e:mf){
if(mf.size()==e.second.size()+1){
counter+=cc[e.first];
}
}
cout<<counter;
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... |