CodeForces 631B B. Print Check(水题水题)
来源:互联网 发布:java进度条显示百分比 编辑:程序博客网 时间:2024/06/05 01:56
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.
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.
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.
#include<stdio.h>#include<string.h>#include<iostream>#include<algorithm>#define N 5005using namespace std;int a[N][N];int h[N],l[N],fh[N],fl[N];int n,m,k;int main(){scanf("%d %d %d",&n,&m,&k);int op,x,c;int i,j;for(i=1;i<=k;i++){scanf("%d %d %d",&op,&x,&c);if(op==1){h[x]=c;fh[x]=i;}else{l[x]=c;fl[x]=i;}}for(i=1;i<=n;i++){for(j=1;j<=m;j++){if(fh[i]>fl[j]){printf("%d ",h[i]);}else printf("%d ",l[j]);}printf("\n");}return 0;}
- CodeForces 631B B. Print Check(水题水题)
- CodeForces 631 B.Print Check(水~)
- 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 Round #344 (Div. 2) 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(贪心+模拟)
- cf#344-B - Print Check-暴力模拟
- LCD简介
- 0928 java创建线程的三种方式及其对比
- (转)观点|运营做的好不好,一看系统,二看流程
- FSMC+LCD
- ubutnu16.04安装qt
- CodeForces 631B B. Print Check(水题水题)
- TensorFlow — 相关 API
- Android开发之---Handler
- 完全背包入门题【简单到死啊】
- The Heaviest Non-decreasing Subsequence Problem
- 2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛---banana
- 【leetcode】665. Non-decreasing Array(Python & C++)
- CentOS7上防火墙使用
- TFT显示屏参数设置