codeforces 631B (STL set)
2016-03-05 23:53
246 查看
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 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.
Examples
input
output
input
output
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.
![](http://codeforces.com/predownloaded/85/a9/85a98530b299842acd084263fbec1265b03d56e4.png)
给n行m列染色,1表示给行染2表示给列染,求最后的图。
从后往前染色,维护当前存在的行和列。
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 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.
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.
![](http://codeforces.com/predownloaded/85/a9/85a98530b299842acd084263fbec1265b03d56e4.png)
给n行m列染色,1表示给行染2表示给列染,求最后的图。
从后往前染色,维护当前存在的行和列。
<span style="font-size:10px;">#include <cstdio> #include <cstring> #include <algorithm> #include <iostream> #include <set> using namespace std; #define maxn 5111 set <int> line, column; int n, m, k; int mp[maxn][maxn]; int a[111111][3]; set<int>::iterator it; int main () { scanf ("%d%d%d", &n, &m, &k); memset (mp, 0, sizeof mp); for (int i = 1; i <= k; i++) { scanf ("%d%d%d", &a[i][0], &a[i][1], &a[i][2]); } line.clear (), column.clear (); for (int i = 1; i <= n; i++) line.insert (i); for (int i = 1; i <= m; i++) column.insert (i); for (int i = k; i >= 1; i--) { if (a[i][0] == 1) { if (line.count (a[i][1]) == 0) continue; line.erase (a[i][1]); for (it = column.begin (); it != column.end (); it++) { mp[a[i][1]][*it] = a[i][2]; } } else { if (column.count (a[i][1]) == 0) continue; column.erase (a[i][1]); for (it = line.begin (); it != line.end (); it++) { mp[*it][a[i][1]] = a[i][2]; } } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { printf ("%d%c", mp[i][j], j == m ? '\n':' '); } } return 0; }</span>
相关文章推荐
- 1039. Course List for Student (25)
- IOS屏幕的适配
- NYOJ+一笔画问题+先要判断无向图的连通性(DFS or并查集),然后使用欧拉回路。
- openwrt看IP流量
- 近来的思考
- Java编程思想重点笔记
- 十进制转化十六进制
- javascript的事件
- dos攻击
- codeforces2016
- OSChina 周日乱弹 ——程序员怎么攒钱买房子!(励志、温情)
- 替换空格
- 服务降级
- 设置/取消 IE代理
- POJ3273(最大化问题)
- npm模块的上传与下载
- ios中srcroot和project_dir的区别
- 遇到的retain cycle例子
- web service design log
- 第13章 进程间通信: 管道