# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
122968 | CaroLinda | 열대 식물원 (Tropical Garden) (IOI11_garden) | C++14 | 3708 ms | 21072 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>
#include "gardenlib.h"
#include "garden.h"
#define lp(i,a,b) for(int i=a;i<b;i++)
#define pii pair<int,int>
#define ff first
#define ss second
#define pb push_back
const int MAXN = 15e4+10;
const int MAXM = 15e4+10 ;
const int MAXQ = 2005 ;
const int inf=0x3f3f3f3f ;
using namespace std;
int p ;
int graph[MAXN*2] ;
vector<int> v[MAXN] ;
bool marc[MAXN*2][2] ;
int checking,d[MAXN*2][2] ;
void dfs(int x, int y)
{
if(marc[x][y]) return ;
marc[x][y] = 1 ;
dfs(graph[x],y) ;
if(x!=2*p+y)
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... |