#include<bits/stdc++.h> using namespace std; #ifdef LOCAL template <class T, class U> auto &operator<<(ostream &out, pair<T, U> a) { return out << "(" << a.first << ", " << a.second << ")"; } template <class T, class = class enable_if<!is_same<T, string>(), class T::iterator>::type> auto &operator<<(ostream &out, T a) { out << "{"; bool fi = 1; for(auto b : a) { if(fi) {out<<b; fi=0;} else out<<", "<<b; } return out << "}"; } template <class T, class X, class Y> auto &operator<<(ostream &out, const priority_queue<T,X,Y>& a) {auto b = a; vector<T> v; while(!b.empty()) {v.push_back(b.top()); b.pop();} return out<<v; } void dump(){ cerr << "\e[39m"<<"\n"; } template <class T, class... Ts> void dump(T a, Ts... x) { cerr << a << ", "; dump(x...); } #define debug(...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<"\t"<<"[" #__VA_ARGS__ "]: ", dump(__VA_ARGS__) #else #define debug(...) ; #endif template<class C> C reversed(C c) {reverse(c.begin(),c.end()); return c;} #define rep(i, n) for(int i=0;i<(int)(n);i++) #define all(X) (X).begin(), (X).end() #define mp make_pair #define st first #define nd second typedef long long ll; typedef pair<int,int> pii; constexpr int COLORS = 128; struct Operation { char type, color; int no; }; int32_t main(){ ios::sync_with_stdio(false); cin.tie(nullptr); int n, m; cin >> n >> m; vector<vector<char>> picture(n, vector<char>(m)); vector<vector<int>> ct_cols(m, vector<int>(COLORS)); vector<vector<int>> ct_rows(n, vector<int>(COLORS)); vector<int> diff_cols(m); vector<int> diff_rows(n); rep(i, n) rep(j, m) { cin >> picture[i][j]; ct_cols[j][picture[i][j]]++; ct_rows[i][picture[i][j]]++; } rep(i, n) { int diff = 0; rep(j, COLORS) { if (ct_rows[i][j] > 0) { diff++; } } diff_rows[i] = diff; } rep(j, m) { int diff = 0; rep(i, COLORS) { if (ct_cols[j][i] > 0) { diff++; } } diff_cols[j] = diff; } vector<Operation> operations; rep(i, n) { char color = picture[i][0]; bool same = true; rep(j, m) { if (picture[i][j] != color) { same = false; break; } } if (same) { operations.push_back({'R', color, i}); ct_rows[i][color] = 0; diff_rows[i] = 0; } } rep(j, m) { char color = picture[0][j]; bool same = true; rep(i, n) { if (picture[i][j] != color) { same = false; break; } } if (same) { operations.push_back({'K', color, j}); ct_cols[j][color] = 0; diff_cols[j] = 0; } } for (int i = 0;i < operations.size();i++) { if (operations[i].type == 'R') { for (int j = 0;j < m;j++) { ct_cols[j][operations[i].color]--; if (ct_cols[j][operations[i].color] == 0) { diff_cols[j]--; if (diff_cols[j] == 1) { rep (k, COLORS) { if (ct_cols[j][k] > 0) { operations.push_back({'K', (char) k, j}); break; } } } } } } else { for (int j = 0;j < n;j++) { ct_rows[j][operations[i].color]--; if (ct_rows[j][operations[i].color] == 0) { diff_rows[j]--; if (diff_rows[j] == 1) { rep (k, COLORS) { if (ct_rows[j][k] > 0) { operations.push_back({'R', (char) k, j}); break; } } } } } } } cout << operations.size() << endl; while (!operations.empty()) { Operation op = operations.back(); operations.pop_back(); cout << op.type << " " << op.no + 1 << " " << op.color << "\n"; } return 0; }
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 | #include<bits/stdc++.h> using namespace std; #ifdef LOCAL template <class T, class U> auto &operator<<(ostream &out, pair<T, U> a) { return out << "(" << a.first << ", " << a.second << ")"; } template <class T, class = class enable_if<!is_same<T, string>(), class T::iterator>::type> auto &operator<<(ostream &out, T a) { out << "{"; bool fi = 1; for(auto b : a) { if(fi) {out<<b; fi=0;} else out<<", "<<b; } return out << "}"; } template <class T, class X, class Y> auto &operator<<(ostream &out, const priority_queue<T,X,Y>& a) {auto b = a; vector<T> v; while(!b.empty()) {v.push_back(b.top()); b.pop();} return out<<v; } void dump(){ cerr << "\e[39m"<<"\n"; } template <class T, class... Ts> void dump(T a, Ts... x) { cerr << a << ", "; dump(x...); } #define debug(...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<"\t"<<"[" #__VA_ARGS__ "]: ", dump(__VA_ARGS__) #else #define debug(...) ; #endif template<class C> C reversed(C c) {reverse(c.begin(),c.end()); return c;} #define rep(i, n) for(int i=0;i<(int)(n);i++) #define all(X) (X).begin(), (X).end() #define mp make_pair #define st first #define nd second typedef long long ll; typedef pair<int,int> pii; constexpr int COLORS = 128; struct Operation { char type, color; int no; }; int32_t main(){ ios::sync_with_stdio(false); cin.tie(nullptr); int n, m; cin >> n >> m; vector<vector<char>> picture(n, vector<char>(m)); vector<vector<int>> ct_cols(m, vector<int>(COLORS)); vector<vector<int>> ct_rows(n, vector<int>(COLORS)); vector<int> diff_cols(m); vector<int> diff_rows(n); rep(i, n) rep(j, m) { cin >> picture[i][j]; ct_cols[j][picture[i][j]]++; ct_rows[i][picture[i][j]]++; } rep(i, n) { int diff = 0; rep(j, COLORS) { if (ct_rows[i][j] > 0) { diff++; } } diff_rows[i] = diff; } rep(j, m) { int diff = 0; rep(i, COLORS) { if (ct_cols[j][i] > 0) { diff++; } } diff_cols[j] = diff; } vector<Operation> operations; rep(i, n) { char color = picture[i][0]; bool same = true; rep(j, m) { if (picture[i][j] != color) { same = false; break; } } if (same) { operations.push_back({'R', color, i}); ct_rows[i][color] = 0; diff_rows[i] = 0; } } rep(j, m) { char color = picture[0][j]; bool same = true; rep(i, n) { if (picture[i][j] != color) { same = false; break; } } if (same) { operations.push_back({'K', color, j}); ct_cols[j][color] = 0; diff_cols[j] = 0; } } for (int i = 0;i < operations.size();i++) { if (operations[i].type == 'R') { for (int j = 0;j < m;j++) { ct_cols[j][operations[i].color]--; if (ct_cols[j][operations[i].color] == 0) { diff_cols[j]--; if (diff_cols[j] == 1) { rep (k, COLORS) { if (ct_cols[j][k] > 0) { operations.push_back({'K', (char) k, j}); break; } } } } } } else { for (int j = 0;j < n;j++) { ct_rows[j][operations[i].color]--; if (ct_rows[j][operations[i].color] == 0) { diff_rows[j]--; if (diff_rows[j] == 1) { rep (k, COLORS) { if (ct_rows[j][k] > 0) { operations.push_back({'R', (char) k, j}); break; } } } } } } } cout << operations.size() << endl; while (!operations.empty()) { Operation op = operations.back(); operations.pop_back(); cout << op.type << " " << op.no + 1 << " " << op.color << "\n"; } return 0; } |