Codeforces Round #344 (Div. 2) B. Print Check_codeforces round #344 (div. 2)b. print check-CSDN博客

本文链接：https://blog.csdn.net/acm_fighting/article/details/50944856

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:

Paint all cells in row ri in color ai;
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 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 ri ai (1 ≤ ri ≤ n, 1 ≤ ai ≤ 109), means that row ri is painted in color ai;
2 ci ai (1 ≤ ci ≤ m, 1 ≤ 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.

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一开始全是0的矩阵，q次询问,每次询问给你三个字母 op,a,b

将第a行变成b

将第a列变成b

输出最后的矩阵

思路:记录这一行最后的操作,这一列最后的操作和他们分别对应第几个操作,输出矩阵的i,j时,只要判断行和列哪个后操作便可以了。

#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <ctime>
#include <vector>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
#define INF 0x3f3f3f3f
#define inf -0x3f3f3f3f
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define mem0(a) memset(a,0,sizeof(a))
#define mem1(a) memset(a,-1,sizeof(a))
#define mem(a, b) memset(a, b, sizeof(a))
const int maxn=5010;
int mp[maxn][maxn];
struct node{
    int num;
    int id;
}row[maxn],col[maxn];

int main(){
    int n,m,k;
    scanf("%d%d%d",&n,&m,&k);
    int op,num,ci;
    for(int i=1;i<=k;i++){
        scanf("%d%d%d",&op,&num,&ci);
        if(op==1)
            row[num].num=ci,row[num].id=i;
        else
            col[num].num=ci,col[num].id=i;
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            if(j==1){
                if(row[i].num==0&&col[j].num==0)
                    printf("0");
                else
                    printf("%d",row[i].id>col[j].id?row[i].num:col[j].num);
            }
            else{
                if(row[i].num==0&&col[j].num==0)
                    printf(" 0");
                else
                    printf(" %d",row[i].id>col[j].id?row[i].num:col[j].num);
            }
        }
        printf("\n");
    }
    return 0;
}