# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
384104 | peijar | Railway (BOI17_railway) | C++17 | 277 ms | 35168 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>
#define int long long
using namespace std;
const int MAXN = 1e5;
const int MAXP = 18;
int par[MAXP][MAXN];
int parEdge[MAXN];
int nbMarque[MAXN];
vector<pair<int, int>> adj[MAXN];
int delta[MAXN];
int depth[MAXN];
int t;
int tin[MAXN];
int nbSommets, nbDeputes, nbVoulu;
void dfs(int iNoeud, int iPere)
{
par[0][iNoeud] = iPere;
tin[iNoeud] = t++;
for (auto [iFrere, iArete] : adj[iNoeud])
if (iFrere != iPere)
{
parEdge[iFrere] = iArete;
depth[iFrere] = depth[iNoeud] + 1;
dfs(iFrere, iNoeud);
}
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |