# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
571675 | MODDI | Monthly railway pass (LMIO18_menesinis_bilietas) | C++14 | 3070 ms | 55568 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>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vi vector<int>
#define vl vector<ll>
#define mp make_pair
#define pb push_back
using namespace std;
int n, m;
vi train[500010], bus[500010];
int main(){
cin>>n>>m;
for(int i = 0; i < m; i++){
int a, b;
char tip;
cin>>a>>b>>tip;
a--; b--;
if(tip == 'T')
{
train[a].pb(b);
train[b].pb(a);
}
else{
bus[a].pb(b);
bus[b].pb(a);
}
}
int rez =0;
for(int i = 0; i < n; i++){
queue<pii> q;
q.push(mp(i, 0));
bool vis[n];
memset(vis, false, sizeof(vis));
vis[i] = true;
set<int> city;
while(!q.empty()){
int at = q.front().first;
int take = q.front().second;
city.insert(at);
q.pop();
for(auto next : train[at]){
if(!vis[next]){
vis[next] = true;
q.push(mp(next, take));
}
}
if(take == 0){
for(auto next : bus[at]){
if(!vis[next]){
vis[next] = true;
q.push(mp(next, 1));
}
}
}
}
if(city.size() == n){
rez = i;
break;
}
}
cout<<rez+1<<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... |