#include<bits/stdc++.h> //#pragma GCC optimize("Ofast") //#pragma GCC optimize("trapv") #define st first #define nd second #define pb push_back #define pp pop_back #define eb emplace_back #define mp(a, b) make_pair(a, b) #define all(x) (x).begin(), (x).end() #define rev(x) reverse(all(x)) #define sor(x) sort(all(x)) #define sz(x) (int)(x).size() #define rsz(x) resize(x) using namespace std; ///~~~~~~~~~~~~~~~~~~~~~~~~~~ template <typename H, typename T> ostream& operator<<(ostream& os, pair<H, T> m){ return os <<"("<< m.st<<", "<<m.nd<<")"; } template <typename H> ostream& operator<<(ostream& os, vector<H> V){ os<<"{"; for(int i=0; i<V.size(); i++){ if(i)os<<" "; os<<V[i]; } os<<"}"; return os; } void debug(){cerr<<"\n";} template <typename H, typename... T> void debug(H h, T... t) {cerr<<h; if (sizeof...(t)) cerr << ", "; debug(t...);} #define deb(x...) cerr<<#x<<" = ";debug(x); ///~~~~~~~~~~~~~~~~~~~~~~~~~ typedef long long ll; typedef long double ld; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef vector<int> vi; typedef vector<pii > vii; typedef vector<ll> vl; typedef vector<pll> vll; typedef string str; #define BOOST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count()); const int N=2e3+5, INF=1e9+5, mod=1e9+7, A=26; int tab[N][N]; int ile[N][A], ile2[N][A]; int main(){ //BOOST; int n, m; cin>>n>>m; for(int i=0; i<n; i++){ str s; cin>>s; for(int j=0; j<m; j++){ tab[i][j]=s[j]-'A'; ile[i][s[j]-'A']++; ile2[j][s[j]-'A']++; } } vector<pair<pii, char>> ans; while(true){ bool b=0; for(int i=0; i<n; i++){ int s=0, M=0; for(int j=0; j<A; j++){ s+=ile[i][j]; M=max(ile[i][j], M); } //deb(i, s, M); if(s>0 && s==M){ //deb(); for(int j=0; j<A; j++){ if(ile[i][j]){ ans.pb({{0, i}, j+'A'}); } } for(int j=0; j<m; j++){ if(tab[i][j]!=-1){ ile[i][tab[i][j]]--; ile2[j][tab[i][j]]--; } tab[i][j]=-1; } b=1; break; } } if(b==1)continue; for(int j=0; j<m; j++){ int s=0, M=0; for(int i=0; i<A; i++){ s+=ile2[j][i]; M=max(ile2[j][i], M); } if(s>0 && s==M){ for(int i=0; i<A; i++){ if(ile2[j][i]){ ans.pb({{1, j}, i+'A'}); } } for(int i=0; i<n; i++){ if(tab[i][j]!=-1){ ile[i][tab[i][j]]--; ile2[j][tab[i][j]]--; } tab[i][j]=-1; } b=1; break; } } if(b==0)break; } rev(ans); cout<<ans.size()<<"\n"; for(auto i:ans){ cout<<"RK"[i.st.st]<<" "<<i.st.nd+1<<" "<<i.nd<<"\n"; } }
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 | #include<bits/stdc++.h> //#pragma GCC optimize("Ofast") //#pragma GCC optimize("trapv") #define st first #define nd second #define pb push_back #define pp pop_back #define eb emplace_back #define mp(a, b) make_pair(a, b) #define all(x) (x).begin(), (x).end() #define rev(x) reverse(all(x)) #define sor(x) sort(all(x)) #define sz(x) (int)(x).size() #define rsz(x) resize(x) using namespace std; ///~~~~~~~~~~~~~~~~~~~~~~~~~~ template <typename H, typename T> ostream& operator<<(ostream& os, pair<H, T> m){ return os <<"("<< m.st<<", "<<m.nd<<")"; } template <typename H> ostream& operator<<(ostream& os, vector<H> V){ os<<"{"; for(int i=0; i<V.size(); i++){ if(i)os<<" "; os<<V[i]; } os<<"}"; return os; } void debug(){cerr<<"\n";} template <typename H, typename... T> void debug(H h, T... t) {cerr<<h; if (sizeof...(t)) cerr << ", "; debug(t...);} #define deb(x...) cerr<<#x<<" = ";debug(x); ///~~~~~~~~~~~~~~~~~~~~~~~~~ typedef long long ll; typedef long double ld; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef vector<int> vi; typedef vector<pii > vii; typedef vector<ll> vl; typedef vector<pll> vll; typedef string str; #define BOOST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count()); const int N=2e3+5, INF=1e9+5, mod=1e9+7, A=26; int tab[N][N]; int ile[N][A], ile2[N][A]; int main(){ //BOOST; int n, m; cin>>n>>m; for(int i=0; i<n; i++){ str s; cin>>s; for(int j=0; j<m; j++){ tab[i][j]=s[j]-'A'; ile[i][s[j]-'A']++; ile2[j][s[j]-'A']++; } } vector<pair<pii, char>> ans; while(true){ bool b=0; for(int i=0; i<n; i++){ int s=0, M=0; for(int j=0; j<A; j++){ s+=ile[i][j]; M=max(ile[i][j], M); } //deb(i, s, M); if(s>0 && s==M){ //deb(); for(int j=0; j<A; j++){ if(ile[i][j]){ ans.pb({{0, i}, j+'A'}); } } for(int j=0; j<m; j++){ if(tab[i][j]!=-1){ ile[i][tab[i][j]]--; ile2[j][tab[i][j]]--; } tab[i][j]=-1; } b=1; break; } } if(b==1)continue; for(int j=0; j<m; j++){ int s=0, M=0; for(int i=0; i<A; i++){ s+=ile2[j][i]; M=max(ile2[j][i], M); } if(s>0 && s==M){ for(int i=0; i<A; i++){ if(ile2[j][i]){ ans.pb({{1, j}, i+'A'}); } } for(int i=0; i<n; i++){ if(tab[i][j]!=-1){ ile[i][tab[i][j]]--; ile2[j][tab[i][j]]--; } tab[i][j]=-1; } b=1; break; } } if(b==0)break; } rev(ans); cout<<ans.size()<<"\n"; for(auto i:ans){ cout<<"RK"[i.st.st]<<" "<<i.st.nd+1<<" "<<i.nd<<"\n"; } } |