# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
743550 | lukadupli | Torrent (COI16_torrent) | C++14 | 613 ms | 25800 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 MAXN = 3e5 + 5;
int n, a, b, xe, ye;
vector<int> adj[MAXN];
int dfs(int node, int parent = -1){
int res = 0;
vector<int> v;
for(int nxt : adj[node]){
if(nxt != parent &&
(min(xe, ye) != min(node, nxt) || max(xe, ye) != max(node, nxt))) v.push_back(dfs(nxt, node));
}
sort(v.begin(), v.end(), greater<int>());
for(int i = 0; i < v.size(); i++) res = max(res, v[i] + i + 1);
return res;
}
vector<int> path;
bool found = 0;
void dfs2(int node, int parent = -1){
path.push_back(node);
if(node == b){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |