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
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <deque>

using namespace std;

typedef vector<int> VI;
typedef long long LL;
typedef vector<VI> VVI;
typedef vector<LL> VLL;
typedef vector<double> VD;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;

#define FOR(x, b, e) for (int x = b; x <= (e); ++x)
#define FORD(x, b, e) for (int x = b; x >= (e); --x)
#define REP(x, n) for (int x = 0; x < (n); ++x)
#define VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(i, c) for (VAR(i, (c).begin()); i != (c).end(); ++i)
#define PB push_back
#define PF push_front
#define MP make_pair
#define ST first
#define ND second

// Stała INF jest wykorzystywana jako reprezentacja nieskończoności. Ma ona
// wartość 1000000001, a nie 2147483647 (największa wartość typu int) ze
// względu na dwa fakty - prosty zapis, oraz brak przepełnienia wartości zmiennej
// w przypadku dodawania dwóch nieskończoności do siebie
// ((int) 2147483647 + (int) 2147483647 = -2).
const int INF = 1000000001;

// Stała EPS jest używana w wielu algorytmach geometrycznych do porównywania
// wartości bliskich zera (w zadaniach tego typu pojawia się wiele problemów
// związanych z błędami zaokrągleń)

const double EPS = 10e-9;

template <typename Container>
void pprint(const Container &c)
{
    std::cout << "[";
    for (auto it = c.begin(); it != c.end(); /* no increment here */)
    {
        std::cout << *it;
        if (++it != c.end())
            std::cout << ", "; // Increment here
    }
    std::cout << "]"
              << "\n";
}

template <typename K, typename V>
void pprint(const pair<K, V> &c)
{
    cout << "[" << c.ST << ", " << c.ND << "]";
}

char color_ignore = '.';

inline void add_color(char color, map<char, int> &to)
{
    to[color]++;
}

inline void remove_color(char color, map<char, int> &to)
{
    if (--to[color] <= 0)
    {
        to.erase(color);
    }
}

inline pair<int, char> find_solid(vector<map<char, int>> &colors)
{
    FOR(i, 1, SIZE(colors))
    {
        if (colors[i].size() == 1) // 0 means to igrnoe (will be painted)
        {
            return pair{i, colors[i].begin()->first};
        }
    }
    return pair{-1, color_ignore};
}

void pprint(vector<map<char, int>> &colors)
{
    FOR(i, 1, colors.size() - 1)
    {
        cout << i << ": ";
        FOREACH(c, colors[i])
        {
            cout << c->first << "-" << c->second << " ";
        }
        cout << "\n";
    }
    cout << "\n";
}

void pprint_board(vector<vector<char>> &board)
{
    FOR(i, 1, SIZE(board) - 1)
    {
        FOR(j, 1, SIZE(board[i]) - 1)
        {
            std::cout << board[i][j] << " ";
        }
        std::cout << "\n";
    }
    cout << "\n";
}

/**
 *
 */
int main()
{
    int colors_size = 27; // 27 is reserve for 'ignore'
    int n, m;

    cin >> n >> m;
    cin.ignore();

    vector<map<char, int>> rows_colors(n + 1);
    vector<map<char, int>> cols_colors(m + 1);

    vector<vector<char>> board(n + 1);
    FOR(i, 1, n)
    {
        board[i].reserve(m + 1);
        board[i].push_back(' '); // to have index from '1'
        FOR(j, 1, m)
        {
            char color;
            cin >> color;

            board[i].push_back(color);
            add_color(color, rows_colors[i]);
            add_color(color, cols_colors[j]);
        }
    }

    // std::cout << n << " " << m << "\n";
    // pprint_board(board);

    // cout << "by rows:\n";
    // pprint(rows_colors);

    // cout << "by cols:\n";
    // pprint(cols_colors);

    int solid_row = -1, solid_col = -1;
    char was_color;
    deque<string> actions;
    do
    {
        tie(solid_col, was_color) = find_solid(cols_colors);
        if (solid_col != -1)
        {
            // paint col
            FOR(i, 1, n)
            {
                board[i][solid_col] = color_ignore;
                remove_color(was_color, rows_colors[i]);
            }
            cols_colors[solid_col].clear();

            string action;
            action.reserve(20);
            action.append("K ")
                .append(to_string(solid_col))
                .append(" ");
            action.push_back(was_color);
            actions.push_front(action);
        }
        else
        {
            tie(solid_row, was_color) = find_solid(rows_colors);
            if (solid_row != -1)
            {
                // actions in row
                FOR(j, 1, m)
                {
                    board[solid_row][j] = color_ignore;
                    remove_color(was_color, cols_colors[j]);
                }
                rows_colors[solid_row].clear();

                string action;
                action.reserve(20);
                action.append("R ")
                    .append(to_string(solid_row))
                    .append(" ");
                action.push_back(was_color);
                actions.push_front(action);
            }
        }
    } while (solid_row != -1 || solid_col != -1);

    string sep = "";
    cout << actions.size() << "\n";
    for (string a: actions)
    {
        std::cout << sep << a;
        sep = "\n";
    }
}