# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
920874 | gelastropod | Monthly railway pass (LMIO18_menesinis_bilietas) | C++14 | 404 ms | 32884 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;
#define int long long
signed main()
{
int N, M, a, b, ans = 0;
cin >> N >> M;
char t;
bool is1 = true, is2 = true;
vector<vector<pair<int, bool>>> adjlist(N, vector<pair<int, bool>>());
for (int i = 0; i < M; i++)
{
cin >> a >> b >> t;
a--, b--;
adjlist[a].push_back(pair<int, int>(b, t == 'A'));
adjlist[b].push_back(pair<int, int>(a, t == 'A'));
if (t == 'A') is1 = false;
if (t == 'T') is2 = false;
}
queue<int> bfs;
vector<bool> visited(N, false);
bfs.push(0);
visited[0] = true;
while (!bfs.empty())
{
int i = bfs.front();
bfs.pop();
for (auto j : adjlist[i])
if (!visited[j.first])
# | 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... |