Codeforces 631 B Print Check【思维】
来源:互联网 发布:unity3d 海水的实现 编辑:程序博客网 时间:2024/06/05 08:30
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.
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.
Print n lines containing m integers each — the resulting table after all operations are applied.
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
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的矩阵,有k个操作,每一次操作有三个元素,第一个元素表示操作行还是列,第二个元素表示对应哪一行/哪一列,最后一个元素表示要更改的数值。
思路:
1、首先定义两个结构体,row【i】,col【i】;其中设定两个元素,val、time;一个表示这一行要修改的元素值,time表示这一行修改的时间,然后在输入的时候,不断的更新其内容。
2、那么枚举每一个格子,对应输出修改的行/列时间较晚的那一个,如果对应当前格子,行赋值较晚,那么这个格子就赋值给行修改的值,否则这个格子就赋值给列的修改的值,具体参考代码。
Ac代码:
#include<stdio.h>#include<string.h>using namespace std;struct node{ int time,val;}row[5005],col[5005];int n,m,k;int ans[5005][5005];int main(){ while(~scanf("%d%d%d",&n,&m,&k)) { memset(row,0,sizeof(row)); memset(col,0,sizeof(col)); for(int i=0;i<k;i++) { int op,x,val; scanf("%d%d%d",&op,&x,&val); if(op==1) { row[x].time=i+1; row[x].val=val; } else { col[x].time=i+1; col[x].val=val; } } for(int i=1;i<=n;i++) { for(int j=1;j<=m;j++) { if(row[i].time>col[j].time) { ans[i][j]=row[i].val; } else ans[i][j]=col[j].val; } } for(int i=1;i<=n;i++) { for(int j=1;j<=m;j++) { printf("%d ",ans[i][j]); } printf("\n"); } }}
- Codeforces 631B Print Check 【思维】
- Codeforces 631 B Print Check【思维】
- codeforces 631B Print Check
- codeforces 631B Print Check
- CodeForces 631B Print Check
- codeforces 631B Print Check
- Codeforces Round #344 (Div. 2) B. 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 B. Print Check(水题水题)
- codeforces 344 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(贪心+模拟)
- ARM中断返回地址详细分析
- linux目录结构详细介绍
- Builder模式——组装电脑
- 使用Vitamio打造自己的Android万能播放器(2)—— 手势控制亮度、音量、缩放
- web前端小知识
- Codeforces 631 B Print Check【思维】
- 面向对象的总结
- OC 函数的使用
- LeetCode 122. Best Time to Buy and Sell Stock II(greedy)
- 传智学习java系列:if & switch
- hdu2070单词数
- Python 在线笔试
- [转]在WinForm应用程序中实现自动升级
- JavaScript string对象 + 九九乘法表