CodeForces 631B Print Check

题意：给你一个NXM的矩阵，一开始元素都为0，然后有两种操作，一种是将某一行的数变为一个数，另外一种是将某一列的数变为一个数，问最后的矩阵是怎么样的。

思路：只有最后一个操作有用，那么记录一下时间戳就可以了

#include <cstdio>
#include <queue>
#include <cstring>
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <set>
#include <ctime>
#include <cmath>
//#include<utility>
#include <cctype>
using namespace std;
const int maxn= 5005;
#define LL long long
int cas=1,T;
pair<int,int>r[maxn],c[maxn];
int main()
{
	int n,m,k;
	scanf("%d%d%d",&n,&m,&k);
	for (int i = 1;i<=n;i++)
		r[i]=make_pair(0,0);
	for (int i = 1;i<=m;i++)
		c[i]=make_pair(0,0);
	for (int i = 1;i<=k;i++)
	{
		int x,y,z;
		scanf("%d%d%d",&x,&y,&z);
		if (x==1)
			r[y]=make_pair(z,i);
		else
			c[y]=make_pair(z,i);
	}
	for (int i = 1;i<=n;i++)
	{
		for (int j = 1;j<=m;j++)
		{
			if (r[i].first==0 && c[j].first==0)
				printf("0 ");
			else if (r[i].first==0)
				printf("%d ",c[j].first);
			else if (c[j].first==0)
				printf("%d ",r[i].first);
			else if (r[i].second>c[j].second)
				printf("%d ",r[i].first);
			else 
				printf("%d ",c[j].first);
		}
		printf("\n");
	}
	//freopen("in","r",stdin);
	//scanf("%d",&T);
	//printf("time=%.3lf",(double)clock()/CLOCKS_PER_SEC);
	return 0;
}

Description

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 size n × m. Consider the list as a table consisting of n rows and m columns. Rows are numbered from top to bottom with integers from 1 to n, while columns are numbered from left to right with integers from 1 to m. Initially, all cells are painted in color 0.

Your program has to support two operations:

1. Paint all cells in row r_i in color a_i;
2. Paint all cells in column c_i in color a_i.

If during some operation i there is a cell that have already been painted, the color of this cell also changes to a_i.

Your program has to print the resulting table after k operation.

Input

The first line of the input contains three integers n, m and k (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 r_i a_i (1 ≤ r_i ≤ n, 1 ≤ a_i ≤ 10⁹), means that row r_i is painted in color a_i;
• 2 c_i a_i (1 ≤ c_i ≤ m, 1 ≤ a_i ≤ 10⁹), means that column c_i is painted in color a_i.

Output

Print n lines containing m integers each — the resulting table after all operations are applied.

Sample Input

Input

3 3 3
1 1 3
2 2 1
1 2 2

Output

3 1 3 
2 2 2 
0 1 0 

Input

5 3 5
1 1 1
1 3 1
1 5 1
2 1 1
2 3 1

Output

1 1 1 
1 0 1 
1 1 1 
1 0 1 
1 1 1 

Hint

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.