# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
61764 | CaQtiml | 열대 식물원 (Tropical Garden) (IOI11_garden) | C++14 | 0 ms | 0 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 <algorithm>
#include <iostream>
#include <cassert>
#include <vector>
#include <cstring>
#include <cstdio>
#define QMAX 2010
#define NMAX 150010
#define INF (1e9)
using namespace std;
int best[NMAX][2];
int deg[NMAX];
int out[NMAX*2];
vector<int> in[NMAX*2];
int dist[2][NMAX*2];
int N,M,P,len[2],src;
int visited[NMAX*2];
void dfs(int v){
visited[v] = 1;
int i,u;