# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
24887 | Hiasat | Tropical Garden (IOI11_garden) | C++14 | 3549 ms | 47016 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;
typedef pair<int, int> pii;
const int MX = 200011;
vector<int> adj[MX * 2], g[MX * 2];
int F[MX * 2][2], c[2];
void connect(int u , int v, int N) {
if (adj[u][0] == v || adj[u][0] == v - N)
u = u + N;
//cout << "CONNECT " << u << " " << v << endl;
g[u].push_back(v);
}
void dfs(int u , int p, int it) {
for (int i = 0; i < g[u].size(); ++i) {
int v = g[u][i];
if (v == p) {
c[it] = F[u][it] + 1;
} else if (F[v][it] == -1) {
F[v][it] = F[u][it] + 1;
dfs(g[u][i], p, it);
}
}
}
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... |