# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
409875 | Ahmad_Hasan | Swapping Cities (APIO20_swap) | C++17 | 2091 ms | 291352 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;
vector<vector<pair<int,int> > >adj;
vector<vector<int> >par,dis,mn;
vector<int>dep;
vector<vector<int> >mnaf;
int dfs(int cr=0,int pr=-1,int d=-1,int m=INT_MAX){
par[cr][0]=pr;
for(int i=1;i<30;i++){
if(par[cr][i-1]==-1)break;
par[cr][i]=par[par[cr][i-1]][i-1];
}
dis[cr][0]=d;
for(int i=1;i<30;i++){
if(par[cr][i-1]==-1)break;
dis[cr][i]=dis[par[cr][i-1]][i-1];
}
mn[cr][0]=m;
for(int i=1;i<30;i++){
if(par[cr][i-1]==-1)break;
mn[cr][i]=mn[par[cr][i-1]][i-1];
}
if(pr==-1)dep[cr]=0;
else dep[cr]=dep[pr]+1;
for(int i=0;i<adj[cr].size();i++){
if(adj[cr][i].first!=pr){
if(adj[cr][i].second<mnaf[cr][0]){
mnaf[cr][1]=mnaf[cr][0];
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... |