constint N = 5000010; int n, m, k; // r[i]存储第i行是否被翻转过 // c[i]存储第i列是否被翻转过 bool r[N], c[N];
intmain() { cin >> n >> m >> k; for (int i = 0; i < k; i ++) { char op; int num; cin >> op >> num; if (op == 'R') r[num] = !r[num]; elseif (op == 'C') c[num] = !c[num]; }
int res = 0; // 直接暴力遍历整个矩阵 for (int i = 1; i <= n; i ++) for (int j = 1; j <= m; j ++) if (r[i] != c[j]) res ++; cout << res << endl; return0; }
if __name__ == '__main__': n = int(input()) m = int(input()) k = int(input()) r = [0for _ inrange(n + 1)] c = [0for _ inrange(m + 1)] for i inrange(k): opnum = list(map(str, input().split(' '))) op = opnum[0] num = int(opnum[1]) if op == 'R': r[num] += 1 elif op == 'C': c[num] += 1
res = 0 for i inrange(1, n + 1): for j inrange(1, m + 1): if (r[i] + c[j]) & 1: res += 1 print(res)