제출 #1167188

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1167188		dragst	The Ties That Guide Us (CEOI23_incursion)	C++20	0 / 100	2041 ms	7064 KiB

incursion

#include <bits/stdc++.h>
#include "incursion.h"
using namespace std;

int h[50005], p[50005], l[50005], r[50005];
vector<int> adj[50005];

void dfs(int x)
{
    for (auto y: adj[x])
    {
        if (y!=p[x])
        {
            p[y]=x; l[x]=y;
            h[y]=h[x]+1;
            dfs(y);
        };
    };
}

vector<int> mark(vector<pair<int, int>> F, int safe)
{
    int n=1, i;
    for (auto p: F)
    {
        n=max(n, p.first);
        n=max(n, p.second);
        adj[p.first].push_back(p.second);
        adj[p.second].push_back(p.first);
    };
    for (i=1; i<=n; i++)
    {
        if (adj[i].size()==1) {break;};
    };
    h[i]=1;
    dfs(i);
    vector<int> T(n);
    while (h[safe]!=(n+1)/2)
    {
        if (h[safe]<=(n+1)/2) {T[safe-1]=1; safe=l[safe];}
        else {T[safe-1]=1; safe=p[safe];};
    };
    return T;
}

void locate(vector<pair<int, int>> F, int curr, int t)
{
    int n=1, i;
    for (auto p: F)
    {
        n=max(n, p.first);
        n=max(n, p.second);
        adj[p.first].push_back(p.second);
        adj[p.second].push_back(p.first);
    };
    for (i=1; i<=n; i++)
    {
        if (adj[i].size()==1) {break;};
    };
    h[i]=1;
    dfs(i);
    if (t==0)
    {
        if (h[curr]<=(n+1)/2)
        {
            do {curr=l[curr]; i=visit(curr);}
            while (i==0);
            do {curr=l[curr]; i=visit(curr);}
            while (h[curr]<n && i==1);
            if (i==1) {return;}
            else {curr=p[curr]; i=visit(curr); return;};
        }
        else
        {
            do {curr=p[curr]; i=visit(curr);}
            while (i==0);
            do {curr=p[curr]; i=visit(curr);}
            while (h[curr]>1 && i==1);
            if (i==1) {return;}
            else {curr=l[curr]; i=visit(curr); return;};
        };
    };
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 30
• Subtask 2: 0 / 30
• Subtask 3: 0 / 40