# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1139967 | c32ardash | Monthly railway pass (LMIO18_menesinis_bilietas) | C++20 | 265 ms | 65652 KiB |
#include <bits/stdc++.h>
using namespace std;
const int NMAX=5e5+5;
vector<int> adjt[NMAX], adja[NMAX], cc[NMAX];
int ntc[NMAX], viz[NMAX], nviz=1, ncc, n, m;
void DFS(int u)
{
ntc[u]=ncc;
cc[ncc].push_back(u);
viz[u]=1;
for(auto v:adjt[u])
if(viz[v]!=1)
DFS(v);
}
int main()
{
cin>>n>>m;
for(int i=1;i<=m;i++)
{
int u, v;
char ch;
cin>>u>>v>>ch;
if(ch=='T')
{
adjt[u].push_back(v);
adjt[v].push_back(u);
# | 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... |