# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
7513 | Namnamseo | Tropical Garden (IOI11_garden) | C++98 | 2786 ms | 12136 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"
int befnext[150010][2];
int next[300010];
int nc [300010];
int p;
void addEdge(int a,int b)
{
if(nc[a]<2)
{
befnext[a][nc[a]]=b;
nc[a]++;
}
if(nc[b]<2)
{
befnext[b][nc[b]]=a;
nc[b]++;
}
}
int visit [300010];
int dists [300010];
int pdist [300010][2];
int loops [300010][2];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |