# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
282028 | JoMee | Railway (BOI17_railway) | C++17 | 1093 ms | 79524 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 int long long
using namespace std;
#define rep(i,a,n) for(int i = a; i<n; i++)
#define per(i,a,n) for(int i = n-1; i>=a; i--)
int max(int a,int b){return (a>b)?a:b;}
int min(int a,int b){return (a<b)?a:b;}
vector<int> adj[100005];
int par[20][100005], szs[100005], depth[100005];
set<int> start[100005];
set<int> out[100005];
pair<int,int> edges[100005];
void dfs(int e,int p){
par[0][e] = p;
depth[e] = depth[p]+1;
for(int j:adj[e]){
if(j != p)dfs(j,e);
}
}
set<int>* smldfs(int i,int p){
set<int>* ret = new set<int>(start[i].begin(),start[i].end());
for(auto e:adj[i]){
if(e != p){
set<int>* v = smldfs(e,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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |