# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
639614 | Sofiatpc | Monthly railway pass (LMIO18_menesinis_bilietas) | C++14 | 3090 ms | 37364 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 pb push_back
#define fi first
#define sc second
const int MAXN = 500005;
vector< pair<int,int> > adj[MAXN];
int qtd[MAXN], visQtd;
void dfs(int S, int o)
{
if(qtd[S]==-1)visQtd++;
qtd[S]=o;
for(int i = 0; i < (int)adj[S].size(); i++)
{
int viz = adj[S][i].fi, tipo = adj[S][i].sc;
if(qtd[viz]>=qtd[S])continue;
if(tipo==1)
{
if(o==0)continue;
dfs(viz,0);
}
else dfs(viz,o);
}
return;
}
# | 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... |