# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
24881 | Hiasat | Tropical Garden (IOI11_garden) | C++14 | 215 ms | 34116 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 = 150011;
vector<int> adj[MX * 2], g[MX * 2];
int need[MX * 2][2];
void connect(int u , int v, int N) {
if (adj[u][0] == v || adj[u][0] == v - N)
u = u + N;
g[u].push_back(v);
}
void dfs(int u , int cost, int it) {
if (need[u][it] != -1)
return;
if (cost)
need[u][it] = cost;
for (int i = 0; i < g[u].size(); ++i) {
dfs(g[u][i], cost + 1, it);
}
}
void count_routes(int N, int M, int P, int R[][2], int Q, int G[]) {
memset(need, -1, sizeof need);
for (int i = 0; i < M; ++i) {
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... |