forked from ngthanhtrung23/CompetitiveProgramming
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathC.cpp
More file actions
81 lines (66 loc) · 2.03 KB
/
C.cpp
File metadata and controls
81 lines (66 loc) · 2.03 KB
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
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
#define EACH(it,a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define DEBUG(x) { cout << #x << " = "; cout << (x) << endl; }
#define PR(a,n) { cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl; }
#define PR0(a,n) { cout << #a << " = "; REP(_,n) cout << a[_] << ' '; cout << endl; }
#define sqr(x) ((x) * (x))
#define ll long long
using namespace std;
const int MN = 300111;
int n, q;
string s;
inline int get(int i, int j) {
if (i > j) swap(i, j);
return max(j - i - 2, 0);
}
int main() {
ios :: sync_with_stdio(false);
while (cin >> n >> q) {
cin >> s;
s = " " + s;
set<int> all;
all.insert(0);
all.insert(n+1);
FOR(i,1,n) if (s[i] != '.') {
all.insert(i);
}
int last = 0, res = 0;
for(auto p : all) {
if (p == 0) {
}
else {
res += get(last, p);
last = p;
}
}
while (q--) {
int u; char c;
cin >> u >> c;
if (c == '.' && s[u] == '.') {
}
else if (c != '.' && s[u] != '.') {
}
else if (c == '.' && s[u] != '.') {
auto next = *all.upper_bound(u);
auto prev = all.lower_bound(u); --prev;
res -= get(u, next);
res -= get(*prev, u);
all.erase(u);
res += get(*prev, next);
}
else {
auto next = *all.upper_bound(u);
auto prev = all.lower_bound(u); --prev;
res += get(u, next);
res += get(*prev, u);
all.insert(u);
res -= get(*prev, next);
}
s[u] = c;
printf("%d\n", res);
}
}
}