#include<bits/stdc++.h> #define pb push_back #define pob pop_back #define eb emplace_back #define fi first #define se second #define turbo ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); #define mid ((l+r)/2) #define midLL ((l+r)/2LL) #define mide ((lo+hi)/2) #define mideLL ((lo+hi)/2LL) #define endl '\n' #define random_shuffle shandom_ruffle #define lowbit(x) x&(-x) #define bits(x) __builtin_popcount(x) #define mins(se) (*se.begin()) #define maxs(se) (*--se.end()) #define all(x) x.begin(), x.end() #define log2_floor(i) (i ? __builtin_clzll(1) - __builtin_clzll(i) : -1) #define siz(cont) ((int)cont.size()) #define each(it, cont) for(auto &it : cont) using ll = long long; using pii = std::pair<int, int>; using pll = std::pair<ll, ll>; using pli = std::pair<ll, int>; using pil = std::pair<int, ll>; using vll = std::vector<pll>; using vii = std::vector<pii>; using vi = std::vector<int>; using vl = std::vector<ll>; using vvl = std::vector<vl>; using vvi = std::vector<vi>; using vvii = std::vector<vii>; using vli = std::vector<pli>; using vvli = std::vector<vli>; using vil = std::vector<pil>; using vvil = std::vector<vil>; using vc = std::vector<char>; using vvc = std::vector<std::vector<char>>; using vb = std::vector<bool>; using vvb = std::vector<vb>; void err() { std::cout << "\n"; fflush(stdout); } template<class T, class... Ts> void err(T arg, Ts &... args) { std::cout << arg << ' '; err(args...); } using namespace std; struct senko { char rk; int nr; char kol; senko(char rk, int nr, char kol): rk(rk), nr(nr), kol(kol) {} }; constexpr int CL = 0; constexpr int RW = 1; int n, m; queue<pii> q; vector<string> v; vvi row, col; vb vrow, vcol; vector<senko> ans; bool git(vi &ve) { int res = 0; for (auto it : ve) if (it) res++; return res == 1; } int color(vi &ve) { for (int i = 0; i < 26; i++) if (ve[i]) return i; return -1; } void mcol(int nr) { if (git(col[nr]) and !vcol[nr]) { vcol[nr] = true; q.push({CL, nr}); } } void mrow(int nr) { if (git(row[nr]) and !vrow[nr]) { vrow[nr] = true; q.push({RW, nr}); } } void yrow(int nr) { for (int i = 0; i < m; i++) if (v[nr][i] != '#') { col[i][v[nr][i]-'A']--; v[nr][i] = '#'; mcol(i); } } void ycol(int nr) { for (int i = 0; i < n; i++) if (v[i][nr] != '#') { row[i][v[i][nr]-'A']--; v[i][nr] = '#'; mrow(i); } } void add_ans(int co, int nr) { char clr = 'A' + (co == RW ? color(row[nr]) : color(col[nr])); ans.pb({(co == RW ? 'R' : 'K'), nr+1, clr}); } signed main() { turbo; cin >> n >> m; v = vector<string>(n); row = vvi(n, vi(26)); col = vvi(m, vi(26)); vrow = vb(n); vcol = vb(m); for (auto &it : v) cin >> it; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) { row[i][v[i][j]-'A']++; col[j][v[i][j]-'A']++; } for (int i = 0; i < n; i++) mrow(i); for (int i = 0; i < m; i++) mcol(i); while (!q.empty()) { auto [co, nr] = q.front(); q.pop(); if (color(co == RW ? row[nr] : col[nr]) == -1) continue; add_ans(co, nr); if (co == RW) yrow(nr); else ycol(nr); } reverse(all(ans)); cout << siz(ans) << endl; for (auto [a, b, c] : ans) cout << a << ' ' << b << ' ' << c << endl; }
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> #define pb push_back #define pob pop_back #define eb emplace_back #define fi first #define se second #define turbo ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); #define mid ((l+r)/2) #define midLL ((l+r)/2LL) #define mide ((lo+hi)/2) #define mideLL ((lo+hi)/2LL) #define endl '\n' #define random_shuffle shandom_ruffle #define lowbit(x) x&(-x) #define bits(x) __builtin_popcount(x) #define mins(se) (*se.begin()) #define maxs(se) (*--se.end()) #define all(x) x.begin(), x.end() #define log2_floor(i) (i ? __builtin_clzll(1) - __builtin_clzll(i) : -1) #define siz(cont) ((int)cont.size()) #define each(it, cont) for(auto &it : cont) using ll = long long; using pii = std::pair<int, int>; using pll = std::pair<ll, ll>; using pli = std::pair<ll, int>; using pil = std::pair<int, ll>; using vll = std::vector<pll>; using vii = std::vector<pii>; using vi = std::vector<int>; using vl = std::vector<ll>; using vvl = std::vector<vl>; using vvi = std::vector<vi>; using vvii = std::vector<vii>; using vli = std::vector<pli>; using vvli = std::vector<vli>; using vil = std::vector<pil>; using vvil = std::vector<vil>; using vc = std::vector<char>; using vvc = std::vector<std::vector<char>>; using vb = std::vector<bool>; using vvb = std::vector<vb>; void err() { std::cout << "\n"; fflush(stdout); } template<class T, class... Ts> void err(T arg, Ts &... args) { std::cout << arg << ' '; err(args...); } using namespace std; struct senko { char rk; int nr; char kol; senko(char rk, int nr, char kol): rk(rk), nr(nr), kol(kol) {} }; constexpr int CL = 0; constexpr int RW = 1; int n, m; queue<pii> q; vector<string> v; vvi row, col; vb vrow, vcol; vector<senko> ans; bool git(vi &ve) { int res = 0; for (auto it : ve) if (it) res++; return res == 1; } int color(vi &ve) { for (int i = 0; i < 26; i++) if (ve[i]) return i; return -1; } void mcol(int nr) { if (git(col[nr]) and !vcol[nr]) { vcol[nr] = true; q.push({CL, nr}); } } void mrow(int nr) { if (git(row[nr]) and !vrow[nr]) { vrow[nr] = true; q.push({RW, nr}); } } void yrow(int nr) { for (int i = 0; i < m; i++) if (v[nr][i] != '#') { col[i][v[nr][i]-'A']--; v[nr][i] = '#'; mcol(i); } } void ycol(int nr) { for (int i = 0; i < n; i++) if (v[i][nr] != '#') { row[i][v[i][nr]-'A']--; v[i][nr] = '#'; mrow(i); } } void add_ans(int co, int nr) { char clr = 'A' + (co == RW ? color(row[nr]) : color(col[nr])); ans.pb({(co == RW ? 'R' : 'K'), nr+1, clr}); } signed main() { turbo; cin >> n >> m; v = vector<string>(n); row = vvi(n, vi(26)); col = vvi(m, vi(26)); vrow = vb(n); vcol = vb(m); for (auto &it : v) cin >> it; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) { row[i][v[i][j]-'A']++; col[j][v[i][j]-'A']++; } for (int i = 0; i < n; i++) mrow(i); for (int i = 0; i < m; i++) mcol(i); while (!q.empty()) { auto [co, nr] = q.front(); q.pop(); if (color(co == RW ? row[nr] : col[nr]) == -1) continue; add_ans(co, nr); if (co == RW) yrow(nr); else ycol(nr); } reverse(all(ans)); cout << siz(ans) << endl; for (auto [a, b, c] : ans) cout << a << ' ' << b << ' ' << c << endl; } |