# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
148107 | WhipppedCream | Railway (BOI17_railway) | C++17 | 353 ms | 24336 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 ii pair<int, int>
#define X first
#define Y second
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define vii vector< pair<int, int> >
typedef long long ll;
using namespace std;
vii adj[100005];
vi tour;
int dat[100005];
int h[100005];
int dp[25][100005];
int marc[100005];
int toPar[100005];
int in[100005];
bool cmp(int a, int b)
{
return dat[a] < dat[b];
}
void dfs(int u, int p)
{
dat[u] = (int) tour.size();
tour.pb(u);
dp[0][u] = p;
for(auto kk : adj[u])
{
int v = kk.X;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |