제출 #313888

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
313888		tengiz05	Werewolf (IOI18_werewolf)	C++17	0 / 100	227 ms	19832 KiB

werewolf

#include "werewolf.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 5e3+5;
int n, m, target, l,r;
vector<int> edges[N];
int dp[N];
bool used[N];
vector<int> check_validity(int N, vector<int> X, vector<int> Y, vector<int> S, vector<int> E, vector<int> L, vector<int> R) {
	n = N;
	m = X.size();
	for(int i=0;i<m;i++){
		edges[X[i]].push_back(Y[i]);
		edges[Y[i]].push_back(X[i]);
	}
	
	int Q = S.size();
	vector<int> ans;
	for(int i=0;i<Q;i++){
		memset(dp, -1, sizeof(dp));
		memset(used, 0, sizeof(used));
		l = L[i], r = R[i];
		if(S[i] < l)ans.push_back(0);
		else {
			memset(used, 0, sizeof(used));
			queue<tuple<int,int,int>> q; // {form, u, isch};
			q.push({0, S[i], (S[i]>=l&&S[i]<=r)?1:0});
			used[S[i]] = true;
			int ok = 0;
			while(!q.empty()){
				int u, f, is;
				tie(f, u, is) = q.front();q.pop();
			//	cout << u << ' ' << f << ' ' << is << '\n';
				if(u == E[i]){
					ok = 1;
					break;
				}
				for(auto v : edges[u]){
					if(used[v] || (f && v>r) || (!is && !f && v<l))continue;
					used[v] = true;
					if(v < l)q.push({1, v, 0});
					else if(f)q.push({f, v, 0});
					else q.push({0, v, (v>=l&&v<=r)?1:is});
				}
			}//cout << '\n';
			ans.push_back(ok);
		}
	}return ans;
}

/*

6 6 3
5 1
1 2
1 3
3 4
3 0
5 2
4 2 1 2
4 2 2 2
5 4 3 4

*/

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