# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1139731 | tone_alexandru | Monthly railway pass (LMIO18_menesinis_bilietas) | C++20 | 3093 ms | 27128 KiB |
#include <bits/stdc++.h>
using namespace std;
vector<pair<int, char>> adj[500005];
queue<int> q;
int minim[500005];
signed main()
{
int n, m, cntt = 0, cnta = 0;
cin>>n>>m;
int a, b;
char type;
for(int i=0; i<m; i++)
{
cin>>a>>b>>type;
if(type == 'A') cnta ++;
if(type == 'T') cntt ++;
adj[a].push_back({b, type});
adj[b].push_back({a, type});
}
if(cntt == m) cout<<n;
else if(cntt == n)
{
int cnt = 0;
for(int i=1; i<=n; i++)
# | 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... |