oj.uz

Submission #817832

# Submission time Handle Problem Language Result Execution time Memory
817832 2023-08-09T17:32:04 Z MohamedAhmed04 Inside information (BOI21_servers) C++14
50 / 100
 3500 ms 47568 KB 
#include <bits/stdc++.h>

using namespace std ;

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

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 ;

void dfs(int node , int par)
{
	in[node] = ++tim ;
	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(int i = 1 ; i <= n ; ++i)
	{
		if(vis[i])
			continue ;
		dfs2(i , i) ;
		dfs3(i , i , 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 ;
		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

# Verdict Execution time Memory Grader output
1 Correct 22 ms 15828 KB Output is correct
2 Correct 32 ms 17996 KB Output is correct
3 Correct 30 ms 18084 KB Output is correct
4 Correct 28 ms 18000 KB Output is correct
5 Correct 26 ms 18152 KB Output is correct
6 Correct 32 ms 17996 KB Output is correct

Subtask #2
0 / 2.5

# Verdict Execution time Memory Grader output
1 Correct 22 ms 15828 KB Output is correct
2 Correct 32 ms 17996 KB Output is correct
3 Correct 30 ms 18084 KB Output is correct
4 Correct 28 ms 18000 KB Output is correct
5 Correct 26 ms 18152 KB Output is correct
6 Correct 32 ms 17996 KB Output is correct
7 Correct 30 ms 16776 KB Output is correct
8 Correct 1332 ms 17728 KB Output is correct
9 Execution timed out 3578 ms 17780 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #3
2.5 / 2.5

# Verdict Execution time Memory Grader output
1 Correct 24 ms 15828 KB Output is correct
2 Correct 133 ms 38148 KB Output is correct
3 Correct 107 ms 38080 KB Output is correct

Subtask #4
0 / 2.5

# Verdict Execution time Memory Grader output
1 Correct 24 ms 15828 KB Output is correct
2 Correct 133 ms 38148 KB Output is correct
3 Correct 107 ms 38080 KB Output is correct
4 Correct 37 ms 15864 KB Output is correct
5 Execution timed out 3569 ms 33836 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 15820 KB Output is correct
2 Correct 103 ms 44184 KB Output is correct
3 Correct 96 ms 44176 KB Output is correct
4 Correct 96 ms 44240 KB Output is correct

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 15820 KB Output is correct
2 Correct 103 ms 44184 KB Output is correct
3 Correct 96 ms 44176 KB Output is correct
4 Correct 96 ms 44240 KB Output is correct
5 Correct 24 ms 15840 KB Output is correct
6 Execution timed out 3570 ms 41240 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 15828 KB Output is correct
2 Correct 84 ms 40940 KB Output is correct
3 Correct 104 ms 41028 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 15828 KB Output is correct
2 Correct 84 ms 40940 KB Output is correct
3 Correct 104 ms 41028 KB Output is correct
4 Correct 30 ms 16716 KB Output is correct
5 Execution timed out 3534 ms 38564 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #9
12.5 / 12.5

# Verdict Execution time Memory Grader output
1 Correct 21 ms 15828 KB Output is correct
2 Correct 92 ms 44192 KB Output is correct
3 Correct 125 ms 44432 KB Output is correct
4 Correct 78 ms 44228 KB Output is correct
5 Correct 22 ms 15908 KB Output is correct
6 Correct 89 ms 40868 KB Output is correct
7 Correct 118 ms 40932 KB Output is correct
8 Correct 118 ms 42296 KB Output is correct
9 Correct 151 ms 42256 KB Output is correct
10 Correct 129 ms 43772 KB Output is correct
11 Correct 137 ms 43184 KB Output is correct

Subtask #10
0 / 12.5

# Verdict Execution time Memory Grader output
1 Correct 21 ms 15828 KB Output is correct
2 Correct 92 ms 44192 KB Output is correct
3 Correct 125 ms 44432 KB Output is correct
4 Correct 78 ms 44228 KB Output is correct
5 Correct 22 ms 15908 KB Output is correct
6 Correct 89 ms 40868 KB Output is correct
7 Correct 118 ms 40932 KB Output is correct
8 Correct 118 ms 42296 KB Output is correct
9 Correct 151 ms 42256 KB Output is correct
10 Correct 129 ms 43772 KB Output is correct
11 Correct 137 ms 43184 KB Output is correct
12 Correct 28 ms 16772 KB Output is correct
13 Execution timed out 3525 ms 44108 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #11
17.5 / 17.5

# Verdict Execution time Memory Grader output
1 Correct 26 ms 15828 KB Output is correct
2 Correct 28 ms 18000 KB Output is correct
3 Correct 31 ms 17996 KB Output is correct
4 Correct 28 ms 18024 KB Output is correct
5 Correct 27 ms 18132 KB Output is correct
6 Correct 31 ms 17988 KB Output is correct
7 Correct 24 ms 16788 KB Output is correct
8 Correct 102 ms 40912 KB Output is correct
9 Correct 123 ms 40976 KB Output is correct
10 Correct 22 ms 16796 KB Output is correct
11 Correct 96 ms 47568 KB Output is correct
12 Correct 97 ms 47568 KB Output is correct
13 Correct 78 ms 47468 KB Output is correct
14 Correct 23 ms 16800 KB Output is correct
15 Correct 84 ms 40924 KB Output is correct
16 Correct 101 ms 40916 KB Output is correct
17 Correct 109 ms 42244 KB Output is correct
18 Correct 112 ms 42224 KB Output is correct
19 Correct 141 ms 43996 KB Output is correct
20 Correct 130 ms 43176 KB Output is correct
21 Correct 125 ms 41464 KB Output is correct
22 Correct 105 ms 41508 KB Output is correct
23 Correct 119 ms 42108 KB Output is correct
24 Correct 108 ms 42152 KB Output is correct
25 Correct 113 ms 42904 KB Output is correct
26 Correct 110 ms 40976 KB Output is correct
27 Correct 110 ms 41108 KB Output is correct

Subtask #12
0 / 17.5

# Verdict Execution time Memory Grader output
1 Correct 26 ms 15828 KB Output is correct
2 Correct 28 ms 18000 KB Output is correct
3 Correct 31 ms 17996 KB Output is correct
4 Correct 28 ms 18024 KB Output is correct
5 Correct 27 ms 18132 KB Output is correct
6 Correct 31 ms 17988 KB Output is correct
7 Correct 24 ms 16788 KB Output is correct
8 Correct 102 ms 40912 KB Output is correct
9 Correct 123 ms 40976 KB Output is correct
10 Correct 22 ms 16796 KB Output is correct
11 Correct 96 ms 47568 KB Output is correct
12 Correct 97 ms 47568 KB Output is correct
13 Correct 78 ms 47468 KB Output is correct
14 Correct 23 ms 16800 KB Output is correct
15 Correct 84 ms 40924 KB Output is correct
16 Correct 101 ms 40916 KB Output is correct
17 Correct 109 ms 42244 KB Output is correct
18 Correct 112 ms 42224 KB Output is correct
19 Correct 141 ms 43996 KB Output is correct
20 Correct 130 ms 43176 KB Output is correct
21 Correct 125 ms 41464 KB Output is correct
22 Correct 105 ms 41508 KB Output is correct
23 Correct 119 ms 42108 KB Output is correct
24 Correct 108 ms 42152 KB Output is correct
25 Correct 113 ms 42904 KB Output is correct
26 Correct 110 ms 40976 KB Output is correct
27 Correct 110 ms 41108 KB Output is correct
28 Correct 30 ms 16740 KB Output is correct
29 Correct 1369 ms 17672 KB Output is correct
30 Execution timed out 3552 ms 17664 KB Time limit exceeded
31 Halted 0 ms 0 KB -