| |
| |
| |
| |
| |
| |
| |
| #include <bits/stdc++.h> |
| |
| using namespace std; |
| |
| int cntDiff(vector<string> &info, int row1, int row2) { |
| int cnt = 0; |
| for (int i = 0; i <= row1; ++i) { |
| for (int j = 0; j < info[i].size(); ++j) { |
| if (info[i][j] != 'W') { |
| ++cnt; |
| } |
| } |
| } |
| |
| for (int i = row1 + 1; i <= row2; ++i) { |
| for (int j = 0; j < info[i].size(); ++j) { |
| if (info[i][j] != 'B') { |
| ++cnt; |
| } |
| } |
| } |
| |
| for (int i = row2 + 1; i < info.size(); ++i) { |
| for (int j = 0; j < info[i].size(); ++j) { |
| if (info[i][j] != 'R') { |
| ++cnt; |
| } |
| } |
| } |
| return cnt; |
| } |
| |
| int getMinCnt(vector<string> &info) { |
| int res = INT_MAX; |
| |
| for (int i = 0; i < info.size(); ++i) { |
| for (int j = i + 1; j < info.size() - 1; ++j) { |
| res = min(res, cntDiff(info, i, j)); |
| } |
| } |
| return res; |
| } |
| |
| int main() { |
| ios::sync_with_stdio(false); |
| cin.tie(0); |
| |
| int n, m; |
| cin >> n >> m; |
| |
| vector<string> info(n); |
| for (int i = 0; i < n; ++i) { |
| cin >> info[i]; |
| } |
| int res = getMinCnt(info); |
| cout << res << endl; |
| |
| return 0; |
| } |
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· 被坑几百块钱后,我竟然真的恢复了删除的微信聊天记录!
· 没有Manus邀请码?试试免邀请码的MGX或者开源的OpenManus吧
· 【自荐】一款简洁、开源的在线白板工具 Drawnix
· 园子的第一款AI主题卫衣上架——"HELLO! HOW CAN I ASSIST YOU TODAY
· Docker 太简单,K8s 太复杂?w7panel 让容器管理更轻松!