-
Notifications
You must be signed in to change notification settings - Fork 0
/
1080segmnt tree.cpp
122 lines (90 loc) · 2.07 KB
/
1080segmnt tree.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define PI (acos(-1))
#define ct cout<<
#define cn cin>>
#define spc <<" "<<
#define nl puts("")
#define _fl(x) puts("FLAG " #x);
#define _(x) cout<< #x <<" is "<< x <<endl;
#define fs first
#define sc second
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define _109 (1000000000)
#define _0(arr) memset(arr,0,sizeof ( arr ) )
#define _1(arr) memset(arr,-1,sizeof ( arr ) )
#define _ninp(n,arr) for(int i=0; i<n;i++)cin>>arr[i];
#define _nout(n,arr) for(int i=0; i<n;i++)cout<<arr[i]<<" \n"[i==n-1];
double _eps = 1e-6;
long long gcd(long long a, long long b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
int segtre[100000*4];
void update(int v,int tl,int tr,int l,int r){
if(l>r)return;
if(l==tl && r==tr){
// _(l);
// _(r);
// nl;
segtre[v]++;
return;
}
else{
int tm=(tl+tr)/2;
update(v*2,tl,tm,l,min(tm,r));
update(v*2+1,tm+1,tr,max(tm+1,l),r);
}
}
int sm(int v,int tl,int tr,int pos){
if(tl==tr)return segtre[v];
else{
int tm=(tl+tr)/2;
if(pos<=tm) return segtre[v]+sm(v*2,tl,tm,pos);
else return segtre[v]+sm(v*2+1,tm+1,tr,pos);
}
}
int main()
{
int T;
cn T;
getchar();
for(int caseno = 1; caseno <= T ; caseno++)
{
printf("Case %d:\n", caseno);
char s[100000+10];
scanf("%s",s);
int n = strlen(s);
int m;
cn m;
getchar();
for (int i = 0; i < m; ++i)
{
char q=getchar();
if(q=='I'){
int l,r;
scanf("%d %d",&l,&r);
l--,r--;
update(1,0,n-1,l,r);
}
else{
int r;
scanf("%d",&r);
r--;
int sum=sm(1,0,n-1,r);
if(sum&1)ct (s[r]=='1'?0:1);
else ct (s[r]=='1'?1:0);
nl;
}
getchar();
}
_0(segtre);
}
//update(1,0,15,5,15);
return 0;
}