제출 #1284249

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1284249		muhammad-ahmad	The Ties That Guide Us (CEOI23_incursion)	C++20	9 / 100	155 ms	5360 KiB

incursion

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

const int NN = 5e4;
vector<int> adj[NN];
int dist[NN];

void dfs(int u, int p){
	dist[u] = dist[p] + 1;
	for (auto i : adj[u]){
		if (i != p) dfs(i, u);
	}
}

vector<int> mark(vector<pair<int, int>> F, int safe){
	int n = F.size() + 1;
	for (auto [u, v] : F){
		adj[u].push_back(v);
		adj[v].push_back(u);
	}
	dist[0] = -1;
	dfs(safe, 0);
	
	vector<int> ans;
	for (int i = 1; i <= n; i++){
		ans.push_back(dist[i]);
	}
	
	return ans;
	
}

void locate(vector<pair<int, int>> F, int curr, int t) {
	int n = F.size() + 1;
	for (auto [u, v] : F){
		adj[u].push_back(v);
		adj[v].push_back(u);
	}
	int lst = 0;
	while (t != 0){
		int tans = 0, temp = 0;
		for (auto i : adj[curr]){
			if (i == lst) continue;
			int temp1 = visit(i);
			if (temp1 < t){
				lst = curr;
				curr = i;
				t = temp1;
				break;
			}
			else {
				visit(curr);
			}
		}
	}
	return;
}

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