# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
294266 | dCoding | Torrent (COI16_torrent) | C++14 | 611 ms | 19448 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;
#define F first
#define S second
const int MAXN = 3e5+5;
vector<pair<int,int>> path, temp;
vector<int> adj[MAXN];
int n,a,b;
pair<int,int> curEdge;
void dfs(int node, int p) {
if(!path.empty()) return;
if(node == b) {
path = temp;
return;
}
for(auto& u:adj[node]) {
if(u == p) continue;
temp.push_back({u,node});
dfs(u,node);
temp.pop_back();
}
}
int dfs1(int node, int p) {
int res = 0;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |