# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
706611 | YugiHacker | Putovanje (COCI20_putovanje) | C++14 | 88 ms | 24048 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>
#define el cout<<"\n"
#define f0(i,n) for(int i=0;i<n;++i)
#define f1(i,n) for(int i=1;i<=n;++i)
#define maxn 200005
using namespace std;
int n, lg;
int p[20][maxn], d[maxn], f[maxn];
struct edge
{
int v, c1, c2;
};
vector <edge> a[maxn];
void dfs(int u, int par)
{
for (auto e:a[u])
{
int v = e.v;
if (v!=par)
{
p[0][v] = u;
d[v] = d[u]+1;
dfs(v, u);
}
}
}
void rmq()
{
for (int i=1; i<=lg; i++)
for (int j=1; j<=n; j++)
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... |