二维数组+和

https://codeforces.com/problemset/problem/2055/C

#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define lowbit(x)  x&(-x)
using ll = long long;
using pii = pair<int, int>;
const double PI = acos(-1);
const int N = 1e3 + 10;
const int mod = 1e9 + 7;
ll a[N][N];
void solve() {
	int n,m;cin>>n>>m;
	string s;cin>>s;
	s+='R';
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			cin>>a[i][j];
	vector<ll> l(m+1),r(n+1);
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++){
			r[i]+=a[i][j];
			l[j]+=a[i][j];
		}
	int x=1,y=1;
	for(int i=0;i<s.size();i++){
		if(s[i]=='R'){
			a[x][y]=-l[y];
			r[x]+=a[x][y];
			y++;
		}
		else{
			a[x][y]=-r[x];
			l[y]+=a[x][y];
			x++;
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++)
			cout<<a[i][j]<<" ";
		cout<<endl;
	}
}
int main() {
//	ios::sync_with_stdio(false);
//	cin.tie(nullptr), cout.tie(nullptr);
	
	int T = 1;
	cin>>T;
	while (T--) {
		solve();
	}
	
	return 0;
}