oj.uz

답안 #817884

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
817884 2023-08-09T18:39:26 Z MohamedAhmed04 Inside information (BOI21_servers) C++14
70 / 100
 3500 ms 48136 KB 
#include <bits/stdc++.h>

using namespace std ;

const int MAX = 3e5 + 10 ;
const int B = 650 ;

int n , q ;

vector< vector< pair<int , int> > >adj(MAX) ;
vector< vector<int> >adj2(MAX) ;

int val[MAX] , up_inc[MAX] , up_dec[MAX] ;
int dep[MAX] , P[MAX][18] ;

int in[MAX] , out[MAX] ;
int tim = 0 ;

vector<int>order ;

void dfs(int node , int par)
{
	in[node] = ++tim , order.push_back(node) ;
	P[node][0] = par ;
	for(int i = 1 ; i < 18 ; ++i)
		P[node][i] = P[P[node][i-1]][i-1] ;
	up_inc[node] = up_dec[node] = par ;
	if(val[node] < val[par])
		up_inc[node] = up_inc[par] ;
	else
		up_dec[node] = up_dec[par] ;
	for(auto &childd : adj[node])
	{
		int child = childd.first , y = childd.second ;
		if(child == par)
			continue ;
		dep[child] = dep[node] + 1 , val[child] = y ;
		dfs(child , node) ;
	}
	out[node] = tim ;
}

bool Ancestor(int x , int y)
{
	return (in[y] >= in[x] && in[y] <= out[x]) ;
}

bool check(int x , int y , int tim) // x has server y
{
	if(x == y)
		return true ;
	if((!Ancestor(up_inc[y] , x)))
		return false ;
	if((!Ancestor(up_dec[x] , y)))
		return false ;
	if(Ancestor(y , x))
		return (val[x] <= tim) ;
	if((!Ancestor(x , y)) && val[x] > tim)
		return false ;
	bool flag = false ;
	if(dep[x] < dep[y])
		swap(x , y) , flag = true ;
	for(int k = 17 ; k >= 0 ; --k)
	{
		if(dep[x] - (1 << k) > dep[y])
			x = P[x][k] ;
	}
	if(P[x][0] == y)
		return (val[x] <= tim) ;
	if(dep[x] != dep[y])
		x = P[x][0] ;
	if(flag)
		swap(x , y) ;
	for(int k = 17 ; k >= 0 ; --k)
	{
		if(P[x][k] != P[y][k])
			x = P[x][k] , y = P[y][k] ;
	}
	return (val[x] > val[y]) ;
}

int dp[MAX] , dpup[MAX] , dpdown[MAX] ;
int vis[MAX] ;

void dfs2(int node , int par)
{
	vis[node] = 1 ;
	dpdown[node] = dp[node] = 1 ;
	for(auto &child : adj2[node])
	{
		if(child == par)
			continue ;
		dfs2(child , node) ;
		if(val[child] > val[node])
			dpdown[node] += dpdown[child] ;
		dp[node] += dpdown[child] ;
	}
}

void dfs3(int node , int par , int sum)
{
	dpup[node] = sum + (par != node) ;
	if(val[par] > val[node])
		dpup[node] += dpup[par] ;
	dp[node] += dpup[node] ;
	int sz = adj2[node].size() , sum2 = 0 ;
	for(int i = sz-1 ; i >= 0 ; --i)
	{
		int child = adj2[node][i] ;
		if(child == par)
			continue ;
		dfs3(child , node , sum2) ;
		sum2 += dpdown[child] ;
	}
}

void calc()
{
	for(int i = 1 ; i <= n ; ++i)
		vis[i] = 0 ;
	for(auto &node : order)
	{
		if(vis[node])
			continue ;
		dfs2(node , node) ;
		dfs3(node , node , 0) ;
	}
}

char ch[MAX] ;
int X[MAX] , Y[MAX] ;

int main()
{
	ios_base::sync_with_stdio(0) ;
	cin.tie(0) ;
	cin>>n>>q ;
	for(int i = 1 ; i <= n+q-1 ; ++i)
	{
		cin>>ch[i] ;
		if(ch[i] == 'S')
		{
			cin>>X[i]>>Y[i] ;
			adj[X[i]].emplace_back(Y[i] , i) ;
			adj[Y[i]].emplace_back(X[i] , i) ;
		}
		else if(ch[i] == 'Q')
			cin>>X[i]>>Y[i] ;
		else if(ch[i] == 'C')
			cin>>X[i] ;
	}
	dfs(1 , 1) ;
	for(int i = 1 ; i <= n ; ++i)
		dp[i] = 1 ;
	int cnt = 0 ;
	vector<int>v ;
	for(int i = 1 ; i <= n+q-1 ; ++i)
	{
		if(cnt == B)
			calc() , cnt = 0 , v.clear() ;
		if(ch[i] == 'S')
		{
			v.push_back(i) ;
			adj2[X[i]].push_back(Y[i]) ;
			adj2[Y[i]].push_back(X[i]) ;
			cnt++ ;
		}
		else if(ch[i] == 'Q')
		{
			if(check(X[i] , Y[i] , i))
				cout<<"yes\n" ;
			else
				cout<<"no\n" ;
		}
		else if(ch[i] == 'C')
		{
			int ans = dp[X[i]] ;
			for(auto &j : v)
			{
				int a = X[j] , b = Y[j] ;
				if(val[a] != j)
					swap(a , b) ;
				if(check(a , X[i] , i) && (!Ancestor(a , X[i])))
					ans++ ;
				else if(check(b , X[i] , i) && Ancestor(a , X[i]))
					ans++ ;
			}
			cout<<ans<<"\n" ;
		}
	}
	return 0 ;
}

Subtask #1
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 16092 KB Output is correct
2 Correct 28 ms 16844 KB Output is correct
3 Correct 42 ms 16948 KB Output is correct
4 Correct 28 ms 16920 KB Output is correct
5 Correct 29 ms 17072 KB Output is correct
6 Correct 34 ms 17008 KB Output is correct

Subtask #2
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 16092 KB Output is correct
2 Correct 28 ms 16844 KB Output is correct
3 Correct 42 ms 16948 KB Output is correct
4 Correct 28 ms 16920 KB Output is correct
5 Correct 29 ms 17072 KB Output is correct
6 Correct 34 ms 17008 KB Output is correct
7 Correct 40 ms 16144 KB Output is correct
8 Correct 292 ms 16824 KB Output is correct
9 Correct 557 ms 17064 KB Output is correct
10 Correct 227 ms 16924 KB Output is correct
11 Correct 81 ms 17064 KB Output is correct
12 Correct 587 ms 16984 KB Output is correct

Subtask #3
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 16076 KB Output is correct
2 Correct 544 ms 39944 KB Output is correct
3 Correct 675 ms 40076 KB Output is correct

Subtask #4
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 16076 KB Output is correct
2 Correct 544 ms 39944 KB Output is correct
3 Correct 675 ms 40076 KB Output is correct
4 Correct 66 ms 16172 KB Output is correct
5 Correct 1194 ms 40064 KB Output is correct
6 Correct 892 ms 40044 KB Output is correct
7 Correct 2287 ms 39952 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 16064 KB Output is correct
2 Correct 651 ms 46192 KB Output is correct
3 Correct 680 ms 46020 KB Output is correct
4 Correct 514 ms 47800 KB Output is correct

Subtask #6
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 16064 KB Output is correct
2 Correct 651 ms 46192 KB Output is correct
3 Correct 680 ms 46020 KB Output is correct
4 Correct 514 ms 47800 KB Output is correct
5 Correct 25 ms 16076 KB Output is correct
6 Correct 920 ms 45980 KB Output is correct
7 Correct 1425 ms 47044 KB Output is correct
8 Correct 996 ms 45920 KB Output is correct
9 Correct 1026 ms 45972 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 16080 KB Output is correct
2 Correct 387 ms 39780 KB Output is correct
3 Correct 667 ms 39924 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 16080 KB Output is correct
2 Correct 387 ms 39780 KB Output is correct
3 Correct 667 ms 39924 KB Output is correct
4 Correct 28 ms 16076 KB Output is correct
5 Correct 839 ms 39768 KB Output is correct
6 Correct 984 ms 39516 KB Output is correct

Subtask #9
12.5 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 16144 KB Output is correct
2 Correct 683 ms 46356 KB Output is correct
3 Correct 638 ms 46300 KB Output is correct
4 Correct 507 ms 47812 KB Output is correct
5 Correct 23 ms 16076 KB Output is correct
6 Correct 367 ms 39888 KB Output is correct
7 Correct 779 ms 39968 KB Output is correct
8 Correct 1008 ms 41084 KB Output is correct
9 Correct 986 ms 41200 KB Output is correct
10 Correct 1756 ms 42700 KB Output is correct
11 Correct 1851 ms 42436 KB Output is correct

Subtask #10
0 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 16144 KB Output is correct
2 Correct 683 ms 46356 KB Output is correct
3 Correct 638 ms 46300 KB Output is correct
4 Correct 507 ms 47812 KB Output is correct
5 Correct 23 ms 16076 KB Output is correct
6 Correct 367 ms 39888 KB Output is correct
7 Correct 779 ms 39968 KB Output is correct
8 Correct 1008 ms 41084 KB Output is correct
9 Correct 986 ms 41200 KB Output is correct
10 Correct 1756 ms 42700 KB Output is correct
11 Correct 1851 ms 42436 KB Output is correct
12 Correct 26 ms 16084 KB Output is correct
13 Correct 855 ms 46480 KB Output is correct
14 Correct 1453 ms 46880 KB Output is correct
15 Correct 1064 ms 46112 KB Output is correct
16 Correct 1051 ms 45896 KB Output is correct
17 Correct 29 ms 16164 KB Output is correct
18 Correct 827 ms 39636 KB Output is correct
19 Correct 903 ms 39460 KB Output is correct
20 Correct 1142 ms 40736 KB Output is correct
21 Correct 1343 ms 40688 KB Output is correct
22 Execution timed out 3588 ms 41312 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #11
17.5 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 16172 KB Output is correct
2 Correct 31 ms 17204 KB Output is correct
3 Correct 33 ms 17288 KB Output is correct
4 Correct 29 ms 17180 KB Output is correct
5 Correct 31 ms 17372 KB Output is correct
6 Correct 33 ms 17224 KB Output is correct
7 Correct 26 ms 16104 KB Output is correct
8 Correct 509 ms 40396 KB Output is correct
9 Correct 633 ms 40204 KB Output is correct
10 Correct 22 ms 16084 KB Output is correct
11 Correct 648 ms 46376 KB Output is correct
12 Correct 649 ms 46436 KB Output is correct
13 Correct 459 ms 48136 KB Output is correct
14 Correct 23 ms 16084 KB Output is correct
15 Correct 374 ms 39740 KB Output is correct
16 Correct 761 ms 39840 KB Output is correct
17 Correct 966 ms 41284 KB Output is correct
18 Correct 899 ms 41208 KB Output is correct
19 Correct 1599 ms 42724 KB Output is correct
20 Correct 1669 ms 42336 KB Output is correct
21 Correct 651 ms 40296 KB Output is correct
22 Correct 577 ms 40252 KB Output is correct
23 Correct 739 ms 40992 KB Output is correct
24 Correct 674 ms 41008 KB Output is correct
25 Correct 919 ms 41740 KB Output is correct
26 Correct 1059 ms 39932 KB Output is correct
27 Correct 872 ms 39796 KB Output is correct

Subtask #12
0 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 16172 KB Output is correct
2 Correct 31 ms 17204 KB Output is correct
3 Correct 33 ms 17288 KB Output is correct
4 Correct 29 ms 17180 KB Output is correct
5 Correct 31 ms 17372 KB Output is correct
6 Correct 33 ms 17224 KB Output is correct
7 Correct 26 ms 16104 KB Output is correct
8 Correct 509 ms 40396 KB Output is correct
9 Correct 633 ms 40204 KB Output is correct
10 Correct 22 ms 16084 KB Output is correct
11 Correct 648 ms 46376 KB Output is correct
12 Correct 649 ms 46436 KB Output is correct
13 Correct 459 ms 48136 KB Output is correct
14 Correct 23 ms 16084 KB Output is correct
15 Correct 374 ms 39740 KB Output is correct
16 Correct 761 ms 39840 KB Output is correct
17 Correct 966 ms 41284 KB Output is correct
18 Correct 899 ms 41208 KB Output is correct
19 Correct 1599 ms 42724 KB Output is correct
20 Correct 1669 ms 42336 KB Output is correct
21 Correct 651 ms 40296 KB Output is correct
22 Correct 577 ms 40252 KB Output is correct
23 Correct 739 ms 40992 KB Output is correct
24 Correct 674 ms 41008 KB Output is correct
25 Correct 919 ms 41740 KB Output is correct
26 Correct 1059 ms 39932 KB Output is correct
27 Correct 872 ms 39796 KB Output is correct
28 Correct 32 ms 16180 KB Output is correct
29 Correct 236 ms 16828 KB Output is correct
30 Correct 540 ms 16972 KB Output is correct
31 Correct 235 ms 16844 KB Output is correct
32 Correct 78 ms 17008 KB Output is correct
33 Correct 551 ms 17176 KB Output is correct
34 Correct 44 ms 16076 KB Output is correct
35 Correct 1064 ms 39812 KB Output is correct
36 Correct 807 ms 40020 KB Output is correct
37 Correct 2056 ms 39944 KB Output is correct
38 Correct 26 ms 16152 KB Output is correct
39 Correct 840 ms 45820 KB Output is correct
40 Correct 1475 ms 46452 KB Output is correct
41 Correct 1075 ms 45628 KB Output is correct
42 Correct 1051 ms 45688 KB Output is correct
43 Correct 28 ms 16076 KB Output is correct
44 Correct 852 ms 39260 KB Output is correct
45 Correct 1016 ms 39300 KB Output is correct
46 Correct 1277 ms 40480 KB Output is correct
47 Correct 1117 ms 40532 KB Output is correct
48 Execution timed out 3563 ms 41300 KB Time limit exceeded
49 Halted 0 ms 0 KB -