Submission #128896

#	Time	Username	Problem	Language	Result	Execution time	Memory
128896		Kerim	Werewolf (IOI18_werewolf)	C++17	0 / 100	4050 ms	38772 KiB

werewolf

#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
int n,m,q,ata[MAXN];
int tap(int x){
	if(ata[x]==x)
		return x;
	return ata[x]=tap(ata[x]);	
}
vector<int>adj[MAXN][2],a[MAXN],b[MAXN];
int vis[MAXN][2],par[MAXN][2];
void dfs(int nd,int t){
	vis[nd][t]=1;
	tr(it,adj[nd][t])
		dfs(*it,t);	
}
void print(int nd,int t){
	tr(it,adj[nd][t]){
		cout<<nd<<"->"<<*it<<endl;	
		print(*it,t);
	}
}
vector<int>check_validity(int N, vector<int> X, vector<int> Y, vector<int> S, vector<int> E,vector<int> L, vector<int> R) {
	q=S.size();n=N;m=X.size();
	for(int i=0;i<m;i++){
		int u=X[i]+1,v=Y[i]+1;
		if(u>v)
			swap(u,v);
		a[u].pb(v);b[v].pb(u);
	}
	for(int i=1;i<=n;i++)
		ata[i]=i;
	for(int i=1;i<=n;i++)
		tr(it,b[i])
			if(tap(*it)!=i){
				adj[i][0].pb(tap(*it));
				par[tap(*it)][0]=i;
				ata[tap(*it)]=i;
			}	
	for(int i=1;i<=n;i++)
		ata[i]=i;
	for(int i=n;i>=1;i--)
		tr(it,a[i])
			if(tap(*it)!=i){
				adj[i][1].pb(tap(*it));
				par[tap(*it)][1]=i;
				ata[tap(*it)]=i;
			}	
	vector<int>ans(q);			
	for(int i=0;i<q;i++){
		int s=S[i]+1,e=E[i]+1,l=L[i]+1,r=R[i]+1;
		while(par[s][1]>=l)
			s=par[s][1];
		while(par[e][0]<=r)
			e=par[e][0];
		dfs(e,0);dfs(s,1);
		for(int j=1;j<=n;j++){
			if(vis[j][0]&vis[j][1])
				ans[i]=1;
			vis[j][0]=vis[j][1]=0;				
		}
	}
	return ans;
}

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