#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>

using namespace std;
typedef pair<int, int> PII;

const int N = 100005;

PII a[N], b[N];

int main(){
    int T;
    scanf("%d", &T);
    while (T -- ){
        int n, m, q;
        for (int i = 1; i <= n; i ++ ) a[i] = {0, 0};
        for (int j = 1; j <= m; j ++ ) b[j] = {0, 0};
        scanf("%d%d%d", &n, &m, &q);
        for (int i = 1; i <= q; i ++ ){
            int op, x, color;
            scanf("%d%d%d", &op, &x, &color);
            if (!op) a[x] = {i, color};
            else b[x] = {i, color};
        }
        
        for (int i = 1; i <= n; i ++ ){
            for (int j = 1; j <= m; j ++ ){
                printf("%d ", max(a[i], b[j]).second);
            }
            puts("");
        }
    }
    
    return 0;
}

看各位巨佬的代码都好长，看着我35行的代码陷入了沉思（）

不会爆吧（）