# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
823609 | danitro | Putovanje (COCI20_putovanje) | C++14 | 980 ms | 77940 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 MAX 410000
long long n, par[25][MAX], first[MAX], last[MAX], tym, br[25][MAX], tree[MAX * 2], lazy[MAX * 2];
map<pair<int, int>, long long > mp;
long long ans;
vector <int> gr[MAX];
bool used[MAX];
struct edge
{
long long a, b, c, d;
} e[MAX];
void dfs(int v, int pr)
{
used[v] = true;
first[v] = ++tym;
par[0][v] = pr;
for(int i = 1; i < 25; i++)
{
par[i][v] = par[i - 1][par[i - 1][v]];
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... |