CompetitiveProgramming/codeforces/327/D.cpp at master · phonglnDEV/CompetitiveProgramming · GitHub

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
#include <sstream>
#include <iomanip>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <string>
#include <deque>
#include <complex>

#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 FORN(i,a,b) for(int i=(a),_b=(b);i<_b;i++)
#define DOWN(i,a,b) for(int i=a,_b=(b);i>=_b;i--)
#define SET(a,v) memset(a,v,sizeof(a))
#define sqr(x) ((x)*(x))
#define ll long long
#define F first
#define S second
#define PB push_back
#define MP make_pair

#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;
using namespace std;

//Buffer reading
int INP,AM,REACHEOF;
#define BUFSIZE (1<<12)
char BUF[BUFSIZE+1], *inp=BUF;
#define GETCHAR(INP) { \
    if(!*inp) { \
        if (REACHEOF) return 0;\
        memset(BUF,0,sizeof BUF);\
        int inpzzz = fread(BUF,1,BUFSIZE,stdin);\
        if (inpzzz != BUFSIZE) REACHEOF = true;\
        inp=BUF; \
    } \
    INP=*inp++; \
}
#define DIG(a) (((a)>='0')&&((a)<='9'))
#define GN(j) { \
    AM=0;\
    GETCHAR(INP); while(!DIG(INP) && INP!='-') GETCHAR(INP);\
    if (INP=='-') {AM=1;GETCHAR(INP);} \
    j=INP-'0'; GETCHAR(INP); \
    while(DIG(INP)){j=10*j+(INP-'0');GETCHAR(INP);} \
    if (AM) j=-j;\
}
//End of buffer reading

const long double PI = acos((long double) -1.0);

const int di[] = {-1,1,0,0};
const int dj[] = {0,0,-1,1};

int m, n;
char a[511][511];
bool visited[511][511];
int first, last, qu[511*511], qv[511*511];

void bfs(int u, int v) {
    first = last = 1; qu[1] = u; qv[1] = v;
    visited[u][v] = true;
    while (first <= last) {
        int u = qu[first], v = qv[first]; ++first;

        REP(dir,4) {
            int uu = u + di[dir], vv = v + dj[dir];
            if (uu < 1 || uu > m || vv < 1 || vv > n) continue;
            if (a[uu][vv] == '#' || visited[uu][vv]) continue;

            visited[uu][vv] = true;
            qu[++last] = uu; qv[last] = vv;
        }
    }
}

char rc[1000111];
int ru[1000111], rv[1000111];
int nr;

int main() {
    while (scanf("%d%d", &m, &n) == 2) {
        FOR(i,1,m) scanf("%s\n", &a[i][1]);

        memset(visited, false, sizeof visited);
        nr = 0;
        FOR(i,1,m) FOR(j,1,n) if (a[i][j] == '.' && !visited[i][j]) {
            bfs(i, j);

            FOR(i,1,last) {
                ++nr;
                rc[nr] = 'B';
                ru[nr] = qu[i];
                rv[nr] = qv[i];
            }
            FORD(i,last,2) {
                ++nr; rc[nr] = 'D', ru[nr] = qu[i]; rv[nr] = qv[i];
                ++nr; rc[nr] = 'R', ru[nr] = qu[i]; rv[nr] = qv[i];
            }
        }
        printf("%d\n", nr);
        FOR(i,1,nr) printf("%c %d %d\n", rc[i], ru[i], rv[i]);
    }
    return 0;
}