85分求助！！急！！（望大佬来看）

#include <bits/stdc++.h>
using namespace std;
int n, m, q, i_, j_, t, a[105][105][4], b[105][105][4];
long long c;
bool flag;
int main(){
	cin >> n >> m >> q;
	for (int w = 0; w < q; w++){
		cin >> i_ >> j_ >> t >> c;
		a[i_][j_][t] += c % 256;
		if (m == 1){
			cout << "Yes" << endl;
			continue;
		}
		for (int i = 1; i <= n; i++)
			for (int j = m / 2, s = 1; j >= 1; j--, s++)
				for (int k = 1; k <= 3; k++)b[i][s][k] = a[i][j][k];
		for (int i = 1; i <= n; i++)
			for (int j = m / 2 + 1 + m % 2, s = 1; j <= m; j++, s++)
				for (int k = 1; k <= 3; k++)if (a[i][j][k] != b[i][s][k])flag = 1;
		if (flag)cout << "No" << endl;
		else cout << "Yes" << endl;
		flag = 0;
	}
	return 0;
}