# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1098839 | AliHasanli | Monthly railway pass (LMIO18_menesinis_bilietas) | C++17 | 668 ms | 51380 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;
vector< pair < char,pair < int,int > > > edges;
vector<int>g[500001],g2[500001];
int vst[500001];
void dfs(int node,int p,int col)
{
vst[node]=col;
for(int go:g[node])
if(go!=p && vst[go]==0)
dfs(go,node,col);
}
bool selected[500001];
int main()
{
int v,e,comp=0;
cin>>v>>e;
while(e--)
{
char c;
int a,b;
cin>>a>>b>>c;
edges.push_back({c,{a,b}});
}
//sort(edges.begin(),edges.end());
for(int i=edges.size()-1;i>=0;i--)
{
if(edges[i].first=='T')
{
g[edges[i].second.first].push_back(edges[i].second.second);
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... |