# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1071967 | Abito | The Ties That Guide Us (CEOI23_incursion) | C++17 | 260 ms | 12172 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>
#include "incursion.h"
#define pb push_back
using namespace std;
const int N=5e4+5;
int dis1[N],dis2[N],n;
vector<int> adj2[N],adj1[N];
bool found;
void dfs1(int x,int p){
for (auto u:adj1[x]){
if (u==p) continue;
dis1[u]=dis1[x]+1;
dfs1(u,x);
}return;
}
void dfs2(int x,int p){
//cout<<x<<' '<<p<<endl;
if (dis2[x]==0){
found=1;
return;
}
for (auto u:adj2[x]){
if (u==p) continue;
dis2[u]=visit(u);
if (dis2[u]==0){
found=1;
return;
}
if (dis2[u]>dis2[x]) visit(x);
else{
dfs2(u,x);
return;
}
}
return;
}
std::vector<int> mark(std::vector<std::pair<int, int>> F, int safe) {
n=F.size()+1;
for (auto u:F){
adj1[u.first].pb(u.second);
adj1[u.second].pb(u.first);
}
dfs1(safe,0);
vector<int> v;
for (int i=1;i<=n;i++) v.pb(dis1[i]);
return v;
}
void locate(std::vector<std::pair<int, int>> F, int curr, int t) {
n=F.size()+1;
dis2[curr]=t;
for (auto u:F){
adj2[u.first].pb(u.second);
adj2[u.second].pb(u.first);
}
dfs2(curr,0);
return;
}
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... |