# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1162390 | DangKhoizzzz | Railway (BOI17_railway) | C++20 | 149 ms | 59640 KiB |
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define pii pair <int , int>
#define arr3 array <int , 3>
using namespace std;
const int INF = 1e18 + 7;
const int maxn = 1e5 + 7;
int n , m , k , jump[maxn][20] , depth[maxn];
map <pii , int> ind;
vector <int> g[maxn];
vector <int> del[maxn];
vector <int> add[maxn];
vector <int> ans;
void dfsbuild(int u , int p)
{
for(int v: g[u])
{
if(v == p) continue;
jump[v][0] = u;
depth[v] = depth[u] + 1;
dfsbuild(v , u);
}
}
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... |