Kris works in a large company "Blake Technologies". As a best engineer of the company he was assigned a task to develop a printer that will be able to print horizontal and vertical strips. First prototype is already built and Kris wants to tests it. He wants you to implement the program that checks the result of the printing.
Printer works with a rectangular sheet of paper of sizen × m. Consider the list as a table consisting ofn rows andm columns. Rows are numbered from top to bottom with integers from1 ton, while columns are numbered from left to right with integers from1 tom. Initially, all cells are painted in color0.
Your program has to support two operations:
- Paint all cells in row ri in colorai;
- Paint all cells in column ci in colorai.
If during some operation i there is a cell that have already been painted, the color of this cell also changes toai.
Your program has to print the resulting table afterk operation.
The first line of the input contains three integersn,m andk (1 ≤ n, m ≤ 5000,n·m ≤ 100 000,1 ≤ k ≤ 100 000) — the dimensions of the sheet and the number of operations, respectively.
Each of the next k lines contains the description of exactly one query:
- 1 ri ai (1 ≤ ri ≤ n,1 ≤ ai ≤ 109), means that rowri is painted in colorai;
- 2 ci ai (1 ≤ ci ≤ m,1 ≤ ai ≤ 109), means that columnci is painted in colorai.
Print n lines containingm integers each — the resulting table after all operations are applied.
3 3 3
1 1 3
2 2 1
1 2 2
3 1 3
2 2 2
0 1 0
5 3 5
1 1 1
1 3 1
1 5 1
2 1 1
2 3 1
1 1 1
1 0 1
1 1 1
1 0 1
1 1 1
The figure below shows all three operations for the first sample step by step. The cells that were painted on the corresponding step are marked gray.
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int clo[100000+20];
int r[100000+20], l[100000+20];
int main()
{
int n, m, k;
scanf("%d%d%d", &n, &m, &k);
int step, wh;
memset(clo, 0, sizeof(clo));
for(int i = 1; i <= k; i++) {
scanf("%d%d%d", &step, &wh, &clo[i]);
if(step == 1)
r[wh-1] = i;
else
l[wh-1] = i;
}
for(int i = 0; i < n; i++) {
for(int j = 0; j < m; j++) {
if(j != m-1)
printf("%d ", clo[max(r[i], l[j])]);
else
printf("%d\n", clo[max(r[i], l[j])]);
}
}
return 0;
}