# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
161420 | Minnakhmetov | Mousetrap (CEOI17_mousetrap) | C++14 | 1319 ms | 219628 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>
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()
using namespace std;
const int N = 1e6 + 5, INF = 1e9;
vector<int> g[N];
int n, m, t;
bool term[N];
vector<vector<int>> w;
void dive(int node, int anc) {
if (node == t)
term[node] = 1;
for (int to : g[node]) {
if (to != anc) {
dive(to, node);
if (term[to])
term[node] = 1;
}
}
}
int dfs(int node, int anc) {
int adj = g[node].size() - (anc != -1);
vector<int> v;
# | 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... |