# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
13706 | progressive | Tropical Garden (IOI11_garden) | C++98 | 2866 ms | 35096 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<vector>
using namespace std;
#define MAXN 151000
vector<int> connexion[MAXN];
int destination[2*MAXN];
vector<int> revdest[2*MAXN];
int dist1[2*MAXN];
int dist2[2*MAXN];
bool vst1[2*MAXN];
bool vst2[2*MAXN];
int incycle1=0;
int incycle2=0;
int PP,NN;
void dfs1(int i,int l)
{
if(i==PP && vst1[i]) incycle1=l;
if(vst1[i]) return ;
vst1[i]=true;
dist1[i]=l;
for(int x=0;x<revdest[i].size();x++)
dfs1(revdest[i][x],l+1);
return;
}
void dfs2(int i,int l)
{
if(i==PP+NN && vst2[i]) incycle2=l;
if(vst2[i]) return;
vst2[i]=true;
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... |