# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1159731 | mnbvcxz123 | Putovanje (COCI20_putovanje) | C++20 | 67 ms | 23624 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ln '\n'
#define all(x) x.begin(), x.end()
#define forn(i, n) for(int i = 0; i < n; i++)
#define forab(i, a, b) for (int i = a; i < b; i++)
#define pb push_back
#define sz(x) int(x.size())
#ifdef LOCAL
#include "debug.h"
#else
#define dbg(...)
#endif
typedef long long ll;
const int MAXN = 2e5 + 5;
const int LOG = log2(MAXN) + 1;
vector<int> g[MAXN];
int up[MAXN][LOG];
int deep[MAXN];
int pf[MAXN];
void dfs(int u, int p){
deep[u] = deep[p] + 1;
up[u][0] = p;
forab(k, 1, LOG){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |