codeforces 631B (STL set)

B. Print Check
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

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 ri in color ai;
  2. Paint all cells in column ci in color ai.

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

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

Input

The first line of the input contains three integers nm and k (1  ≤  n,  m  ≤ 5000n·m ≤ 100 0001 ≤ 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:

  • ri ai (1 ≤ ri ≤ n1 ≤ ai ≤ 109), means that row ri is painted in color ai;
  • ci ai (1 ≤ ci ≤ m1 ≤ ai ≤ 109), means that column ci is painted in color ai.
Output

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

Examples
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 
Note

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.



给n行m列染色,1表示给行染2表示给列染,求最后的图。
从后往前染色,维护当前存在的行和列。
<span style="font-size:10px;">#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <set>
using namespace std;
#define maxn 5111

set <int> line, column;
int n, m, k;
int mp[maxn][maxn];
int a[111111][3];
set<int>::iterator it;

int main () {
	scanf ("%d%d%d", &n, &m, &k);
	memset (mp, 0, sizeof mp);
	for (int i = 1; i <= k; i++) {
		scanf ("%d%d%d", &a[i][0], &a[i][1], &a[i][2]);
	}
	line.clear (), column.clear ();
	for (int i = 1; i <= n; i++)
		line.insert (i);
	for (int i = 1; i <= m; i++)
		column.insert (i);
	for (int i = k; i >= 1; i--) {
		if (a[i][0] == 1) {
			if (line.count (a[i][1]) == 0)
				continue;
			line.erase (a[i][1]);
			for (it = column.begin (); it != column.end (); it++) {
				mp[a[i][1]][*it] = a[i][2];
			}
		}
		else {
			if (column.count (a[i][1]) == 0)
				continue;
			column.erase (a[i][1]);
			for (it = line.begin (); it != line.end (); it++) {
				mp[*it][a[i][1]] = a[i][2];
			}
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			printf ("%d%c", mp[i][j], j == m ? '\n':' ');
		}
	}
	return 0;
}</span>


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值