关于T1我没乘cf而丢失的6分

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 1010, mod = 998244353;
int T, id, n, m, c, f, ansc, ansf, len;
bool s[N][N];
int heng[N];

void solve(int n, int m, int c, int f)
{
	memset(heng, 0, sizeof heng);
	if (c == 0 && f == 0) return;
	for (int j = 1; j <= m; j ++ )
	{
		for (int i = 1; i <= n; i ++ )
			if (!heng[i])
				for (int k = j; k <= m; k ++ )
					if (!s[i][k]) heng[i] ++ ;
					else break;
			else heng[i] -- ;
		for (int i = 1; i <= n; i ++ )
		{
			len = 0;
			while (!s[i + len][j]) len ++ ;
			for (int k = 2; k < len; k ++ )
			{
				if (heng[i] >= 2 && heng[i + k] >= 2)
				{
					ansc = (ansc + (heng[i] - 1) * (heng[i + k] - 1)) % mod;
					ansf = (ansf + (heng[i] - 1) * (heng[i + k] - 1) * (len - k - 1)) % mod;
				}
			}
		}
	}
}
int main()
{
	//freopen("plant.in", "r", stdin);
	//freopen("plant.out", "w", stdout);
	scanf("%d%d", &T, &id);
	while (T -- )
	{
		ansc = ansf = 0;
		memset(s, true, sizeof s);
		scanf("%d%d%d%d", &n, &m, &c, &f);
		for (int i = 1; i <= n; i ++ )
			for (int j = 1; j <= m; j ++ )
			{
				char a;
				cin >> a;
				s[i][j] = a - '0';
			}
		solve(n, m, c, f);
		printf("%d %d\n", ansc, ansf);
	}
	return 0;
}