codeforces 631B Print Check
来源:互联网 发布:ai软件卡通图片 编辑:程序博客网 时间:2024/05/29 16:59
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 from1 to n, while columns are numbered from left to right with integers from1 to m. 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 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 rowri is painted in colorai;
- 2 ci ai (1 ≤ ci ≤ m,1 ≤ ai ≤ 109), means that columnci is painted in colorai.
Output
Print n lines containing m integers each — the resulting table after all operations are applied.
Sample Input
3 3 31 1 32 2 11 2 2
3 1 3 2 2 2 0 1 0
5 3 51 1 11 3 11 5 12 1 12 3 1
1 1 1 1 0 1 1 1 1 1 0 1 1 1 1
Sample Output
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.
#include<stdio.h>#include<string.h>#include<math.h>#include<algorithm>using namespace std;int a[5010][5010];struct myk{int num;int bianhao;};int m,n,k;myk zuizhonghang[5010],zuizhonglie[5010];void paint(int cixu,int x,int i,int j){ if(x==1) { zuizhonghang[i].num=j; zuizhonghang[i].bianhao=cixu; } if(x==2) { zuizhonglie[i].num=j; zuizhonglie[i].bianhao=cixu; }}int main(void){ int aa,b,c; scanf("%d%d%d",&n,&m,&k); memset(a,0,sizeof(a)); for(int i=1;i<=5000;i++) { zuizhonghang[i].bianhao=0; zuizhonglie[i].bianhao=0; } for(int i=1;i<=k;i++) { scanf("%d%d%d",&aa,&b,&c); paint(i,aa,b,c); } for(int i=1;i<=n;i++) { for(int j=1;j<=m;j++) { if((zuizhonghang[i].bianhao==0)&&(zuizhonglie[j].bianhao==0)) a[i][j]=0; else a[i][j]=(zuizhonghang[i].bianhao>zuizhonglie[j].bianhao)?zuizhonghang[i].num:zuizhonglie[j].num; printf("%d ",a[i][j]); } printf("\n"); } return 0;}
- codeforces 631B Print Check
- codeforces 631B Print Check
- CodeForces 631B Print Check
- codeforces 631B Print Check
- Codeforces 631B Print Check 【思维】
- Codeforces 631B Print Check【模拟】
- Codeforces 631 B Print Check【思维】
- codeforces 631B Print Check模拟
- 【Codeforces 631 B Print Check 】+ 简单构造
- 基础题 CodeForces - 631B Print Check
- CodeForces 631 B.Print Check(水~)
- CodeForces 631B B. Print Check(水题水题)
- codeforces 344 B. Print Check解题报告
- Codeforces Round #344 (Div. 2) B. Print Check【思维】
- Codeforces Round #344 (Div. 2) B. Print Check
- Codeforces Round #344 (Div. 2) B. Print Check (模拟)
- Print Check CodeForces
- Codeforces Round #344 (Div. 2)-B. Print Check(贪心+模拟)
- codeforces_612D. The Union of k-Segments(排序)
- Java HashMap源代码详解
- ViewPager的无限轮播
- [LeetCode]Add Digits
- 快速排序
- codeforces 631B Print Check
- HTML空格占位符
- 组合数取模
- Java中的异常链
- 排列组合
- 关于安装wamp server之后没办法访问localhost和127.0.0.1
- No_16_0324 Java基础学习第二十三天
- 寻找考场
- MFC-ListCtrl(列表控件)