1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
| #include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<30
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int d[5005][5005];
int main() {
int n, m;
cin >> n >> m;
memset(d, 0, sizeof(d));
rep(i, m) {
int a, b, x;
cin >> a >> b >> x;
a--;
b--;
d[a][b]++;
d[a][b+1]--;
d[a+x+1][b]--;
d[a+x+2][b+1]++;
d[a+x+1][b+x+2]++;
d[a+x+2][b+x+2]--;
}
rep(i, n) {
rep(j, i+1) d[i][j+1] += d[i][j];
}
rep(i, n) {
rep(j, i+1) d[i+1][j] += d[i][j];
}
rep(i, n) {
rep(j, i+1) d[i+1][j+1] += d[i][j];
}
int ans = 0;
rep(i, n) {
rep(j, i+1) {
if(d[i][j]) ans++;
}
}
cout << ans << endl;
return 0;
}
|