제출 #602358

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
602358		jairRS	늑대인간 (IOI18_werewolf)	C++17	0 / 100	4094 ms	28200 KiB

werewolf

#include "werewolf.h"
#include "bits/stdc++.h"
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;

const int INF = 1e9;
vvi adj;

void dfsHuman(int src, vector<bool> &reachable, int L)
{
	if (src < L)
		return;
	reachable[src] = true;

	for (int a : adj[src])
	{
		if (reachable[a])
			continue;
		dfsHuman(a, reachable, L);
	}
}

void dfsWolf(int src, vector<bool> &reachable, int R)
{
	if (src > R)
		return;
	reachable[src] = true;

	for (int a : adj[src])
	{
		if (reachable[a])
			continue;
		dfsHuman(a, reachable, R);
	}
}

vi check_validity(int N, vi X, vi Y, vi S, vi E, vi L, vi R)
{
	adj = vvi(N);
	for (int i = 0; i < N; i++)
	{
		adj[X[i]].push_back(Y[i]);
		adj[Y[i]].push_back(X[i]);
	}

	int Q = S.size();
	vi ans(Q, false);
	for (int i = 0; i < Q; i++)
	{
		vector<bool> reachableHuman(N, false);
		dfsHuman(S[i], reachableHuman, L[i]);
		vector<bool> reachableWolf(N, false);
		dfsWolf(E[i], reachableWolf, R[i]);
		for (int a = L[i]; a <= R[i]; a++)
			ans[i] |= (reachableHuman[a] && reachableWolf[a]);
	}

	return ans;
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 8
• Subtask 3: 0 / 34
• Subtask 4: 0 / 51