# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
473460 | fadi57 | Railway (BOI17_railway) | C++14 | 411 ms | 66748 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 mx=1e5+10;
typedef long long ll;
int mod=1e9+7;
const int MXm=22;
#define F first
#define S second
const int inf=1e9+10;
vector<int>adj[mx];
vector<pair<int,int>>edges;vector<int>ans;
int n,m,k;
int depth[mx],dp[20][mx],sz[mx], active[mx];
set<int>S[mx];
vector<int>E[mx];
map<pair<int,int>,int>mp;
vector<int>vec[mx];
void dfs(int node,int par){
dp[0][node]=par;
sz[node]=1;
for(int j=1;j<19;j++){
dp[j][node]=dp[j-1][dp[j-1][node]];
}
for(auto it:adj[node]){
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... |