제출 #638686

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
638686		NaimSS	Monthly railway pass (LMIO18_menesinis_bilietas)	C++14	100 / 100	534 ms	116416 KiB

menesinis_bilietas

#include <bits/stdc++.h>
//#define int long long
#define ld long double
#define endl "\n"
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb push_back
#define mp(a,b) make_pair(a,b)
#define ms(v,x) memset(v,x,sizeof(v))
#define all(v) v.begin(),v.end()
#define ff first
#define ss second
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define per(i, a, b) for(int i = b-1; i>=a ; i--)
#define trav(a, x) for(auto& a : x)
#define allin(a , x) for(auto a : x)
#define Unique(v) sort(all(v));v.erase(unique(all(v)),v.end());
#define sz(v) ((int)v.size())
using namespace std;
typedef vector<int> vi;
#define y1 abacaba
//#define left oooooopss
#define db(x) cerr << #x <<" == "<<x << endl;
#define db2(x,y) cerr<<#x <<" == "<<x<<", "<<#y<<" == "<<y<<endl;
#define db3(x,y,z) cerr << #x<<" == "<<x<<", "<<#y<<" == "<<y<<", "<<#z<<" == "<<z<<endl;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
std::mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down
//inline ll mod(ll n, ll m ){ ll ret = n%m; if(ret < 0) ret += m; return ret; }
ll gcd(ll a, ll b){return (b == 0LL ? a : gcd(b, a%b));}
ll exp(ll b,ll e,ll m){
    b%=m;
    ll ans = 1;
    for (; e; b = b * b % m, e /= 2)
        if (e & 1) ans = ans * b % m;
    return ans;
}

// debug:
void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T){
  cerr << ' ' << H;
  dbg_out(T...);
}
#ifdef LOCAL
#define dbg(...) cerr<<"(" << #__VA_ARGS__<<"):" , dbg_out(__VA_ARGS__) , cerr << endl
#else
#define dbg(...) 42
#endif
//

const int N = 500100;
vi g[N];
int p[N],sz[N];
int f(int x){return p[x] = (p[x]==x?x:f(p[x]));}
int comps=0;
void join(int a,int b){
	a=f(a),b=f(b);
	if(a==b)return;
	if(sz[a] > sz[b])swap(a,b);
	p[a]=b;
	sz[b]+=sz[a];
	comps--;
}
set<int> here[N];

int32_t main(){
    fastio;
	int n,m;
	cin >> n >> m;
	comps=n;
	rep(i,1,n+1)p[i]=i,sz[i]=1;
	rep(i,0,m){
		int a,b;
		char c;
		cin >> a >> b >> c;
		if(c == 'T')join(a,b);
		else{
			g[a].pb(b);
			g[b].pb(a);
		}
	}
	rep(i,1,n+1){
		here[f(i)].insert(f(i));
		for(auto to : g[i]){
			here[f(i)].insert(f(to));
		}
	}
	int res=0;
	rep(i,1,n+1)res+=(sz(here[f(i)]) == comps);
	cout << res << endl;
}

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