# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
642995 | CyberSleeper | Monthly railway pass (LMIO18_menesinis_bilietas) | C++17 | 666 ms | 102912 KiB |
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;
const int MX=500007;
int N, M, group[MX], sz[MX], cnt_group, ans;
vector<int> bus[MX], tr[MX];
set<int> adj[MX];
void DFS(int x){
group[x]=cnt_group;
sz[cnt_group]++;
for(int i:tr[x]){
if(group[i])
continue;
DFS(i);
}
}
int main(){
cin >> N >> M;
for(int i=0; i<M; i++){
int u, v;
char w;
cin >> u >> v >> w;
if(u == v)
continue;
if(w == 'A'){
bus[u].push_back(v);
bus[v].push_back(u);
}else{
tr[u].push_back(v);
tr[v].push_back(u);
}
}
for(int i=1; i<=N; i++){
if(!group[i]){
cnt_group++;
DFS(i);
}
}
for(int i=1; i<=N; i++){
for(int j:bus[i]){
if(group[i] != group[j])
adj[group[i]].insert(group[j]);
}
}
for(int i=1; i<=N; i++){
if(adj[i].size()==cnt_group-1)
ans+=sz[i];
}
cout << ans << endl;
}
Compilation message (stderr)
# | 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... |