当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器：

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

3248：Soldier

题目描述

There are k soldiers placed on an n-row and m-column chessboard. It is allowed that more than one soldier are placed on the same grid.

If the Manhattan distance between a grid(in ath row and bth column) and a soldier(in xth row and yth column), |x-a|+|y-b|, is not larger than the control range of that soldier, then the grid will be controlled.

Could you tell the total number of all the controlled grids?

输入解释
The input contains only one case.
The input begins with three positive integers, n, m and k, indicating the length of row and column, and the number of soldiers.
In the next k lines each line contains three non-negative integers, x, y, r, indicating a soldier is placed on the xth row and yth column, and the control range of that soldier is r.
It is guaranteed that 1 ≤ n, m ≤ 100000000，1 ≤ k ≤ 100000
输出解释
Print the total number of all the controlled grids.
输入样例 
4 4 3
1 1 1
3 1 1
3 3 1
输出样例 
10
该题目是Virtual Judge题目，来自 北京大学POJ
题目来源 POJ Monthly--2007.07.08, Chen, Qifeng
源链接： POJ-3248
最后修改于 2020-10-29T06:56:53+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
时间上限 内存上限
5000 65536