# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
52525 | BrunoPloumhans | Amusement Park (JOI17_amusement_park) | C++14 | 43 ms | 5992 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 <bits/stdc++.h>
using namespace std;
#define int long long
static vector<vector<int>> adj;
static int tim;
static vector<int> ts;
static vector<int> path;
static void dfs(int u) {
ts[u] = tim++;
path.push_back(u);
for(int v : adj[u]) {
if(ts[v] == -1) {
dfs(v);
path.push_back(u);
}
}
}
static void find_tree(int n, int m, signed A[], signed B[]) {
adj.assign(n, vector<int>());
path.clear();
tim = 0;
for(int i = 0; i < m; ++i) {
adj[A[i]].push_back(B[i]);
adj[B[i]].push_back(A[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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |