forked from ngthanhtrung23/CompetitiveProgramming
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathB.cpp
More file actions
87 lines (77 loc) · 2.23 KB
/
B.cpp
File metadata and controls
87 lines (77 loc) · 2.23 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
81
82
83
84
85
86
87
#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 DEBUG(X) { cout << #X << " = " << 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
#define SZ(x) ((int) (x).size())
using namespace std;
int n;
string s[3];
bool done() {
FOR(i,1,2) FOR(j,1,n) if (s[i][j] == '.') return false;
return true;
}
bool fill(int i, int j) {
// DEBUG(s[1]);
// DEBUG(s[2]);
// cout << i << ' ' << j << endl;
if (s[3-i][j] == '.') s[3-i][j] = 'X';
s[i][j] = 'X';
int t = j-1;
while (s[i][t] == '.') {
s[i][t] = 'X';
--t;
}
t = j + 1;
while (s[i][t] == '.') {
s[i][t] = 'X';
++t;
}
// DEBUG(s[1]);
// DEBUG(s[2]);
}
int main() {
ios :: sync_with_stdio(0); cin.tie(0);
int ntest; cin >> ntest;
FOR(test,1,ntest) {
cin >> n;
FOR(t,1,2) {
cin >> s[t];
s[t] = "X" + s[t] + "X";
}
int res = 0;
while (!done()) {
bool good = false;
FOR(i,1,2) FOR(j,1,n)
if (s[i][j] == '.' && s[i][j-1] == 'X' && s[i][j+1] == 'X'
&& s[3-i][j] == '.') {
fill(3-i, j);
++res;
good = true;
break;
}
if (good) continue;
FOR(i,1,2) FOR(j,1,n) {
if (s[i][j] == '.' && s[3-i][j] == '.') {
fill(i, j);
fill(3-i, j);
res += 2;
good = true;
break;
}
}
if (good) continue;
FOR(i,1,2) FOR(j,1,n)
if (s[i][j] == '.') {
fill(i, j);
++res;
break;
}
}
cout << "Case #" << test << ": " << res << endl;
}
}