JOJ 2445: Tree 线段树

 2445: Tree

---

Result	TIME Limit	MEMORY Limit	Run Times	AC Times	JUDGE
	2s	16384K	384	40	Standard

in this problem , i will give you a n-vertex-01-tree with the vertex numbered with 1 as root , as it states,the tree has n vertexes, each node is marked from 1 to n, the node marked with 1 is the root of tree. each node has a value either 1 or 0, in the initial state, each node has the value 0;

in the process,there are two operations on the tree:
1. Q x: return the sum of the value on the subtree with vertext x as root ( include the value of on the vertex x );
2. C x: inverse all the value on the subtree with vertex x as root ( include vertex x ), inverse means turn 0 to 1 ,1 to 0;

Input

the input has multicases, in each case , the first line is n, the number vertex of tree; following will be n - 1 lines, each line has two integers u, v (1 <= u,v <= n) which means there is a side between u and v; following is a integer m which means there are m operations, the following m lines is either "Q x" or "C x" ( quotation for clarification ) , 1<=n,m<=20000;

Output

for each "Q x" operation return the sum of the value on the subtree with vertex x as root

Sample Input

5
1 2
1 3
2 4
2 5
5
Q 1
C 1
Q 1
C 2
Q 1

Sample Output

0
5
2

Hint

the tree looks as

                                   1
                                  / /
                                 2   3
                                / /
                               4   5

the first "Q 1" return 0 becaus all the node with value 0 ( the initial state ), the second return 5 because we have a operation "C 1" on the tree which inverse all the value on the tree ( turn all 0 to 1, turn all 1 to 0 ( in this state no 1) ) include the value on the node 1, so return 5, the third turn the value on the node 2, 4, 5 from 1 to 0 so return 2;

 

 

Problem Source: kscinow

 

---

This problem is used for contest: 95 

---

Submit / Problem List / Status / Discuss

Problem Set with Online Judge System Version 3.12
Jilin University

Developed by skywind, SIYEE

 

很惭愧，我建树真的还很菜，这道题目还是有些东西不理解，只能贴上herker大牛的代码，来日补上！

#include <stdio.h>

#include <string.h>

#include <queue>

using namespace std;

int  m,n ,Time;

bool visit[20006];

struct Vertex

{

queue<int> Q;

int S ,E ;

}V[20006];

struct segTree

{

int L, R ,C , f ;

}T[80020];

bool readData()

{

if( scanf("%d", &n)==EOF ) return 0;

int i,j,k;

for(i=1;i<n;i++)

{

scanf("%d%d",&j,&k);

V[j].Q.push(k);

V[k].Q.push(j);

}

return 1;

}

 

void search(int a)

{

if( visit[a])  return ;

visit[a] = 1;

Time++;

V[a].S  = Time ;

while( !V[a].Q.empty())

{

search(V[a].Q.front());

V[a].Q.pop();

}

V[a].E = Time;

}

void segInit(int  L, int R ,int k)

{

T[k].L = L;

T[k].R = R;

T[k].C= 0;

T[k].f= 0;

if( L == R ) return ;

int  Mid = (L+R)/2;

segInit(L,Mid ,k+k);

segInit(Mid+1 , R ,k+k+1 );

}

void segChange(int L ,int R, int k)

{

if( L == T[k].L && R == T[k].R )

{

T[k].f++;

return ;

}

if( T[k].L == T[k].R ) return ;

int Mid   = (T[k].L+T[k].R )/2;

if( R <= Mid) segChange(L,R,k+k);

else if( L > Mid ) segChange(L, R, k+k+1);

else

{

segChange(L, Mid ,k+k);

segChange(Mid+1,R,k+k+1);

}

int s1 = k+k , s2 = k+ k+1;

if( T[s1].f%2 == 0 )

T[k].C = T[s1].C;

else

T[k].C = T[s1].R - T[s1].L+1- T[s1].C;

if( T[s2].f%2 == 0 )

T[k].C+=T[s2].C;

else

T[k].C +=(T[s2].R - T[s2].L +1 - T[s2].C);

}

int segSum(int L, int R ,int k ,int f)

{

f += T[k].f;

if( L == T[k].L&& R == T[k].R)

{

if( f%2 == 0 )

return T[k].C;

 

else

return ( T[k].R-  T[k].L +1 -T[k].C);

}

int Mid = (T[k].L+T[k].R)/2;

if( R <= Mid) return segSum(L,R,k+k ,f);

else if( L > Mid ) return segSum(L, R, k+k+1 ,f);

return  segSum(L, Mid ,k+k,f)+segSum(Mid+1,R,k+k+1 ,f);

}

int main()

{

while( readData() )

{

memset(visit , 0 ,sizeof(visit));

Time = 0;

search(1);

segInit( 1 , n ,1);

scanf("%d",&m);

while(m--)

{

char str[4];

int k;

scanf("%s%d",str,&k);

if( str[0] == 'Q') printf("%d/n",segSum(V[k].S,V[k].E,1 ,0) );

else segChange(V[k].S, V[k].E ,1 );

}

}

return  0;

}