oj.uz

답안 #553241

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
553241 2022-04-25T07:34:13 Z jamezzz 늑대인간 (IOI18_werewolf) C++17
100 / 100
 906 ms 144460 KB 
#include "werewolf.h"
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pf printf
#define pb push_back
#define all(x) x.begin(),x.end()
typedef vector<int> vi;
typedef pair<int,int> ii;

#define maxn 400005

int cnt,par[maxn];
void init(int N){
	for(int i=0;i<N;++i){
		par[i]=i;
	}
}
int fp(int i){
	return (par[i]==i)?i:par[i]=fp(par[i]);
}
int join(int x,int y){
	x=fp(x),y=fp(y);
	par[x]=par[y]=cnt;
	return cnt++;
}

vi AL1[maxn],AL2[maxn],ord1;
int dfscnt;
int p1[maxn][20],w1[maxn],r1[maxn],pre1[maxn],pst1[maxn];
int p2[maxn][20],w2[maxn],r2[maxn],pre2[maxn],pst2[maxn],pos[maxn];

void dfs1(int u){
	pre1[u]=dfscnt;
	if(AL1[u].size()==0){
		++dfscnt;
		ord1.pb(u);
	}
	for(int v:AL1[u]){
		p1[v][0]=u;
		dfs1(v);
	}
	pst1[u]=dfscnt-1;
}

void dfs2(int u){
	pre2[u]=dfscnt;
	if(AL2[u].size()==0){
		++dfscnt;
	}
	for(int v:AL2[u]){
		p2[v][0]=u;
		dfs2(v);
	}
	pst2[u]=dfscnt-1;
}

int n,v[2*maxn];
void up(int i,int s,int e,int x,int nv){
	if(s==x&&e==x){v[i]=nv;return;}
	int m=(s+e)>>1;
	if(x<=m)up(2*i+1,s,m,x,nv);
	else up(2*i+2,m+1,e,x,nv);
	v[i]=max(v[2*i+1],v[2*i+2]);
}
void up(int x,int nv){
	up(0,0,n-1,x,nv);
}
int qry(int i,int s,int e,int x,int y){
	if(s==x&&e==y)return v[i];
	int m=(s+e)>>1;
	if(y<=m)return qry(2*i+1,s,m,x,y);
	if(x>m)return qry(2*i+2,m+1,e,x,y);
	return max(qry(2*i+1,s,m,x,m),qry(2*i+2,m+1,e,m+1,y));
}
int qry(int x,int y){
	return qry(0,0,n-1,x,y);
}

struct query{
	int l1,r1,l2,r2,i;
};
vector<query> qrys;

vi check_validity(int N,vi X,vi Y,vi S,vi E,vi L,vi R){
	int Q=S.size(),M=X.size();
	
	vector<ii> edges;
	for(int i=0;i<M;++i){
		edges.pb({X[i],Y[i]});
	}
	
	sort(all(edges),[](ii &a,ii &b){return min(a.fi,a.se)>min(b.fi,b.se);});
	init(2*N);cnt=N;
	for(ii pr:edges){
		int a=fp(pr.fi),b=fp(pr.se);
		if(a!=b){
			int p=join(a,b);
			w1[p]=min(pr.fi,pr.se);
			AL1[p].pb(a);
			AL1[p].pb(b);
		}
	}
	sort(all(edges),[](ii &a,ii &b){return max(a.fi,a.se)<max(b.fi,b.se);});
	init(2*N);cnt=N;
	for(ii pr:edges){
		int a=fp(pr.fi),b=fp(pr.se);
		if(a!=b){
			int p=join(a,b);
			w2[p]=max(pr.fi,pr.se);
			AL2[p].pb(a);
			AL2[p].pb(b);
		}
	}
	
	memset(p1,-1,sizeof p1);
	dfscnt=0;
	dfs1(cnt-1);
	memset(p2,-1,sizeof p2);
	dfscnt=0;
	dfs2(cnt-1);
	
	for(int k=1;k<20;++k){
		for(int i=0;i<cnt;++i){
			if(p1[i][k-1]!=-1)p1[i][k]=p1[p1[i][k-1]][k-1];
			if(p2[i][k-1]!=-1)p2[i][k]=p2[p2[i][k-1]][k-1];
		}
	}
	
	//pf("pre1: ");for(int i=0;i<N;++i)pf("%d ",pre1[i]);pf("\n");
	//pf("pre2: ");for(int i=0;i<N;++i)pf("%d ",pre2[i]);pf("\n");
	//pf("w1: ");for(int i=0;i<cnt;++i)pf("%d ",w1[i]);pf("\n");
	//pf("w2: ");for(int i=0;i<cnt;++i)pf("%d ",w2[i]);pf("\n");
	
	for(int i=0;i<Q;++i){
		query q={0,0,0,0,i};
		//pf("qry: %d %d %d %d\n",S[i],E[i],L[i],R[i]);
		int cur=S[i];
		for(int k=19;k>=0;--k){
			if(p1[cur][k]!=-1&&w1[p1[cur][k]]>=L[i])cur=p1[cur][k];
		}
		q.l1=pre1[cur];
		q.r1=pst1[cur];
		
		cur=E[i];
		for(int k=19;k>=0;--k){
			if(p2[cur][k]!=-1&&w2[p2[cur][k]]<=R[i])cur=p2[cur][k];
		}
		q.l2=pre2[cur];
		q.r2=pst2[cur];
		//pf("%d %d %d %d\n",q.l1,q.r1,q.l2,q.r2);
		qrys.pb(q);
	}
	
	vi A(Q,0);
	sort(all(qrys),[](query &a,query &b){return a.r1<b.r1;});
	n=N;memset(v,-1,sizeof v);
	int pv=-1;
	for(int i=0;i<Q;++i){
		query &q=qrys[i];
		while(pv<q.r1){
			++pv;
			int x=ord1[pv];//node index
			int pos=pre2[x];//preorder
			up(pos,pv);
		}
		int val=qry(q.l2,q.r2);
		if(val>=q.l1)A[q.i]=1;
	}
	return A;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 84832 KB Output is correct
2 Correct 35 ms 84868 KB Output is correct
3 Correct 40 ms 84848 KB Output is correct
4 Correct 40 ms 84800 KB Output is correct
5 Correct 36 ms 84888 KB Output is correct
6 Correct 35 ms 84900 KB Output is correct
7 Correct 34 ms 84860 KB Output is correct
8 Correct 35 ms 84912 KB Output is correct
9 Correct 39 ms 84816 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 84832 KB Output is correct
2 Correct 35 ms 84868 KB Output is correct
3 Correct 40 ms 84848 KB Output is correct
4 Correct 40 ms 84800 KB Output is correct
5 Correct 36 ms 84888 KB Output is correct
6 Correct 35 ms 84900 KB Output is correct
7 Correct 34 ms 84860 KB Output is correct
8 Correct 35 ms 84912 KB Output is correct
9 Correct 39 ms 84816 KB Output is correct
10 Correct 45 ms 85708 KB Output is correct
11 Correct 40 ms 85624 KB Output is correct
12 Correct 44 ms 85564 KB Output is correct
13 Correct 40 ms 85692 KB Output is correct
14 Correct 40 ms 85784 KB Output is correct
15 Correct 42 ms 85708 KB Output is correct

Subtask #3
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 645 ms 132456 KB Output is correct
2 Correct 765 ms 137232 KB Output is correct
3 Correct 684 ms 134248 KB Output is correct
4 Correct 622 ms 132960 KB Output is correct
5 Correct 597 ms 132848 KB Output is correct
6 Correct 623 ms 132620 KB Output is correct
7 Correct 601 ms 132624 KB Output is correct
8 Correct 699 ms 137340 KB Output is correct
9 Correct 562 ms 134328 KB Output is correct
10 Correct 497 ms 132832 KB Output is correct
11 Correct 481 ms 132800 KB Output is correct
12 Correct 541 ms 132724 KB Output is correct
13 Correct 861 ms 137196 KB Output is correct
14 Correct 815 ms 137352 KB Output is correct
15 Correct 809 ms 137264 KB Output is correct
16 Correct 814 ms 137184 KB Output is correct
17 Correct 582 ms 132576 KB Output is correct

Subtask #4
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 84832 KB Output is correct
2 Correct 35 ms 84868 KB Output is correct
3 Correct 40 ms 84848 KB Output is correct
4 Correct 40 ms 84800 KB Output is correct
5 Correct 36 ms 84888 KB Output is correct
6 Correct 35 ms 84900 KB Output is correct
7 Correct 34 ms 84860 KB Output is correct
8 Correct 35 ms 84912 KB Output is correct
9 Correct 39 ms 84816 KB Output is correct
10 Correct 45 ms 85708 KB Output is correct
11 Correct 40 ms 85624 KB Output is correct
12 Correct 44 ms 85564 KB Output is correct
13 Correct 40 ms 85692 KB Output is correct
14 Correct 40 ms 85784 KB Output is correct
15 Correct 42 ms 85708 KB Output is correct
16 Correct 645 ms 132456 KB Output is correct
17 Correct 765 ms 137232 KB Output is correct
18 Correct 684 ms 134248 KB Output is correct
19 Correct 622 ms 132960 KB Output is correct
20 Correct 597 ms 132848 KB Output is correct
21 Correct 623 ms 132620 KB Output is correct
22 Correct 601 ms 132624 KB Output is correct
23 Correct 699 ms 137340 KB Output is correct
24 Correct 562 ms 134328 KB Output is correct
25 Correct 497 ms 132832 KB Output is correct
26 Correct 481 ms 132800 KB Output is correct
27 Correct 541 ms 132724 KB Output is correct
28 Correct 861 ms 137196 KB Output is correct
29 Correct 815 ms 137352 KB Output is correct
30 Correct 809 ms 137264 KB Output is correct
31 Correct 814 ms 137184 KB Output is correct
32 Correct 582 ms 132576 KB Output is correct
33 Correct 768 ms 133828 KB Output is correct
34 Correct 356 ms 118780 KB Output is correct
35 Correct 852 ms 137392 KB Output is correct
36 Correct 730 ms 133428 KB Output is correct
37 Correct 855 ms 136252 KB Output is correct
38 Correct 770 ms 134164 KB Output is correct
39 Correct 797 ms 142000 KB Output is correct
40 Correct 906 ms 143964 KB Output is correct
41 Correct 667 ms 135548 KB Output is correct
42 Correct 555 ms 133400 KB Output is correct
43 Correct 832 ms 142772 KB Output is correct
44 Correct 755 ms 136112 KB Output is correct
45 Correct 737 ms 142384 KB Output is correct
46 Correct 720 ms 141940 KB Output is correct
47 Correct 865 ms 137392 KB Output is correct
48 Correct 837 ms 137264 KB Output is correct
49 Correct 862 ms 137420 KB Output is correct
50 Correct 858 ms 137256 KB Output is correct
51 Correct 794 ms 144460 KB Output is correct
52 Correct 816 ms 144308 KB Output is correct