# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
115246 | IOrtroiii | Mousetrap (CEOI17_mousetrap) | C++14 | 1278 ms | 186108 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 <bits/stdc++.h>
using namespace std;
const int N = 1000100;
int n, t, m;
vector<int> g[N];
vector<int> vals[N];
vector<int> tour;
bool on[N];
int pref[N];
bool dfs(int u, int p, int to) {
tour.push_back(u);
if (u == to) return true;
for (int v : g[u]) {
if (v != p) {
if (dfs(v, u, to)) {
return true;
}
}
}
tour.pop_back();
return false;
}
int dfs2(int u, int p) {
vector<int> vals;
for (int v : g[u]) {
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... |