Codeforces Round #663 (Div. 2) B. Fix You

题目链接

思路：

将每一行最后一个变成D，最后一行全部变成R即可。

代码：

#include
#define int long long
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const int N=1e5+3;
const int M=2e4+5;
const double eps=1e-8;
const int mod=998244353;
const int inf=0x7fffffff;
const double pi=3.1415926;
using namespace std;
signed main()
{
    IOS;
    int t;
    cin >> t;
    while(t--)
    {
        int x=0,y=1;
        int n,m,sum = 0;
        cin >> n >> m;
        char str[n+5][m+5];
        for(int i = 1;i <= n;i++)
            for(int j = 1;j <= m;j++)
                cin >> str[i][j];
        for(int i = 1;i <= n-1;i++)
            if(str[i][m] == 'R')
                str[i][m] = 'D',sum++;
        for(int i = 1;i < m;i++)
            if(str[n][i] == 'D')
                str[n][i] = 'R',sum++;
        cout << sum << endl;
    }
    return 0;
}