제출 #1290362

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1290362		cmnikolas	Inside information (BOI21_servers)	C++20	0 / 100	136 ms	2108 KiB

servers

#include <iostream>
#include <vector>

void dfs(int start, int goal, bool &found, std::vector<std::vector<int>> &A, std::vector<int> &visited) {
	if(visited[start] || found) return;
	visited[start] = true;

	if(start == goal)
	{
		found = true;
		return;
	}

	for(auto a : A[start])
	{
		if(!visited[a])
			dfs(a, goal, found, A, visited);
	}
}

int main()
{
	int N, K;
	std::cin >> N >> K;
	std::vector<std::vector<int>> A(N + 1);
	char t;

	for(int i = 0; i < N + K - 1; i++)
	{
		std::cin >> t;
		if(t == 'S')
		{
			int a, b;
			std::cin >> a >> b;
			A[a].push_back(b);
			A[b].push_back(a);
		}
		else if (t == 'Q')
		{
			int a, d;
			std::cin >> a >> d;
			std::vector<int> visited(N + 1, false);
			bool found = false;
			dfs(a, d, found, A, visited);
			if(found)
			    std::cout << "yes" << std::endl;
			else
			    std::cout << "no" << std::endl;
		}
	}

	return 0;
}

• Subtask 1-1: 0 / 2
• Subtask 1-2: 0 / 3
• Subtask 2-1: 0 / 2
• Subtask 2-2: 0 / 3
• Subtask 3-1: 0 / 5
• Subtask 3-2: 0 / 5
• Subtask 4-1: 0 / 10
• Subtask 4-2: 0 / 10
• Subtask 5-1: 0 / 12
• Subtask 5-2: 0 / 13
• Subtask 6-1: 0 / 17
• Subtask 6-2: 0 / 18