# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1072026 | Abito | The Ties That Guide Us (CEOI23_incursion) | C++17 | 197 ms | 17292 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 n,par[N],dp[N],a[N],sz[N];
vector<int> adj1[N],adj2[N];
bool vis[N];
void dfs1(int x,int p){
for (auto u:adj1[x]){
if (u==p) continue;
dfs1(u,x);
dp[x]|=dp[u];
}return;
}
void dfs2(int x,int p){
par[x]=p;
sz[x]=1;
for (auto u:adj2[x]){
if (u==p) continue;
dfs2(u,x);
sz[x]+=sz[u];
}return;
}
bool cmp(int x,int y){
return sz[x]>sz[y];
}
void dfs3(int x,int p){
if (!a[x]){
a[par[x]]=visit(par[x]);
dfs3(par[x],x);
return;
}
for (auto u:adj2[x]){
if (u==par[x] || u==p) continue;
a[u]=visit(u);
if (a[u]==0) visit(x);
else{
dfs3(u,x);
break;
}
}
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);
}
dp[safe]=1;
int r;
for (int i=1;i<=n;i++) if (adj1[i].size()==2) r=i;
dfs1(r,0);
vector<int> v;
for (int i=1;i<=n;i++) v.pb(dp[i]);
return v;
}
void locate(std::vector<std::pair<int, int>> F, int curr, int t) {
n=F.size()+1;
a[curr]=t;
for (auto u:F){
adj2[u.first].pb(u.second);
adj2[u.second].pb(u.first);
}
int r;
for (int i=1;i<=n;i++) if (adj2[i].size()==2) r=i;
dfs2(r,0);
for (int i=1;i<=n;i++) sort(adj2[i].begin(),adj2[i].end(),cmp);
dfs3(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... |