Submission #961914

#TimeUsernameProblemLanguageResultExecution timeMemory
961914IrateMonthly railway pass (LMIO18_menesinis_bilietas)C++17
10 / 100
166 ms23700 KiB
#include <bits/stdc++.h> using namespace std; const int mxN = 5e5 + 5; struct DSU{ vector<int>par; int comps; DSU(int n){ par.assign(n + 1, -1); comps = n; } int FindRep(int u){ if(par[u] < 0)return u; return par[u] = FindRep(par[u]); } void Union(int u, int v){ u = FindRep(u); v = FindRep(v); if(u == v)return; if(par[u] > par[v])swap(u, v); par[u] += par[v]; par[v] = u; comps--; } }; vector<int> G[mxN]; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); int n, m; cin >> n >> m; int cnt = 0; /// A - bus, T - train DSU dsu(n); for(int i = 0;i < m;++i){ int u, v; char c; cin >> u >> v >> c; cnt += (c == 'A'); dsu.Union(u, v); G[u].push_back(v); G[v].push_back(u); } if(dsu.comps != 1){ cout << 0 << '\n'; } else if(cnt == 0){ cout << n << '\n'; } else if(n == 2){ cout << 2 << '\n'; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...