基础题 CodeForces - 631B Print Check

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 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:

  1. Paint all cells in row ri in colorai;
  2. 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.

Input

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:

  • ri ai (1 ≤ ri ≤ n,1 ≤ ai ≤ 109), means that rowri is painted in colorai;
  • ci ai (1 ≤ ci ≤ m,1 ≤ ai ≤ 109), means that columnci is painted in colorai.
Output

Print n lines containingm 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.


题目意思:原始矩阵为0,每个操作都会给某一行或某一列涂上一种数字,最后输出整个矩阵。
复杂度有1e5*5000,若暴力会超时。仔细想一下发现其实对于每个点(x, y),决定其最终状态的是最后x行y列的改变,因此只需求出对于每个点最终改变它的行或列即可得出答案。
解此题关键在于推敲每个操作前后会有什么变化,根据状态找出最优解法。

#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;
}



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值