# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1096227 | win_23 | Railway (BOI17_railway) | C++17 | 66 ms | 29516 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 TASK "SUADUONG"
#define fi first
#define se second
#define pb push_back
#define ll long long
#define ii pair< int,int >
#define endl '\n'
const int INF = 1e9;
const ll LINF = 1e18;
const int N = 1e5 +5;
int n, m;
vector<int> adj[N + 5];
int up[N][20], h[N], f[N];
// up[u][i] là tổ tiên thứ 2^i của u
int k;
int x[N], y[N];
namespace sub{
void dfs(int u, int par)
{
for(auto v : adj[u])
{
if(v == par) continue;
up[v][0] = u;
# | 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... |