# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
321991 | ThaiBaHung | Railway (BOI17_railway) | C++14 | 419 ms | 35684 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;
const int N = 1e5 + 3;
int n, m, k;
vector < int > adj[N];
struct E
{
int id;
int u;
int v;
};
E edge[N];
int numchain;
int ChainId[N];
int ChainHead[N];
int cha[N];
int P[N][30];
int pos[N];
int dinh[N];
int socon[N];
int dem = 0;
int depth[N];
int vs[N];
pair < int, int > point[N];
int pre[N];
void dfs(int i, int j)
{
socon[i] = 1;
# | 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... |