# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
884033 | mihtriii295 | Putovanje (COCI20_putovanje) | C++17 | 113 ms | 54376 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;
/* Code by Nguyen Minh Tri (mihtriii) 12TT THPT Chuyen Ben Tre */
#define ll long long
#define el cout << '\n'
const ll MOD = 998244353;
const ll N = 2e5 + 10000;
#define TIME (1.0 * clock() / CLOCKS_PER_SEC)
ll a[N], b[N], c[N], d[N], h[N], res, par[20][N], n, f[N], fin[N];
vector<ll> adj[N];
map<pair<ll, ll>, ll> mp;
void DFS(ll u, ll p){
for (ll v : adj[u]){
if (v == p) continue;
par[0][v] = u;
h[v] = h[u] + 1;
for (ll i = 1; i <= 17; ++i)
par[i][v] = par[i - 1][par[i - 1][v]];
DFS(v, u);
}
}
void DFSin(ll u, ll p){
fin[u] = f[u];
for (ll v : adj[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... |