제출 #920979

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
920979		zhehan	Monthly railway pass (LMIO18_menesinis_bilietas)	C++14	6 / 100	1254 ms	162036 KiB

menesinis_bilietas

#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;
}

• Subtask 1: 0 / 10
• Subtask 2: 6 / 6
• Subtask 3: 0 / 30
• Subtask 4: 0 / 35
• Subtask 5: 0 / 19