# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
851744 | 12345678 | Tropical Garden (IOI11_garden) | C++17 | 4499 ms | 41464 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 "garden.h"
#include "gardenlib.h"
#include "bits/stdc++.h"
using namespace std;
const int nx=3e5+100;
int ds[nx], dss[nx], c=INT_MAX, cs=INT_MAX, ans, n, p, v[nx], vs[nx];
bool vs1[2*nx], vs2[2*nx];
vector<int> d[2*nx];
void dfs(int u, int s)
{
if (vs1[u]) return;
vs1[u]=1; ds[u]=s;
for (auto v:d[u])
{
if (v==p) c=s+1;
else dfs(v, s+1);
}
}
void dfs2(int u, int s)
{
if (vs2[u]) return;
vs2[u]=1; dss[u]=s;
for (auto v:d[u])
{
if (v==p+n) cs=s+1;
else dfs2(v, s+1);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |