# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1173393 | duonggsimp | Railway (BOI17_railway) | C++20 | 129 ms | 48836 KiB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> ii;
typedef pair<ll, ii> iii;
#define pb push_back
#define fi first
#define se second
#define endl '\n'
#define MOD 1000000000
#define MASK(i) (1ll << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
ll n,m,k;
ll cnt;
ll c[100005];
ll h[100005];
ll f[100005];
ll tin[100005];
ll par[100005][20];
vector <ll> a[100005];
vector <ll> res;
map <ii,ll> mp;
void dfs(ll x,ll p){
tin[x] = ++cnt;
for (ll i : a[x]){
if (i == p) continue;
h[i] = h[x] + 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... |