# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1096934 | ivaziva | Monthly railway pass (LMIO18_menesinis_bilietas) | C++14 | 429 ms | 85816 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 MAXN 1000001
int n,m;
vector<int> adj[2][MAXN];
int komp[MAXN],siz[MAXN],tren=0;
bool pos[MAXN];
vector<int> koren;
set<int> komponente;
void dfs(int node)
{
pos[node]=true;komp[node]=tren;siz[tren]++;
for (int sled:adj[0][node])
{
if (pos[sled]==true) continue;
else dfs(sled);
}
}
void dfs1(int node)
{
pos[node]=true;
for (int sled:adj[1][node])
{
if (komp[sled]==komp[node]) continue;
else komponente.insert(komp[sled]);
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... |