Submission #379327

#	Time	Username	Problem	Language	Result	Execution time	Memory
379327		autumn_eel	Werewolf (IOI18_werewolf)	C++14	15 / 100	4046 ms	16048 KiB

werewolf

#include "werewolf.h"
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;

struct UnionFind{
	vector<int>par;
	UnionFind(int n){
		par=vector<int>(n);
		rep(i,n)par[i]=i;
	}
	int find(int x){
		return par[x]==x?x:par[x]=find(par[x]);
	}
	void unite(int x,int y){
		x=find(x);y=find(y);
		par[y]=x;
	}
	bool same(int x,int y){
		return find(x)==find(y);
	}
};

std::vector<int> check_validity(int N, std::vector<int> X, std::vector<int> Y,
                                std::vector<int> S, std::vector<int> E,
                                std::vector<int> L, std::vector<int> R) {
	int M=X.size();
	int Q=S.size();
	vector<int>ans;
	rep(i,Q){
		UnionFind uf1(N),uf2(N);
		rep(j,M){
			if(X[j]>=L[i]&&Y[j]>=L[i])uf1.unite(X[j],Y[j]);
			if(X[j]<=R[i]&&Y[j]<=R[i])uf2.unite(X[j],Y[j]);
		}
		bool ok=false;
		rep(j,N){
			if(uf1.same(S[i],j)&&uf2.same(E[i],j)){
				ok=true;break;
			}
		}
		ans.push_back(ok);
	}
	return ans;
}

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