1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33
| #include<bits/stdc++.h> using namespace std; #define N 100010 int h[N], l[N], ht[N], lt[N]; int n, m, t, q; int opt, x, c; int main() { scanf("%d", &t); while (t--) { scanf("%d%d%d", &n, &m, &q); memset(h, 0, sizeof(int) * (n + 1)); memset(l, 0, sizeof(int) * (m + 1)); memset(ht, 0, sizeof(int) * (n + 1)); memset(lt, 0, sizeof(int) * (m + 1)); for (int i = 1; i <= q; ++i) { scanf("%d%d%d", &opt, &x, &c); if (opt) { l[x] = c; lt[x] = i; } else { h[x] = c; ht[x] = i; } } for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { printf("%d ", (ht[i] > lt[j]? h[i] : l[j])); } putchar('\n'); } } return 0; }
|