# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
341591 | KoD | Amusement Park (JOI17_amusement_park) | C++17 | 280 ms | 9968 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 "Joi.h"
#include <vector>
#include <queue>
#include <array>
#include <iostream>
namespace {
template <class T>
using Vec = std::vector<T>;
Vec<Vec<int>> graph;
Vec<bool> seen;
Vec<Vec<int>> tree;
Vec<int> order;
Vec<int> parent;
Vec<int> group_id;
Vec<int> label;
Vec<Vec<int>> groups;
void construct(const int u, const int p) {
order.push_back(u);
parent[u] = p;
for (const auto v: graph[u]) {
if (!seen[v]) {
seen[v] = true;
tree[u].push_back(v);
tree[v].push_back(u);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |