text stringlengths 49 983k |
|---|
#include <stdio.h>
#define max(a,b) a<b?b:a
int n,m,cnt;short v[5005][5005];
int main(){
scanf("%d%d",&n,&m);
for(int i=0,x,y,z;i<m;i++){
scanf("%d%d%d",&x,&y,&z);
v[x][y]=max(v[x][y],(short)(z+1));
}
for(int i=1;i<=n;i++) for(int j=1;j<=i;j++) if(v[i][j]) v[i+1][j]=max(v[i+1][j],(short)(v[i][j]-1));
for(int i=1;i<=n;i++) for(int j=1;j<=i;j++) if(v[i][j]) v[i+1][j+1]=max(v[i+1][j+1],(short)(v[i][j]-1));
for(int i=1;i<=n;i++) for(int j=1;j<=i;j++) cnt+=!!v[i][j];
printf("%d\n",cnt);
} |
#include<bits/stdc++.h>
using namespace std;
int dp[5007][5007],n,m,a,b,p;
int main(){
scanf("%d%d",&n,&m);
for(int i=0;i<m;i++){scanf("%d%d%d",&a,&b,&p);p++;dp[a][b]=max(dp[a][b],p);}
int cnt=0;
for(int i=1;i<=n;i++){
for(int j=1;j<=i;j++){
dp[i][j]=max(dp[i][j],max(dp[i-1][j-1],dp[i-1][j])-1);
if(dp[i][j]>=1)cnt++;
}
}
cout<<cnt<<endl;
return 0;
} |
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<long long> vll;
typedef pair<int,int> pint;
typedef pair<long long, long long> pll;
#define MP make_pair
#define PB push_back
#define ALL(s) (s).begin(),(s).end()
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P)
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s; }
const int MAX = 5100;
vint num[MAX];
int N, M, a, b, x;
int main() {
while (cin >> N >> M) {
for (int i = 0; i <= N+5; ++i) num[i].resize(i+10, 0);
for (int i = 0; i < M; ++i) {
cin >> a >> b >> x;
num[a][b]++;
num[a][b+1]--;
num[a+x+1][b]--;
num[a+x+2][b+1]++;
num[a+x+1][b+x+2]++;
num[a+x+2][b+x+2]--;
}
for (int i = 0; i <= N+2; ++i)
for (int j = 0; j <= i+1; ++j)
num[i][j+1] += num[i][j];
for (int i = 0; i <= N+2; ++i)
for (int j = 0; j <= i+1; ++j)
num[i+1][j] += num[i][j];
for (int i = 0; i <= N+2; ++i)
for (int j = 0; j <= i+1; ++j)
num[i+1][j+1] += num[i][j];
int res = 0;
for (int i = 1; i <= N+1; ++i) {
for (int j = 1; j <= i; ++j) {
//cout << num[i][j] << " ";
if (num[i][j] > 0) ++res;
}
//cout << endl;
}
cout << res << endl;
}
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<climits>
#include<string>
#include<vector>
using namespace std;
vector<short> plus_[5001],minus_[5001];
int main(){
int N,M,A,B,X;
cin>>N>>M;
for(int i=0;i<=N;i++){
plus_[i].assign(i+2,0); minus_[i].assign(i+2,0);
}
for(int i=0;i<M;i++){
cin>>A>>B>>X; A--; B--;
plus_[A][B]++; plus_[A+X+1][B]--;
minus_[A][B]--; minus_[A+X+1][B+X+1]++;
}
for(int i=0;i<N;i++){
int sum=0;
for(int j=0;j<N-i;j++){
sum += plus_[j+i][i];
plus_[j+i][i] = sum;
}
}
for(int i=0;i<N;i++){
int sum=0;
for(int j=0;j<N-i;j++){
sum += minus_[i+j][j];
minus_[i+j][j] = sum;
}
}
int ans=0;
for(int i=0;i<N;i++){
int sum=0;
for(int j=0;j<=i;j++){
sum += plus_[i][j];
if(sum>0) ans++;
sum += minus_[i][j];
}
}
printf("%d\n",ans);
return 0;
} |
#include<cstdio>
using namespace std;
int kugi[5010*5020/2];
int lim[5010];
int main(void)
{
int i,j,n,m,wk;
int a,b,x,cnt;
lim[0]=2;
for(i=1;i<5010;i++) {
lim[i]=lim[i-1]+i+2;
}
scanf("%d %d",&n,&m);
for(i=0;i<n+3;i++) {
for(j=0;j<=i+1;j++) {
kugi[i+lim[i]+j]=0;
}
}
for(i=0;i<m;i++) {
scanf("%d %d %d",&a,&b,&x);
kugi[a+lim[a]+b]++;
kugi[a+lim[a]+b+1]--;
kugi[(a+x+1)+lim[a+x+1]+b]--;
kugi[(a+x+2)+lim[a+x+2]+b+1]++;
kugi[(a+x+1)+lim[a+x+1]+b+x+2]++;
kugi[(a+x+2)+lim[a+x+2]+b+x+2]--;
}
for(i=1;i<n+3;i++) {
for(j=0;j<n+3;j++) {
kugi[(i+j)+lim[i+j]+j+2]+=kugi[(i+j-1)+lim[i+j-1]+j+1];
if(i+j>=n+3) break;
}
}
for(i=1;i<n+3;i++) {
for(j=i;j<n+3;j++) {
kugi[j+lim[j]+i]+=kugi[(j-1)+lim[j-1]+i];
}
}
for(i=1;i<n+3;i++) {
for(j=1;j<=i+1;j++) {
kugi[i+lim[i]+j]+=kugi[i+lim[i]+j-1];
}
}
cnt=0;
for(i=1;i<=n;i++) {
for(j=1;j<=i;j++) {
if(kugi[i+lim[i]+j]>0) cnt++;
}
}
printf("%d\n",cnt);
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
int sum[5005][5005];
int main() {
int n, m; scanf("%d%d", &n, &m);
rep(i, m) {
int a, b, x; scanf("%d%d%d", &a, &b, &x);
sum[a][b]++; sum[a][b + 1]--;
sum[a + x + 1][b]--; sum[a + x + 2][b + 1]++;
sum[a + x + 1][b + x + 2]++; sum[a + x + 2][b + x + 2]--;
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= i + 1; j++)sum[i][j] += sum[i][j - 1];
for (int i = 1; i <= n; i++)
for (int j = 1; j <= i + 1; j++)sum[i][j] += sum[i - 1][j];
for (int i = 1; i <= n; i++)
for (int j = 1; j <= i + 1; j++)sum[i][j] += sum[i - 1][j - 1];
int cnt = 0;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= i + 1; j++)cnt += (sum[i][j] > 0);
printf("%d\n", cnt);
} |
#include <iostream>
#include <iomanip>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <climits>
#include <cfloat>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <algorithm>
#include <functional>
#include <utility>
#include <numeric>
using namespace std;
typedef unsigned int UI;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int,int> PII;
typedef istringstream ISS;
typedef ostringstream OSS;
#define REP( i, m, n ) for ( int i = (int)( m ); i < (int)( n ); ++i )
#define EACH( v, c ) for ( auto &v : c )
#define ITER( c ) __typeof( (c).begin() )
#define IREP( c, it ) for ( ITER(c) it = c.begin(); it != c.end(); ++it )
#define ALL( c ) (c).begin(), (c).end()
#define PB( n ) push_back( n )
#define MP( a, b ) make_pair( ( a ), ( b ) )
#define EXIST( c, e ) ( (c).find( e ) != (c).end() )
#define fst first
#define snd second
#define DUMP( x ) cerr << #x << " = " << ( x ) << endl
#define DEBUG( x ) cerr << __FILE__ << ":" << __LINE__ << ": " << #x << " = " << ( x ) << endl
int main()
{
cin.tie( 0 );
ios::sync_with_stdio( false );
int n, m;
cin >> n >> m;
VVI tri( n + 1, VI() );
REP( i, 0, tri.size() )
{
tri[i].resize( i + 1, 0 );
}
REP( i, 0, m )
{
int a, b, x;
cin >> a >> b >> x;
tri[ a - 1 ][ b - 1 ] = x + 1;
}
int res = 0;
REP( i, 0, tri.size() - 1 )
{
REP( j, 0, tri[i].size() )
{
res += 0 < tri[i][j];
tri[ i + 1 ][j] = max( tri[ i + 1 ][j], tri[i][j] - 1 );
tri[ i + 1 ][ j + 1 ] = max( tri[ i + 1 ][ j + 1 ], tri[i][j] - 1 );
}
}
cout << res << endl;
return 0;
} |
#include <cstdio>
using namespace std;
#define rep(i,x) for(int i=0;i<(int)(x);++i)
int nails[5005][5005];
signed main()
{
int N, M; scanf("%d%d", &N, &M);
rep(i, M) {
int A, B, X; scanf("%d%d%d", &A, &B, &X);
nails[A - 1][B - 1]++;
nails[A - 1][B]--;
nails[A + X][B - 1]--;
nails[A + X][B + X + 1]++;
nails[A + X + 1][B]++;
nails[A + X + 1][B + X + 1]--;
}
rep(i, N + 2) {
rep(j, N + 2) {
nails[i][j + 1] += nails[i][j];
}
}
rep(i, N + 2) {
rep(j, N + 2) {
nails[j + 1][i] += nails[j][i];
}
}
rep(i, N + 2) {
rep(j, N + 2) {
nails[i + 1][j + 1] += nails[i][j];
}
}
int ans = 0;
rep(i, N + 2) {
rep(j, N + 2) {
ans += nails[i][j] > 0;
}
}
printf("%d\n", ans);
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,int> plli;
typedef pair<int,pii> pipii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n);i>=0;i--)
#define rrep2(i,a,b) for (int i=(a);i>b;i--)
#define pb push_back
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()
const ll mod = 1e9 + 7;
const ll INF = 1<<30;
const int dx4[4] = {1, 0, -1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
const int dy8[8] = {0, 1, -1, 1, -1, 0, 1, -1};
const double pi = 3.141592653589793;
int n, m;
int g[5050][5050];
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
cin >> m;
rep(i, m) {
int a, b, x;
cin >> a >> b >> x;
g[a][b] += 1;
g[a][b + 1] -= 1;
g[a + x + 1][b] -= 1;
g[a + x + 2][b + 1] += 1;
g[a + x + 1][b + x + 2] += 1;
g[a + x + 2][b + x + 2] -= 1;
}
rep(i, 5010)rep(j, 5010) g[i][j + 1] += g[i][j];
rep(i, 5010)rep(j, 5010) g[i + 1][j] += g[i][j];
rep(i, 5010)rep(j, 5010) g[i + 1][j + 1] += g[i][j];
int ans = 0;
rep(i, 5010)rep(j, 5010) {
if (g[i][j] > 0) ans++;
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 5005;
int n, m, res;
int f[maxn][maxn];
int main() {
///freopen("test.txt", "r", stdin);
ios_base::sync_with_stdio(0);
cin >> n >> m;
while (m --) {
int a, b, x; cin >> a >> b >> x;
f[a][b] = max(f[a][b], x + 1);
}
for (int i = 1; i <= n; i ++) {
for (int j = 1; j <= i; j ++) {
f[i][j] = max(f[i][j], max(f[i - 1][j - 1], f[i - 1][j]) - 1);
///cout << f[i][j] << ' ';
if(f[i][j]) res ++;
}
///cout << endl;
}
cout << res << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,int> plli;
typedef pair<int,pii> pipii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n);i>=0;i--)
#define rrep2(i,a,b) for (int i=(a);i>b;i--)
#define pb push_back
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()
const ll mod = 1e9 + 7;
const ll INF = 1<<30;
const int dx4[4] = {1, 0, -1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
const int dy8[8] = {0, 1, -1, 1, -1, 0, 1, -1};
const double pi = 3.141592653589793;
int n, m;
vector<vector<int>> g(5050, vector<int>(5050, 0));
void imos3_add(int a, int b, int x, vector<vector<int>>& g) {
g[a][b] += 1; g[a][b + 1] -= 1;
g[a + x + 1][b] -= 1; g[a + x + 2][b + 1] += 1;
g[a + x + 1][b + x + 2] += 1; g[a + x + 2][b + x + 2] -= 1;
return ;
}
void imos3_update(vector<vector<int>>& g) {
for (int i = 0; i < 5010; i++) for (int j = 0; j < 5010; j++) g[i][j + 1] += g[i][j];
for (int i = 0; i < 5010; i++) for (int j = 0; j < 5010; j++) g[i + 1][j] += g[i][j];
for (int i = 0; i < 5010; i++) for (int j = 0; j < 5010; j++) g[i + 1][j + 1] += g[i][j];
return ;
}
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
cin >> m;
rep(i, m) {
int a, b, x;
cin >> a >> b >> x;
imos3_add(a, b, x, g);
}
imos3_update(g);
int ans = 0;
rep(i, 5010)rep(j, 5010) {
if (g[i][j] > 0) ans++;
}
cout << ans << endl;
} |
#include <cstdio>
#pragma warning(disable : 4996)
int n, m, a, b, c, imos[5009][5009], imos2[5009][5009], imos3[5009][5009];
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < m; i++) {
scanf("%d%d%d", &a, &b, &c); a--, b--;
// cover (a, b), (a+1, b),..., (a+c, b)
imos2[a][b]++;
imos2[a + c + 1][b]--;
// cover (a, b+1), (a+1, b+2),..., (a+c, b+c+1)
imos3[a][b + 1]++;
imos3[a + c + 1][b + c + 2]--;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
imos2[i + 1][j] += imos2[i][j];
}
}
for (int i = -1; i < n; i++) {
for (int j = 1; i + j <= n; j++) {
if (i + j <= 0) continue;
imos3[i + j][j] += imos3[i + j - 1][j - 1];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
imos[i][j] += imos2[i][j];
imos[i][j] -= imos3[i][j];
}
}
int ret = 0;
for (int i = 0; i < n; i++) {
int sum = 0;
for (int j = 0; j <= i; j++) {
sum += imos[i][j];
if (sum > 0) ret++;
}
}
printf("%d\n", ret);
return 0;
} |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
using namespace std;
int N, M;
int d[5010][5010];
int h[5010][5010];
int t[5010][5010];
int main() {
cin >> N >> M;
for (int i=0; i<M; i++) {
int a, b, x;
cin >> a >> b >> x;
a--;
b--;
d[a][b] += 1;
d[a][b+1] -= 1;
d[a+x+1][b] -= 1;
d[a+x+2][b+1] += 1;
d[a+x+1][b+x+2] += 1;
d[a+x+2][b+x+1+1] -= 1;
}
for (int i=0; i<=N; i++) {
for (int j=0; j<=N; j++) {
h[i][j] = ((i>0&&j>0)? h[i-1][j-1] : 0) + d[i][j];
}
}
for (int i=0; i<=N; i++) {
int g = 0;
for (int j=0; j<=N; j++) {
g += h[j][i];
t[j][i] = g;
}
}
int ans = 0;
for (int i=0; i<N; i++) {
int g = 0;
for (int j=0; j<=i; j++) {
g += t[i][j];
if (g > 0) ans++;
}
}
cout << ans << "\n";
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using P = pair<int, char>;
array<array<int, 5003>, 5003> sum;
int main() {
int N, M;
cin >> N >> M;
for(int i=0; i<M; ++i) {
int A, B, X;
cin >> A >> B >> X;
sum[A][B] += 1;
sum[A][B+1] += -1;
sum[A+X+1][B] += -1;
sum[A+X+2][B+1] += 1;
sum[A+X+1][B+X+2] += 1;
sum[A+X+2][B+X+2] += -1;
}
for(int i=0; i<N+3; ++i) {
for(int j=0; j<=i; ++j) {
sum[i][j+1] += sum[i][j];
}
}
for(int i=0; i<N+2; ++i) {
for(int j=0; j<=i; ++j) {
sum[i+1][j] += sum[i][j];
}
}
int res = 0;
for(int i=0; i<N+2; ++i) {
for(int j=0; j<=i; ++j) {
sum[i+1][j+1] += sum[i][j];
res += sum[i+1][j+1] > 0;
}
}
cout << res << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
short dp[5001][5001];
int main()
{
int n, m;
scanf("%d %d", &n, &m);
for (int i = 0; i < m; i++){
int a, b, x;
scanf("%d %d %d", &a, &b, &x);
a--; b--;
dp[a][b] = (short)(x + 1);
}
int cnt = 0;
for (int i = 0; i < n; i++){
for (int j = 0; j <= i; j++){
cnt += !!dp[i][j];
dp[i + 1][j] = max(dp[i + 1][j], (short)(dp[i][j] - 1));
dp[i + 1][j + 1] = max(dp[i + 1][j + 1], (short)(dp[i][j] - 1));
}
}
printf("%d\n", cnt);
return 0;
} |
#include<iostream>
#include<cstdio>
#include<vector>
using namespace std;
int n,m,ans=0;
//int tri[5005][5005];
vector<int> tri[5005];
int main(void){
scanf("%d%d",&n,&m);
for(int i=0;i<=5003;i++){
for(int j=0;j<=i+3;j++)tri[i].push_back(0);
}
for(int i=0;i<m;i++){
int x,y,size;
scanf("%d%d%d",&y,&x,&size);
size++;
tri[y][x]+=1;
tri[y][x+1]-=1;
tri[y+size][x]-=1;
tri[y+size+1][x+1]+=1;
tri[y+size][x+size+1]+=1;
tri[y+size+1][x+size+1]-=1;
}
/*
for(int i=1;i<=n+3;i++){
for(int j=1;j<=i;j++){
printf("%d%c",tri[i][j],i==j?'\n':' ');
}
}
printf("o\n");
*/
for(int i=2;i<=n;i++){
for(int j=2;j<=i;j++){
tri[i][j]+=tri[i][j-1];
}
}
/*
for(int i=1;i<=n;i++){
for(int j=1;j<=i;j++){
printf("%d%c",tri[i][j],i==j?'\n':' ');
}
}
printf("o\n");
*/
for(int i=1;i<=n;i++){
for(int j=i+1;j<=n;j++){
tri[j][i]+=tri[j-1][i];
}
}
/*
printf("o\n");
for(int i=1;i<=n;i++){
for(int j=1;j<=i;j++){
printf("%d%c",tri[i][j],i==j?'\n':' ');
}
}
*/
for(int i=1;i<=n;i++){
int y=i+1,x=2;
while(y<=n){
tri[y][x]+=tri[y-1][x-1];
y++,x++;
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=i;j++){
if(tri[i][j]>=1)ans++;
// printf("%d%c",tri[i][j],i==j?'\n':' ');
}
}
printf("%d\n",ans);
return 0;
} |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <functional>
using namespace std;
#define fst first
#define scd second
#define PB push_back
#define MP make_pair
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define omajinai ios::sync_with_stdio(false);cin.tie(0)
#define rep(i,x) for(int i=0;i<(int)(x);++i)
#define rep1(i,x) for(int i=1;i<=(int)(x);++i)
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
template<typename T>T& max(T&a,T&b){if(a>=b)return a;return b;}
template<typename T>T& min(T&a,T&b){if(a<b)return a;return b;}
template<typename T>bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<typename T>bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<typename T>T get(){T a;cin>>a;return a;}
template<typename T>T rev(T a){reverse(all(a));return a;}
template<typename T>vector<T>&sort(vector<T>&a){sort(all(a));return a;}
const int inf = 1e9;
const ll linf = 3e18;
const double eps = 1e-9;
int nails[5005][5005];
signed main()
{
omajinai;
int N, M; cin >> N >> M;
rep(i, M) {
int A, B, X; cin >> A >> B >> X;
nails[A - 1][B - 1]++;
nails[A - 1][B]--;
nails[A + X][B - 1]--;
nails[A + X][B + X + 1]++;
nails[A + X + 1][B]++;
nails[A + X + 1][B + X + 1]--;
}
rep(i, N + 2) {
rep(j, N + 2) {
nails[i][j + 1] += nails[i][j];
}
}
rep(i, N + 2) {
rep(j, N + 2) {
nails[j + 1][i] += nails[j][i];
}
}
rep(i, N + 2) {
int y = i + 1;
int x = 1;
while (y <= N && x <= N) {
nails[y][x] += nails[y - 1][x - 1];
y++;
x++;
}
}
int ans = 0;
rep(i, N + 2) {
rep(j, N + 2) {
ans += nails[i][j] > 0;
}
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef tuple<int, int> duo;
const int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};
const int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};
const int Mod = 1000000000 + 0;
//{{{ templates
#define TT_ template<typename T>inline
#define TTF_ template<typename T,typename F>inline
TT_ T sq(T x){return x*x;}
TT_ T In(){T x;cin>>x;return x;}
TT_ void Out(T&x){cout<<x;}
TT_ void sort(T&v){sort(begin(v),end(v));}
TT_ void revs(T&v){reverse(begin(v),end(v));}
TT_ void uniq(T&v){sort(v);v.erase(unique(begin(v),end(v)),end(v));}
TT_ int ubnd(T&v,typename T::value_type x){return upper_bound(begin(v),end(v),x)-begin(v);}
TT_ int lbnd(T&v,typename T::value_type x){return lower_bound(begin(v),end(v),x)-begin(v);}
TTF_ void inpt(T&v,int n,F f){for(v.reserve(n);n--;v.emplace_back(f()));}
TTF_ void show(T&v,F f,string d=" ",string e="\n"){int i=0;for(auto&x:v)i++&&(cout<<d),f(x);cout<<e;}
TT_ typename T::iterator minel(T&v){return min_element(begin(v),end(v));}
TT_ typename T::iterator maxel(T&v){return max_element(begin(v),end(v));}
inline void fast_io(){ios_base::sync_with_stdio(0);cin.tie(0);}
inline int in(){int x;scanf("%d",&x);return x;}
inline ll pow_mod(ll a,ll k,ll m){ll r=1;for(;k>0;a=a*a%m,k>>=1)if(k&1)r=r*a%m;return r;}
inline ll mod_inv(ll a,ll p){return pow_mod(a,p-2,p);}
//}}} priority_queue queue deque front stringstream max_element min_element insert count make_tuple
short nails[5050][5050];
int main()
{
int N, M;
N = in(), M = in();
for (int i = 0; i < M; i++){
int a, b, x;
a = in(), b = in(), x = in();
nails[a][b] = x + 1;
}
for (int i = 1; i <= N; i++){
for (int j = 1; j <= i; j++){
nails[i][j] = max<short>(nails[i][j], max(nails[i - 1][j], nails[i - 1][j - 1]) - 1);
}
}
int cnt = 0;
for (int i = 1; i <= N; i++){
for (int j = 1; j <= i; j++){
if (nails[i][j]) cnt++;
}
}
cout << cnt << endl;
return 0;
} |
// #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define int long long int
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
typedef pair<int, int> pii;
typedef long long ll;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const ll INF = 1001001001001001LL;
const ll MOD = 1000000007LL;
int rec[5010][5010];
signed main() {
int N, M; cin >> N >> M;
for(int i=0; i<M; i++) {
int a, b, x; cin >> a >> b >> x;
a--; b--;
chmax(rec[a][b], x + 1);
}
int ans = 0;
for(int i=0; i<N; i++) {
for(int j=0; j<=i; j++) {
if(rec[i][j] > 0) {
ans++;
chmax(rec[i+1][j ], rec[i][j] - 1);
chmax(rec[i+1][j+1], rec[i][j] - 1);
}
}
}
printf("%lld\n", ans);
return 0;
}
|
#include <iostream>
#include <iomanip>
#include <sstream>
#include <cstdio>
#include <string>
#include <vector>
#include <algorithm>
#include <complex>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <cassert>
#include <climits>
#include <queue>
#include <set>
#include <map>
#include <valarray>
#include <bitset>
#include <stack>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef pair<int,int> pii;
const int INF = 1<<29;
const double PI = acos(-1);
const double EPS = 1e-8;
short int t[5001][5001];
int main() {
int n, m;
cin >> n >> m;
REP(i,m) {
int a, b, x;
cin >> a >> b >> x;
a--;b--;
t[a][b] = max((int)t[a][b], x+1);
}
int ans = 0;
REP(i,n) {
REP(j,i+1) {
if (t[i][j] > 0) ans++;
t[i+1][j] = max((int)t[i+1][j], t[i][j]-1);
t[i+1][j+1] = max((int)t[i+1][j+1], t[i][j]-1);
}
}
cout << ans << endl;
} |
#include <iostream>
#include <cstdio>
#include <vector>
#include <map>
#include <queue>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)
using namespace std;
typedef pair<int,int> pr;
typedef pair<pr,int> ppr;
typedef vector<pr> vpr;
int maps[2][5001];
typedef priority_queue<ppr,vector<ppr>,greater<ppr> > pq;
//inline int max(int a,int b){return (a<b)?b:a;}
int main() {
int N,M,x,y,size;
pq nail;
cin >> N >> M;
REP(i,M){
scanf("%d%d%d",&x,&y,&size);
nail.push(ppr(pr(x,y) , size+1));
}
int sum=0;
REP(i,N+1){
REP(j,N+1)
maps[(i+1)&1][j]=0;
while(!nail.empty() &&nail.top().first.first==i){
maps[i&1][nail.top().first.second]=max(maps[i&1][nail.top().first.second],nail.top().second);
nail.pop();
}
REP(j,N+1){
maps[(i+1)&1][j+1]=max(maps[(i+1)&1][j+1],maps[i&1][j]-1);
maps[(i+1)&1][j]=max(maps[(i+1)&1][j],maps[i&1][j]-1);
if(maps[i&1][j])
sum++;
}
}
cout << sum << endl;
return 0;
} |
#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <functional>
#include <array>
#include <map>
#include <queue>
#include <limits.h>
#include <set>
#include <stack>
#include <random>
#include <complex>
#include <unordered_map>
#define rep(i,s,n) for(int i = (s); (n) > i; i++)
#define REP(i,n) rep(i,0,n)
#define RANGE(x,a,b) ((a) <= (x) && (x) <= (b))
#define DUPLE(a,b,c,d) (RANGE(a,c,d) || RANGE(b,c,d) || RANGE(c,a,b) || RANGE(d,a,b))
#define INCLU(a,b,c,d) (RANGE(a,c,d) && (b,c,d))
#define PW(x) ((x)*(x))
#define ALL(x) (x).begin(), (x).end()
#define MODU 1000000007
#define bitcheck(a,b) ((a >> b) & 1)
#define bitset(a,b) ( a |= (1 << b))
#define bitunset(a,b) (a &= ~(1 << b))
#define MP(a,b) make_pair((a),(b))
#define Manh(a,b) (abs((a).first-(b).first) + abs((a).second - ((b).second))
#define pritnf printf
#define scnaf scanf
#define itn int
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll gcd(ll a, ll b) {
if (b == 0) return a;
return gcd(b, a%b);
}
template<typename A, size_t N, typename T>
void Fill(A(&array)[N], const T &val) {
std::fill((T*) array, (T*) (array + N), val);
}
pii Dir [] = {
{ 0, 1 },{ -1 ,1 },{ -1, 0 },
{ -1 ,-1 },{ 0,-1 },{ 1 ,-1 },
{ 1,0 },{ 1 ,1 }
};
signed main() {
int n, m;
scanf("%d %d", &n, &m);
vector<vector<int>> tri(n, vector<int>(n,-1));
REP(i, m) {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
tri[a - 1][b - 1] = c;
}
int ans = m;
REP(i, n-1) {
REP(j, n-1) {
if (tri[i][j]>0) {
ans += (tri[i + 1][j + 1]<0) + (tri[i + 1][j]<0);
tri[i + 1][j] = max(tri[i + 1][j], tri[i][j]-1);
tri[i + 1][j + 1] = max(tri[i + 1][j + 1], tri[i][j]-1);
}
}
}
printf("%d\n", ans);
return 0;
} |
#include <iostream>
#include <iomanip>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <climits>
#include <cfloat>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <algorithm>
#include <functional>
#include <utility>
#include <numeric>
using namespace std;
typedef unsigned int UI;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int,int> PII;
typedef istringstream ISS;
typedef ostringstream OSS;
#define REP( i, m, n ) for ( int i = (int)( m ); i < (int)( n ); ++i )
#define EACH( v, c ) for ( auto &v : c )
#define ITER( c ) __typeof( (c).begin() )
#define IREP( c, it ) for ( ITER(c) it = c.begin(); it != c.end(); ++it )
#define ALL( c ) (c).begin(), (c).end()
#define PB( n ) push_back( n )
#define MP( a, b ) make_pair( ( a ), ( b ) )
#define EXIST( c, e ) ( (c).find( e ) != (c).end() )
#define fst first
#define snd second
#define DUMP( x ) cerr << #x << " = " << ( x ) << endl
#define DEBUG( x ) cerr << __FILE__ << ":" << __LINE__ << ": " << #x << " = " << ( x ) << endl
int main()
{
cin.tie( 0 );
ios::sync_with_stdio( false );
int n, m;
cin >> n >> m;
VVI board( n + 2 );
REP( i, 0, board.size() )
{
board[i].resize( i + 2, 0 );
}
REP( i, 0, m )
{
int a, b, x;
cin >> a >> b >> x;
a--;
b--;
board[a][b] ++;
board[a][ b + 1 ] --;
board[ a + x + 1 ][b] --;
board[ a + x + 1 ][ b + x + 2 ] ++;
board[ a + x + 2 ][ b + 1 ] ++;
board[ a + x + 2 ][ b + x + 2 ] --;
}
REP( i, 0, board.size() )
{
REP( j, 1, board[i].size() )
{
board[i][j] += board[i][ j - 1 ];
}
}
REP( i, 1, board.size() )
{
REP( j, 0, board[ i - 1 ].size() )
{
board[i][j] += board[ i - 1 ][j];
}
}
REP( i, 1, board.size() )
{
REP( j, 1, board[i].size() )
{
board[i][j] += board[ i - 1 ][ j - 1 ];
}
}
int res = 0;
REP( i, 0, board.size() - 2 )
{
REP( j, 0, board[i].size() - 1 )
{
res += 1 <= board[i][j];
}
}
cout << res << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int a[500005],b[500005],x[500005];
int data[5005][5005];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n,m; cin >> n >> m;
for (int i = 0;i < m;i++){
cin >> a[i] >> b[i] >> x[i];
a[i]--; b[i]--;x[i]++;
}
for (int i = 0;i < n;i++){
for (int j = 0;j <= i;j++){
data[i][j] = 0;
}
}
for (int i = 0;i < m;i++){
data[a[i]][b[i]] = x[i];
}
int cnt = 0;
for (int i = 0;i < n;i++){
for (int j = 0;j <= i;j++){
if(i == 0 && data[i][j] == 0){ cnt++; continue;}
if(i == 0) continue;
if(j == 0) data[i][j] = max(data[i][j], data[i-1][j]-1);
else if(j == i) data[i][j] = max(data[i][j], data[i-1][j-1]-1);
else data[i][j] = max(data[i][j], max(data[i-1][j], data[i-1][j-1])-1);
if(data[i][j] == 0) cnt++;
}
}
int sum = 0;
for (int i = 1;i <= n;i++){
sum += i;
}
cout << sum - cnt << endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
short d[5002][5002];
int n, m, a, b ,c;
int main(){
cin >> n >> m;
for(int i=0;i<m;i++){
cin >> a >> b >> c;
d[a][b] = c + 1;
}
int ans = 0;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
d[i][j] = max(d[i][j], (short)(max(d[i-1][j-1], d[i-1][j]) - 1));
if(d[i][j]) ans++;
}
}
cout << ans << endl;
} |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define dbg(x) cout<<#x"="<<x<<endl
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<pii, int> ppi;
#define INF 1000000000
#define N_MAX 5000
#define M_MAX 500000
int nails[N_MAX+2][N_MAX+2];
int main(){
int n,m;
cin >> n >> m;
rep(i, n){
rep(j,n)
nails[i][j]=0;
}
int a,b,x;
rep(i, m){
scanf("%d %d %d", &a, &b, &x);
nails[a][b]=max(x+1, nails[a][b]);
}
int res=0;
for(int i=1; i<=n; i++){
for(int j=1; j<=i; j++){
nails[i][j] = max(nails[i][j],
max(nails[i-1][j-1], nails[i-1][j])-1);
if(nails[i][j]>0) res++;
}
}
cout << res << endl;
} |
#include<stdio.h>
#include<algorithm>
using namespace std;
pair<pair<int,int> ,int> Q[500000];
int val[2][5001];
int main(){
int a,b;
scanf("%d%d",&a,&b);
for(int i=0;i<b;i++){
int c,d,e;scanf("%d%d%d",&c,&d,&e);
Q[i]=make_pair(make_pair(c,d),e);
}std::sort(Q,Q+b);
int ret=0;
int at=0;
for(int i=0;i<a;i++){
int e=i&1;
while(at<b&&Q[at].first.first==i+1){
val[e][Q[at].first.second-1]=max(val[e][Q[at].first.second-1],Q[at].second+1);
at++;
}
for(int j=0;j<=i;j++)if(val[e][j])ret++;
for(int j=0;j<=i+1;j++)val[!e][j]=0;
for(int j=0;j<=i;j++){
val[!e][j]=max(val[!e][j],val[e][j]-1);
val[!e][j+1]=max(val[!e][j+1],val[e][j]-1);
}
}
printf("%d\n",ret);
} |
#include<bits/stdc++.h>
using namespace std;
void solve();
int N,M;
int ans = 0;
int fid[5010][5010] = {0};
int main()
{
scanf("%d%d",&N,&M);
solve();
}
void solve()
{
int a,b,x;
for(int i = 0; i < M; i++)
{
scanf("%d%d%d",&a,&b,&x);
fid[a - 1][b- 1] = x + 1;
}
for(int i = 0; i < N; i++)
{
for(int j = 0; j <= i; j++)
{
int mem = fid[i][j];
if(i == 0);
else if(j == 0)
{
fid[i][j] = max(fid[i - 1][j] - 1,mem);
}
else if(i == j)
{
fid[i][j] = max(fid[i - 1][j - 1] - 1,mem);
}
else
{
fid[i][j] = max
(max(
fid[i - 1][j] - 1,fid[i - 1][j - 1] - 1),mem);
}
if(fid[i][j])ans++;
}
}
printf("%d\n",ans);
} |
#include <iostream>
#include <vector>
#include <array>
#include <list>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <memory>
#include <cmath>
#include <algorithm>
#include <functional>
#include <iomanip>
#include <numeric>
#include <climits>
#include <cfloat>
#include <cassert>
#include <random>
int main() {
int n, m; std::cin >> n >> m;
std::vector<std::vector<int>> nails; nails.reserve(n);
for (auto i = 0; i < n; ++i) {
nails.emplace_back(n - i, 0);
}
for (auto i = 0; i < m; ++i) {
int a, b, x; std::cin >> a >> b >> x;
nails[a - b][b - 1] = std::max(nails[a - b][b - 1], x + 1);
}
for (auto i = 1; i < n; ++i) {
nails[i][0] = std::max(nails[i][0], nails[i - 1][0] - 1);
nails[0][i] = std::max(nails[0][i], nails[0][i - 1] - 1);
}
for (auto i = 1; i < n; ++i) {
for (auto j = 1; j < n - i; ++j) {
nails[i][j] = std::max({ nails[i][j], nails[i][j - 1] - 1, nails[i - 1][j] - 1 });
}
}
int count = 0;
for (const auto& line : nails) count += std::count_if(line.begin(), line.end(), [](const int i) {return i > 0; });
std::cout << count << std::endl;
}
|
#include <bits/stdc++.h>
#define foru(i, a, b) for(int i = int(a); i <= int(b); i++)
using namespace std;
const int N = 5005;
int n, m, dp[N][N];
int main() {
//freopen("a.txt", "r", stdin);
scanf("%d%d", &n, &m);
foru(i, 1, m) {
int ai, bi, xi;
scanf("%d%d%d", &ai, &bi, &xi);
dp[ai][bi] = xi + 1;
}
int ans = 0;
foru(i, 1, n) foru(j, 1, i) {
dp[i][j] = max(dp[i][j], max(dp[i-1][j-1], dp[i-1][j]) - 1);
if (dp[i][j]) ans++;
}
cout << ans << endl;
return 0;
} |
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
const int size = n + 3;
vector<vector<int>> triangle;
for(int i = 0; i < size; ++i)
triangle.emplace_back(i + 2, 0);
for(int i = 0; i < m; ++i) {
int a, b, x;
cin >> a >> b >> x;
++triangle[a][b];
--triangle[a][b + 1];
--triangle[a + x + 1][b];
++triangle[a + x + 2][b + 1];
++triangle[a + x + 1][b + x + 2];
--triangle[a + x + 2][b + x + 2];
}
for(int i = 0; i < size; ++i) {
for(int j = 0; j < i; ++j) {
triangle[i][j + 1] += triangle[i][j];
}
}
for(int i = 0; i < size; ++i) {
for(int j = i + 1; j < size; ++j) {
triangle[j][i] += triangle[j - 1][i];
}
}
for(int i = 0; i < size; ++i) {
for(int j = 1; i + j < size; ++j) {
triangle[i + j][j] += triangle[i + j - 1][j - 1];
}
}
int ans = 0;
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= i; ++j) {
if(triangle[i][j] > 0) ++ans;
}
}
cout << ans << endl;
return EXIT_SUCCESS;
} |
#include<iostream>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<functional>
#include<algorithm>
#include<cstdio>
#include<unordered_map>
using namespace std;
//---------------------------------------------------
//????????????????????????????????????
#define int long long
#define str string
#define rep(i,j) for(int i=0;i<(int)(j);i++)
typedef long long ll;
typedef long double ld;
const ll inf = 4523372036854775807;
const ld pi = 3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989;
struct P {
ll pos, cost;
};
bool operator<(P a, P b) { return a.cost < b.cost; }
bool operator>(P a, P b) { return a.cost > b.cost; }
struct B {//??£??\???????????¨???
ll to, cost;
};
struct S {//???????????±?????\???????????°
int from, to, cost;
};
struct H {
int x, y;
};
ll gcm(ll i, ll j) {//?????§??¬?´???°
if (i > j) swap(i, j);
if (i == 0) return j;
return gcm(j%i, i);
}
ld radian(ld a, ld b, ld c, ld d) {
return sqrt(pow(a - c, 2) + pow(b - d, 2));
}
//---------------------------------------------------
//+++++++++++++++++++++++++++++++++++++++++++++++++++
struct K {
int x, y, z;
};
bool operator<(K a, K b) { return a.x < b.x; }
struct A {
int x, cost;
};
int n, m, b[5000][5000], ans;
K o[500000];
queue<A> a[5000];
signed main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> o[i].x >> o[i].y >> o[i].z;
o[i].x--; o[i].y--;
}
sort(o, o + m);
for (int i = 0; i < m; i++)
a[o[i].y].push(A{ o[i].x,o[i].z });
for (int j = 0; j < n; j++) {
if (a[j].empty())
continue;
for (int i = 0; i < n; i++) {
while (!(a[j].empty()) && a[j].front().x + a[j].front().cost < i)
a[j].pop();
if (a[j].empty() || a[j].front().x > i)
continue;
b[i][j] = max(b[i][j], i - a[j].front().x + 1);
}
}
for (int i = 0; i < n; i++)
for (int j = 1; j < n; j++)
b[i][j] = max(b[i][j], b[i][j - 1] - 1);
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
if (b[i][j])
ans++;
cout << ans << endl;
getchar(); getchar();
} |
#include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define REP(i,n) for (int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
const int INF=1e9;
int n,m;
int col[5001][5001];
int slt[5001][5001];
int cnt[5001][5001];
int main(){
scanf("%d%d",&n,&m);
REP(i,m){
int a,b,x;
scanf("%d%d%d",&a,&b,&x);a--;b--;
col[b][a]++;col[b][a+x+1]--;
slt[b][a-b]++;slt[b+x+1][a-b]--;
}
REP(i,n)for(int j=1;j<n;j++){
col[i][j]+=col[i][j-1];
slt[j][i]+=slt[j-1][i];
}
REP(i,n)REP(j,n){
if(col[j][i])cnt[j][i]+=col[j][i];
if(slt[j][i])cnt[j+1][i+j]-=slt[j][i];
}
REP(i,n)for(int j=1;j<n;j++)cnt[j][i]+=cnt[j-1][i];
int ans=0;
REP(i,n)for(int j=0;j<=i;j++)if(cnt[j][i])ans++;
cout<<ans<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
long long N, M, A, B, X, Na[5005][5005], T[5005][5005], Y[5005][5005], i, j;
int main(){
scanf("%lld%lld", &N, &M);
for(i = 0; i < M; ++i){
scanf("%lld%lld%lld", &A, &B, &X);
++T[A][B];
--T[A + X + 1][B];
--Y[A][B + 1];
++Y[A + X + 1][B + X + 2];
}
for(i = 1; i <= N; ++i){
for(j = 1; j <= i; ++j){
T[i][j] += T[i - 1][j];
}
}
for(i = 1; i <= N; ++i){
for(j = 1; j <= i; ++j){
Y[i][j] += Y[i - 1][j - 1];
}
}
B = 0;
for(i = 1; i <= N; ++i){
for(j = 1; j <= i; ++j){
A = Y[i][j] + T[i][j];
Na[i][j] = Na[i][j - 1] + A;
if(Na[i][j])++B;
}
}
/*for(i = 1; i <= N; ++i){
cout << i << " : ";
for(j = 1; j <= i; ++j){
cout << T[i][j] << " ";
}
cout << endl;
}
for(i = 1; i <= N; ++i){
cout << i << " : ";
for(j = 1; j <= i; ++j){
cout << Y[i][j] << " ";
}
cout << endl;
}
for(i = 1; i <= N; ++i){
cout << i << " : ";
for(j = 1; j <= i; ++j){
cout << Na[i][j] << " ";
}
cout << endl;
}*/
cout << B << endl;
return 0;
} |
#include <iostream>
using namespace std;
int main(){
int a,b,x,n,m;
static int field[5001][5001] = {};
cin >> n >> m;
for(int i = 0;i < m;i++){
cin >> a >> b >> x;
field[a - 1][b - 1] = x + 1;
}
for(int i = 0;i < n;i++){
for(int j = 0;j < n;j++){
field[i + 1][j] = max(field[i + 1][j],field[i][j] - 1);
field[i + 1][j + 1] = max(field[i + 1][j + 1],field[i][j] - 1);
}
}
int cnt = 0;
for(int i = 0;i < n;i++){
for(int j = 0;j < n;j++) {
if(field[i][j]) cnt++;
}
}
cout << cnt << endl;
return 0;
} |
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n,m;
scanf("%d%d",&n,&m);
vector<int>imos[5010];
for(int i=0;i<=n+5;i++){
imos[i].resize(i+5);
for(int j=0;j<i+5;j++)
imos[i][j]=0;
}
for(int i=0;i<m;i++){
int a,b,x;
scanf("%d%d%d",&a,&b,&x);
imos[a][b]++;imos[a][b+1]--;
imos[a+x+1][b]--;imos[a+x+2][b+1]++;
imos[a+x+1][b+x+2]++;imos[a+x+2][b+x+2]--;
}
for(int i=1;i<=n;i++)
for(int j=1;j<=i+3;j++)
imos[i][j]+=imos[i][j-1];
for(int i=1;i<=n;i++)
for(int j=1;j<=i+3;j++)
imos[i][j]+=imos[i-1][j];
for(int i=1;i<=n;i++)
for(int j=1;j<=i+3;j++)
imos[i][j]+=imos[i-1][j-1];
int cnt=0;
for(int i=1;i<=n;i++){
for(int j=1;j<=i;j++){
cnt+=(imos[i][j])?1:0;
//("%2d ",imos[i][j]);
}
//puts("");
}
printf("%d\n",cnt);
} |
#include <cstdio>
#include <algorithm>
using namespace std;
short dp[5001][5001];
int main()
{
int N, M;
scanf("%d %d", &N, &M);
for (int i = 0; i < M; i++){
int a, b, x;
scanf("%d %d %d", &a, &b, &x);
dp[a - 1][b - 1] = x + 1;
}
int res = 0;
for (int i = 0; i < N; i++){
for (int j = 0; j <= i; j++){
res += !!dp[i][j];
dp[i + 1][j] = max((short)(dp[i][j] - 1), dp[i + 1][j]);
dp[i + 1][j + 1] = max((short)(dp[i][j] - 1), dp[i + 1][j + 1]);
}
}
printf("%d\n", res);
return (0);
} |
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
vector<vector<int> > masu(5005);
for (int i = 0; i < masu.size(); i++) {
for (int j = 0; j < i+5; j++) {
masu[i].push_back(0);
}
}
int n, m;
cin >> n >> m;
while (m--) {
int a, b, x;
cin >> a >> b >> x;
masu[a][b]++;
masu[a][b+1]--;
masu[a+x+1][b]--;
masu[a+x+1][b+x+2]++;
masu[a+x+2][b+1]++;
masu[a+x+2][b+x+2]--;
}
// 左から右
for (int i = 1; i <= n; i++) {
for (int j = 2; j <= i; j++) {
masu[i][j] += masu[i][j-1];
}
}
// 上から下
for (int j = 1; j <= n; j++) {
for (int i = j+1; i <= n; i++) {
masu[i][j] += masu[i-1][j];
}
}
// 左上から右下
for (int i = 1; i <= n; i++) {
for (int j = i+1; j <= n; j++) {
masu[j][j-i+1] += masu[j-1][j-i];
}
}
int num = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= i; j++) {
if (masu[i][j] >= 1) {
num++;
}
}
}
cout << num << endl;
return 0;
} |
#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>
#include <iomanip>
using namespace std;
typedef long long ll;
const int MODULO = 1000000000;
const int INF = 2000000000; //1e9 * 2
const double EPS = 1e-7;
const double PI = acos(-1.0);
typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
typedef complex<double> Cd;
#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)(c).size())
template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
//start
int* table[5000];
int main(){
FOR(i,5000) table[i] = (int*)calloc((i+1),sizeof(int));
int n,m; cin>>n>>m;
FOR(i,m){
int a,b,x; cin>>a>>b>>x;
a--;b--;
table[a][b] = x+1;
}
for(int i = 1; i < n; i++) FOR(j,i+1){
if(j==0) table[i][j] = max(table[i][j],table[i-1][j]-1);
else if(j == i) table[i][j] = max(table[i][j],table[i-1][j-1]-1);
else table[i][j] = max(table[i][j],max(table[i-1][j],table[i-1][j-1])-1);
}
int ans = 0;
FOR(i,n) FOR(j,i+1) ans += table[i][j] > 0;
cout << ans << endl;
return 0;
} |
#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
int N, M;
short t[5002][5002];
int area(int x){
return x * (x + 1) / 2;
}
int main(){
while(scanf("%d%d", &N, &M) != EOF){
memset(t, 0, sizeof(t));
for(int i = 0; i < M; i++){
int a, b, x;
scanf("%d%d%d", &a, &b, &x);
a--;
b--;
t[a][b] = max((int)t[a][b], x + 1);
}
int ans = 0;
for(int i = 0; i < N; i++){
for(int j = 0; j <= i; j++){
int l = 0, r = 0;
if(1 <= i){
if(j < i) r = t[i - 1][j];
if(0 <= j - 1) l = t[i - 1][j - 1];
}
int top = max((int)t[i][j], max(l, r) - 1);
if(top > 0) ans++;
t[i][j] = top;
//printf("%3d",t[i][j]);
}
//cout<<endl;
}
cout << ans << endl;
}
} |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <vector>
using namespace std;
int n,m;
//int *nail[5005];
vector< int > nail[5005];
int main(void)
{
scanf("%d %d",&n,&m);
/*
for(int i=0;i<=n+3;i++){
nail[i] = (int*)calloc(i+3,sizeof(int));
}
*/
for(int i=0;i<=n+3;i++){
nail[i].resize(i+3,0);
}
for(int i=0;i<m;i++){
int a,b,x;
scanf("%d %d %d",&a,&b,&x);
nail[a][b]++;
nail[a][b+1]--;
nail[a+x+1][b]--;
nail[a+x+2][b+1]++;
nail[a+x+1][b+x+2]++;
nail[a+x+2][b+x+2]--;
}
/*
for(int i=1;i<=n+1;i++){
for(int j=1;j<=n+1;j++){
printf("%2d",nail[i][j]);
}
puts("");
}
puts("");
*/
//横
for(int i=1;i<=n+2;i++){
for(int j=1;j <= i+2;j++){
nail[i][j] += nail[i][j-1];
}
}
/*
for(int i=1;i<=n+1;i++){
for(int j=1;j<=n+1;j++){
printf("%2d",nail[i][j]);
}
puts("");
}
puts("");
*/
//縦
for(int i=1;i<=n+2;i++){
for(int j=i;j <= n+2;j++){
nail[j][i] += nail[j-1][i];
}
}
/*
for(int i=1;i<=n+1;i++){
for(int j=1;j<=n+1;j++){
printf("%2d",nail[i][j]);
}
puts("");
}
puts("");
*/
int ret = 0;
//斜め
for(int i=1;i<=n;i++){
if(nail[i][1] > 0) ret++;
for(int j=1;j <= n-i+1;j++){
nail[i+j][j+1] += nail[i+j-1][j];
if(nail[i+j][j+1] > 0) ret++;
}
}
/*
for(int i=1;i<=n+1;i++){
for(int j=1;j<=n+1;j++){
printf("%2d",nail[i][j]);
}
puts("");
}
puts("");
*/
/*
for(int i=1;i<=n;i++){
for(int j=1;j<=i;j++){
if(nail[i][j]>0){
ret++;
}
}
}
*/
printf("%d\n",ret);
/*
for(int i=0;i<=n+5;i++){
free(nail[i]);
}
*/
} |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<string.h>
#define lol(i,n) for(int i=0;i<n;i++)
#define mod 1000000007
typedef long long ll;
using namespace std;
#define N 5010
int cntL[N],cntR[N],n,m;
int chL[N][N],chR[N][N];
void D(){
for(int j=0;j<=n;j++){
cout<<cntL[j]<<" ";
}cout<<" ";
for(int j=0;j<=n;j++){
cout<<cntR[j]<<" ";
}cout<<endl;
}
int main(){
cin>>n>>m;
memset(cntL,0,sizeof(cntL));
memset(cntR,0,sizeof(cntR));
memset(chL,0,sizeof(chL));
memset(chR,0,sizeof(chR));
lol(i,m){
int a,b,x;
cin>>a>>b>>x;a--,b--,x++;
chL[a+x][b]++;
chL[a][b]--;
chR[a+x][b+x+n-(a+x)]++;
chR[a][b+x+n-(a+x)]--;
}
int ans=0;
for(int i=n;i>=0;i--){
for(int j=0;j<=n;j++){
cntL[j]+=chL[i][j];
cntR[j]+=chR[i][j];
}
int cs=0;
for(int j=0;j<=i;j++){
cs+=cntL[j]-cntR[j+n-i];
if(cs>0)ans++;
//cout<<cs<<" ";
}
//cout<<endl;
//D();
}
cout<<ans<<endl;
return 0;
}
|
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
int N,M;
int G[(5000*5001)/2];
int sum(int a){
return N*(N+1)/2 - (N-a)*(N-a+1)/2;
}
int calc_id(int y,int x){
return sum(x-1)+ y - x;
}
int main(){
scanf("%d %d",&N,&M);
memset(G,-1,sizeof(G));
for(int i=0;i<M;i++){
int a,b,x;
scanf("%d %d %d",&a,&b,&x);
int id = calc_id(a,b);
G[id] = max(G[id],x);
}
int res = 0;
for(int y=1;y<=N;y++){
for(int x=1;x<=y;x++){
int id = calc_id(y,x);
if(G[id]==-1) continue;
res++;
if(y+1 > N) continue;
int id1 = calc_id(y+1,x);
int id2 = calc_id(y+1,x+1);
G[id1]=max(G[id1],G[id]-1);
G[id2]=max(G[id2],G[id]-1);
}
}
printf("%d\n",res);
} |
# include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <tuple>
# include <unordered_map>
# include <numeric>
# include <complex>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
constexpr int INF = 2000000000;
constexpr int HINF = INF / 2;
constexpr double DINF = 100000000000000000.0;
constexpr long long LINF = 9223372036854775807;
constexpr long long HLINF = 4500000000000000000;
const double PI = acos(-1);
int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 };
# define ALL(x) (x).begin(),(x).end()
# define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
# define mp make_pair
# define eb emplace_back
# define FOR(i,a,b) for(int i=(a);i<(b);++i)
# define REP(i,n) FOR(i,0,n)
# define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
int trimos[5050][5050];
int main() {
int n, m;
cin >> n >> m;
int a, b, c;
for (int i = 0; i < m; i++) {
cin >> a >> b >> c;
c++;
trimos[a][b]++;
trimos[a][b + 1]--;
trimos[a + c][b]--;
trimos[a + c + 1][b + 1]++;
trimos[a + c][b + c + 1]++;
trimos[a + c + 1][b + c + 1]--;
}
for (int i = 1; i <= n + 1; i++) {
for (int j = 1; j <= n + 1; j++) {
trimos[i][j] += trimos[i][j - 1];
}
}
for (int i = 1; i <= n + 1; i++) {
for (int j = 1; j <= n + 1; j++) {
trimos[i][j] += trimos[i - 1][j - 1];
}
}
for (int i = 1; i <= n + 1; i++) {
for (int j = 1; j <= n + 1; j++) {
trimos[i][j] += trimos[i - 1][j];
}
}
int ans = 0;
for (int k = 0; k <= n; k++) {
for (int j = 0; j <= n; j++) {
//cout << trimos[k][j] << " ";
if (trimos[k][j])ans++;
}
//cout << endl;
}
//system("pause");
cout << ans << endl;
} |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
#define chmin(a, b) ((a) = min((a), (b)))
#define chmax(a, b) ((a) = max((a), (b)))
#define fs first
#define sc second
#define eb emplace_back
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
const double pi = acos(-1);
const double eps = 1e-10;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, -1, 0, 1};
int main(){
int n, m; cin>>n>>m;
vector<vector<int>> imos(n+10, vector<int>(n+10, 0));
for(int i=0; i<m; i++){
int a, b, x; cin>>a>>b>>x;
imos[a][b]++;
imos[a][b+1]--;
imos[a+x+1][b]--;
imos[a+x+1][b+x+2]++;
imos[a+x+2][b+1]++;
imos[a+x+2][b+x+2]--;
}
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++){
imos[i][j+1] += imos[i][j];
}
}
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++){
imos[j+1][i] += imos[j][i];
}
}
for(int i=1; i<=n; i++){
int cnt = 0;
for(int j=1; j<=n-i+1; j++){
imos[i+1+cnt][j+1] += imos[i+cnt][j];
cnt++;
}
}
int ans = 0;
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++){
if(0 < imos[i][j]) ans++;
}
}
cout << ans << endl;
}
|
#include<iostream>
#include<vector>
using namespace std;
#define N 5100
vector<int> x[N];
int n,m,a,b,c,cnt;
int V[N];
int main(){
for(int i=0;i<N;i++){
for(int j=0;j<i+5;j++){
x[i].push_back(0);
V[i]=j;
}
}
cin>>n>>m;
for(int i=0;i<m;i++){
cin>>a>>b>>c;c++;
x[a][b]++;
x[a+c][b]--;
x[a+c+1][b+1]++;
x[a][b+1]--;
x[a+c][b+c+1]++;
x[a+c+1][b+c+1]--;
}
for(int i=0;i<N;i++){
for(int j=1;j<N;j++){
if(j<V[i]){
x[i][j]+=x[i][j-1];
}
}
}
for(int j=0;j<N;j++){
for(int i=1;i<N;i++){
if(j<V[i]){
x[i][j]+=x[i-1][j];
}
}
}
for(int i=0;i<=n;i++){
for(int j=0;j<=n-i;j++){
if(j+1<V[i+j+1]){
x[i+j+1][j+1]+=x[i+j][j];
}
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(j<V[i]){
if(x[i][j]>=1){cnt++;}
}
}
}
cout<<cnt<<endl;
return 0;
} |
#include <iostream>
#include <vector>
using namespace std;
//int nail[5004][5004]={};
int main(){
int N,M;
cin >> N >> M;
vector<int> nail[N+5];
for(int i=0; i<N+5; ++i) nail[i].resize(i+5);
for(int i=0; i<M; ++i){
int a,b,x;
cin >> a >> b >> x;
++a;
++b;
--nail[a+x-1][b-1];
++nail[a+x][b];
--nail[a+x][b+x+1];
++nail[a+x-1][b+x+1];
++nail[a-2][b-1];
--nail[a-2][b];
}
for(int x=N+2; x>=0; --x ){
for(int y=nail[x].size()-1; y>=0; --y){
nail[x][y]+=nail[x+1][y+1];
}
}
for(int x=N+2; x>=0; --x){
for(int y=0; y<=nail[x].size()-1; ++y){
nail[x][y]+=nail[x+1][y];
}
}
long long int ans=0;
for(int x=0; x<=N+2; ++x){
for(int y=1; y<=nail[x].size()-1; ++y){
nail[x][y]+=nail[x][y-1];
if(nail[x][y]>=1) ++ans;
}
}
cout << ans << endl;
return 0;
} |
#include <cstdio>
#include <algorithm>
using namespace std;
int main()
{
int N, M;
scanf("%d %d", &N, &M);
static int a[5001][5001];
for (int i = 0; i < M; i++) {
int A, B, X;
scanf("%d %d %d", &A, &B, &X);
a[A][B] = X+1;
}
int ans = 0;
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= i; j++) {
a[i][j] = max(a[i][j], a[i-1][j] - 1);
a[i][j] = max(a[i][j], a[i-1][j-1] - 1);
if (a[i][j] > 0) {
++ans;
}
}
}
printf("%d\n", ans);
return 0;
} |
#include <stdio.h>
#include <cmath>
#include <algorithm>
#include <cfloat>
#include <stack>
#include <queue>
#include <vector>
#include <string>
#include <iostream>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
int main(){
int N,M;
scanf("%d %d",&N,&M);
int** left = new int*[N+2];
int** right = new int*[N+2];
for(int i = 0; i <= N+1; i++){
left[i] = new int[N+2];
right[i] = new int[N+2];
for(int k = 0; k <= N+1; k++){
left[i][k] = 0;
right[i][k] = 0;
}
}
int row,col,length;
for(int loop = 0; loop < M; loop++){
scanf("%d %d %d",&row,&col,&length);
left[row][col]++;
left[row+length+1][col]--;
right[row][col+1]--;
right[row+length+1][col+1+length+1]++;
}
int tmp_row,tmp_col;
for(int row = 1; row <= N; row++){
tmp_row = row;
tmp_col = 1;
while(tmp_row <= N && tmp_col <= N){
tmp_row++;
tmp_col++;
right[tmp_row][tmp_col] += right[tmp_row-1][tmp_col-1];
}
}
for(int col = 1; col <= N; col++){
for(int row = col+1; row <= N; row++){
left[row][col] += left[row-1][col];
}
}
for(int row = 1; row <= N; row++){
for(int col = 1; col <= row; col++){
left[row][col] += right[row][col];
}
}
for(int row = 1; row <= N; row++){
for(int col = 1; col <= row; col++){
left[row][col] += left[row][col-1];
}
}
int ans = 0;
for(int row = 1; row <= N; row++){
for(int col = 1; col <= row; col++){
if(left[row][col] > 0){
ans++;
}
}
}
printf("%d\n",ans);
return 0;
} |
#include<iostream>
#include<cstdio>
using namespace std;
short dp[5001][5001];
int n,m;
short max2(short a,short b){
if(a>b)return a;
return b;
}
int main(void){
scanf("%d%d",&n,&m);
for(int i=0;i<m;i++){
int a,b,x;
scanf("%d%d%d",&b,&a,&x);
a--,b--;
dp[a][b]=max2(dp[a][b],x+1);
}
int cnt=0;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(dp[j][i]>0)cnt++;
dp[j][i+1]=max2(dp[j][i+1],dp[j][i]-1);
dp[j+1][i+1]=max2(dp[j+1][i+1],dp[j][i]-1);
}
}
printf("%d\n",cnt);
return 0;
} |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(__typeof((X).begin()) it=(X).begin();it!=(X).end();it++)
#define ite iterator
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define sec second
#define sz(x) ((int)x.size())
using namespace std;
typedef istringstream iss;
typedef long long ll;
typedef pair<int,int> pi;
typedef stringstream sst;
typedef vector<int> vi;
int N,M;
int row[5010],dia[5010];
vector<int> v;
#define tri(y,x,t) ((y)<<15|(x)<<2|(t))
int main(){
cin.tie(0);
ios_base::sync_with_stdio(0);
cin>>N>>M;
int A,B,X;
rep(i,M){
cin>>A>>B>>X;
X++;
v.pb(tri(A,B,0));
v.pb(tri(A+X,B,1));
v.pb(tri(A ,B+1,3));
v.pb(tri(A+X,B+X+1,2));
}
v.pb(INF);
sort(v.begin(),v.end());
int ans=0,sum,cur=0;
rep2(y,1,N+2){
sum=0;
rep2(x,1,y+2){
while((v[cur]>>2)==(y<<13|x)){
switch(v[cur]&3){
case 0: row[x]++;break;
case 1: row[x]--;break;
case 2: dia[y-x+1]++;break;
case 3: dia[y-x+1]--;break;
}
cur++;
}
sum+=row[x]+dia[y-x+1];
ans+=sum>0;
}
}
cout<<ans<<endl;
} |
#include<stdio.h>
short t[5000][5000];
int max(int a,int b){return a>b?a:b;}
int main(){
int n,k;
int i,j;
scanf("%d %d",&n,&k);
for(i=0;i<n;i++)for(j=0;j<n;j++)t[i][j]=-1;
for(i=0;i<k;i++){
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
t[a-1][b-1]=max(t[a-1][b-1],c);
}
for(i=0;i<n-1;i++){
for(j=0;j<n;j++){
if(t[i][j]>0){
t[i+1][j]=max(t[i+1][j],t[i][j]-1);
if(j<n-1)t[i+1][j+1]=max(t[i+1][j+1],t[i][j]-1);
}
}
}
int ans=0;
for(i=0;i<n;i++)for(j=0;j<n;j++)if(t[i][j]>=0)ans++;
printf("%d\n",ans);
return 0;
}
|
#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>
#include <iomanip>
using namespace std;
typedef long long ll;
const int MODULO = 1000000000;
const int INF = 2000000000; //1e9 * 2
const double EPS = 1e-7;
const double PI = acos(-1.0);
typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
typedef complex<double> Cd;
#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)(c).size())
template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
//start
short table[5000][5000];
int main(){
int n,m; cin>>n>>m;
FOR(i,m){
short a,b,x; cin>>a>>b>>x;
a--;b--;
table[a][b] = x+1;
}
for(int i = 1; i < n; i++) FOR(j,i+1){
if(j==0) table[i][j] = max<short>(table[i][j],table[i-1][j]-1);
else if(j == i) table[i][j] = max<short>(table[i][j],table[i-1][j-1]-1);
else table[i][j] = max<short>(table[i][j],max(table[i-1][j],table[i-1][j-1])-1);
}
int ans = 0;
FOR(i,n) FOR(j,i+1) ans += table[i][j] > 0;
cout << ans << endl;
return 0;
} |
#include<cstdio>
#include<algorithm>
using namespace std;
int n,m;
int a,b,x;
short dp[5000][5000];
int main(){
scanf("%d%d",&n,&m);
for(int i=0;i<n;i++)
for(int j=0;j<=i;j++)dp[i][j] = -1;
for(int i=0;i<m;i++){
scanf("%d%d%d",&a,&b,&x);
a--; b--;
dp[a][b] = max(dp[a][b],(short)x);
}
for(int i=0;i<n;i++){
for(int j=0;j<=i;j++){
if(i){
dp[i][j] = max(dp[i][j],(short)(dp[i-1][j]-1));
if(j)dp[i][j] = max(dp[i][j],(short)(dp[i-1][j-1]-1));
}
}
}
int ans = 0;
for(int i=0;i<n;i++)
for(int j=0;j<=i;j++)
if(0<=dp[i][j])ans++;
printf("%d\n",ans);
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=1;i<=n;i++)
#define drep(i,n) for(int i=n;i>=0;i--)
#define MAX 10500
#define B 100
#define dpb push_back
#define fi first
#define se second
typedef pair<int, int> P;
typedef long long ll;
const int inf = 1e9;
const ll INF = 1e16;
//__gcd(a,b), __builtin_popcount(a);
int a[MAX][MAX];
int main(){
int n, m, y, x, d;
scanf("%d%d", &n, &m);
for(int i = 0;i < m;i++){
scanf("%d%d%d", &y, &x, &d);
x = 5002-y-1+2*(x-1);
a[y][x]++;a[y][x+2]--;
a[y+d+1][x-d-1]--;a[y+d+2][x-d]++;
a[y+d+1][x-d-1+2*(d+2)]++;a[y+d+2][x-d+2*(d+1)]--;
}
for(int i = 1;i <= n+3;i++){
for(int j = 2;j < MAX;j++){
a[i][j] += a[i][j-2];
}
}
for(int i = 1;i <= n+3;i++){
for(int j = 1;j < MAX;j++){
a[i][MAX-j] += a[i-1][MAX-j+1];
}
}
int ans = 0;
for(int i = 1;i <= n;i++){
for(int j = 1;j < MAX;j++){
a[i][j] += a[i-1][j-1];
if(a[i][j] != 0)ans++;
}
}
//int ans = 0;
/*for(int i = 1;i < 10;i++){
for(int j = 4990;j < 5010;j++)printf("%2d ", a[i][j]);
printf("\n");
}*/
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for(int i=a; i<b; i++)
#define N 5123
int n, m;
int l[N][N], r[N][N];
int main(){
scanf("%d%d", &n, &m);
REP(i, N) REP(j, N) l[i][j]=r[i][j]=0;
REP(i, m){
int a, b, x;
scanf("%d%d%d", &a, &b, &x); a--; b--;
l[a][b]++;
r[a][b+1]++;
l[a+x+1][b]--;
r[a+x+1][b+x+2]--;
}
int ans = 0;
FOR(i, 1, n){
REP(j, i+2){
l[i][j]+=l[i-1][j];
r[i][j+2]+=r[i-1][j+1];
}
}
REP(i, n){
int a = 0;
REP(j, i+1){
a+=l[i][j];
a-=r[i][j];
if(a) ans++;
}
}
printf("%d\n", ans);
} |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<cstdio>
#include<sstream>
#include<iomanip>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
//kaewasuretyuui
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef pair<int,pii> pip;
typedef vector<pip>vip;
const double PI=acos(-1);
const double EPS=1e-8;
const int inf=1<<30;
int main(){
int n,m;
cin>>n>>m;
vvi in(n+3,vi(n+3));
while(m--){
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
a--;b--;
in[a][b]++;
in[a][b+1]--;
in[a+c+1][b]--;
in[a+c+1][b+c+2]++;
in[a+c+2][b+1]++;
in[a+c+2][b+c+2]--;
}
int co=0;
rep(i,n+2)rep(j,n+2)in[i+1][j+1]+=in[i][j];
rep(i,n+2)rep(j,n+3)in[i+1][j]+=in[i][j];
rep(i,n+3)rep(j,n+2)in[i][j+1]+=in[i][j];
rep(i,n+3)rep(j,n+3)if(in[i][j])co++;
cout<<co<<endl;
} |
#include <cstdio>
#pragma warning(disable : 4996)
int N, Q, x, y, z, inv2_vert[5009][5009], inv2_diag[5009][5009], imos[5009][5009];
int main() {
scanf("%d%d", &N, &Q);
while (Q--) {
scanf("%d%d%d", &x, &y, &z), x--, y--, z++;
inv2_vert[x][y]++; inv2_vert[x + z][y]--;
inv2_diag[x][y + 1]--; inv2_diag[x + z][y + z + 1]++;
}
for (int i = 0; i < N; i++) {
int sum = 0;
for (int j = i; j < N; j++) {
sum += inv2_vert[j][i];
imos[j][i] += sum;
}
sum = 0;
for (int j = 0; j < N - i; j++) {
sum += inv2_diag[i + j][j];
imos[i + j][j] += sum;
}
}
int ret = 0;
for (int i = 0; i < N; i++) {
int sum = 0;
for (int j = 0; j <= i; j++) {
sum += imos[i][j];
if (sum) ret++;
}
}
printf("%d\n", ret);
return 0;
} |
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<cstring>
#define MP make_pair
#define PB push_back
using namespace std;
typedef pair<int, bool> PIB;
typedef vector<PIB> VP;
typedef VP::iterator VPI;
int n, m;
int triangle[2][5010][2];
VP tilt[5005], vertical[5005];
int ans = 0;
int main()
{
cin >> n >> m;
for(int i = 0; i < m; i++){
int a, b, x;
cin >> a >> b >> x;
vertical[a].PB(MP(b, true));
vertical[a + x + 1].PB(MP(b, false));
tilt[a].PB(MP(b + 1, false));
tilt[a + x + 1].PB(MP(b + x + 2, true));
}
for(int i = 1; i <= n; i++){
sort(tilt[i].begin(), tilt[i].end());
sort(vertical[i].begin(), vertical[i].end());
}
for(int i = 1; i <= n; i++){
memset(triangle[i & 1], 0, sizeof triangle[i & 1]);
int nownum = 0;
VPI p1 = vertical[i].begin(), p2 = tilt[i].begin();
for(int j = 1; j <= i; j++){
triangle[i & 1][j][0] = triangle[!(i & 1)][j][0];
triangle[i & 1][j][1] = triangle[!(i & 1)][j - 1][1];
while(p1 != vertical[i].end() && p1->first == j){
triangle[i & 1][j][0] += p1->second ? 1 : -1;
p1++;
}
while(p2 != tilt[i].end() && p2->first == j){
triangle[i & 1][j][1] += p2->second ? 1 : -1;
p2++;
}
nownum += triangle[i & 1][j][0] + triangle[i & 1][j][1];
if(nownum > 0)
ans++;
}
}
cout << ans << endl;
return 0;
} |
#include <string>
#include <vector>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <map>
#include <list>
#include <set>
#include <numeric>
#include <queue>
#include <stack>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <climits>
#include <cfloat>
#include <ctime>
#include <complex>
#include <cassert>
#include <iomanip>
using namespace std;
typedef long long LL;
typedef pair<int,int> P;
short board[5001][5001];
int main() {
int N,M;
scanf("%d%d",&N,&M);
for(int i=0;i<M;i++){
int a,b,x;
scanf("%d%d%d",&a,&b,&x);
board[a][b]=max(board[a][b],(short)(x+1));
}
int ret=0;
for(int i=1;i<=N;i++){
for(int j=1;j<=i;j++){
board[i][j]=max((int)board[i][j],board[i-1][j]-1);
board[i][j]=max((int)board[i][j],board[i-1][j-1]-1);
if(board[i][j]){
ret++;
}
//cout << i << ", " << j << ": " << board[i][j] << endl;
}
}
printf("%d\n",ret);
} |
#include<iostream>
#include<cstdio>
#include<vector>
using namespace std;
int n,m,ans=0;
vector<int> tri[5005];
int main(void){
scanf("%d%d",&n,&m);
for(int i=0;i<=5003;i++){
for(int j=0;j<=i+3;j++)tri[i].push_back(0);
}
for(int i=0;i<m;i++){
int x,y,size;
scanf("%d%d%d",&y,&x,&size);
size++;
tri[y][x]+=1;
tri[y][x+1]-=1;
tri[y+size][x]-=1;
tri[y+size+1][x+1]+=1;
tri[y+size][x+size+1]+=1;
tri[y+size+1][x+size+1]-=1;
}
for(int i=2;i<=n;i++){
for(int j=2;j<=i;j++){
tri[i][j]+=tri[i][j-1];
}
}
for(int i=1;i<=n;i++){
for(int j=i+1;j<=n;j++){
tri[j][i]+=tri[j-1][i];
}
}
for(int i=1;i<=n;i++){
int y=i+1,x=2;
while(y<=n){
tri[y][x]+=tri[y-1][x-1];
y++,x++;
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=i;j++){
if(tri[i][j]>=1)ans++;
}
}
printf("%d\n",ans);
return 0;
} |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<cstdio>
#include<sstream>
#include<iomanip>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
//kaewasuretyuui
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef pair<int,pii> pip;
typedef vector<pip>vip;
const double PI=acos(-1);
const double EPS=1e-8;
const int inf=1<<30;
int main(){
int n,m;
cin>>n>>m;
vvi in(n+3,vi(n+3));
while(m--){
int a,b,c;
cin>>a>>b>>c;
a--;b--;
in[a][b]++;
in[a][b+1]--;
in[a+c+1][b]--;
in[a+c+1][b+c+2]++;
in[a+c+2][b+1]++;
in[a+c+2][b+c+2]--;
}
int co=0;
rep(i,n+2)rep(j,n+2)in[i+1][j+1]+=in[i][j];
rep(i,n+2)rep(j,n+3)in[i+1][j]+=in[i][j];
rep(i,n+3)rep(j,n+2)in[i][j+1]+=in[i][j];
rep(i,n+3)rep(j,n+3)if(in[i][j])co++;
cout<<co<<endl;
} |
#include <iostream>
#include <vector>
using namespace std;
int N, M;
vector< vector<bool> > ts;
vector< vector<int> > done;
void init() {
cin >> N >> M;
ts.resize(N);
done.resize(N);
for (int i = 0; i < N; i++) {
ts[i].resize(i+1, false);
done[i].resize(i+1, -1);
}
}
void enclose(int a, int b, int x) {
if (done[a][b] < x) {
ts[a][b] = true; if (x == 0) return;
enclose(a+1, b, x-1);
enclose(a+1, b+1, x-1);
done[a][b] = x;
}
}
int main() {
init();
for (int i = 0; i < M; i++) {
int A, B, X;
cin >> A >> B >> X;
A--, B--;
enclose(A, B, X);
}
int cnt = 0;
for (int i = 0; i < N; i++)
for (int j = 0; j < ts[i].size(); j++)
if (ts[i][j]) cnt++;
cout << cnt << endl;
return 0;
} |
// awesome imos method!!!
#include<cstdio>
#include<cstdlib>
#include<cstring>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main(){
int n,m; scanf("%d%d",&n,&m);
int *nail[5002];
rep(i,n+2){
nail[i]=(int *)malloc((i+3)*sizeof(int));
memset(nail[i],0,sizeof nail[i]);
}
rep(i,m){
int a,b,x; scanf("%d%d%d",&a,&b,&x); a--; b--;
nail[a][b]++;
nail[a][b+1]--;
nail[a+x+1][b]--;
nail[a+x+2][b+1]++;
nail[a+x+1][b+x+2]++;
nail[a+x+2][b+x+2]--;
}
rep(i,n+2) rep(j,i+1) nail[ i ][j+1]+=nail[i][j];
rep(i,n+1) rep(j,i+1) nail[i+1][ j ]+=nail[i][j];
rep(i,n+1) rep(j,i+1) nail[i+1][j+1]+=nail[i][j];
int ans=0;
rep(i,n) rep(j,i+1) if(nail[i][j]>0) ans++;
printf("%d\n",ans);
return 0;
} |
#include<iostream>
#include<algorithm>
using namespace std;
short max(int a,int b){
if(a>b)return a;
return b;
}
short nails[5001][5001];
int main(void){
int n,m,a,b,x;
cin >> n >> m;
for(int i=0;i<m;i++){
cin >> a >> b >> x;
nails[a][b]=x+1;
}
for(int i=1;i<=n;i++){
for(int j=1;j<=i;j++){
nails[i][j]=max(nails[i][j],max(nails[i-1][j-1],nails[i-1][j])-1);
}
}
int cnt=0;
for(int i=1;i<=n;i++)
for(int j=1;j<=i;j++)
if(nails[i][j]>0)cnt++;
cout << cnt << endl;
return 0;
} |
#include<iostream>
#include<cmath>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<cassert>
#define REP(i,s,n) for(int i=s;i<n;i++)
#define rep(i,n) REP(i,0,n)
#define inf (1<<29)
#define MAX 5100
using namespace std;
int N,M;
//int g[MAX][MAX];
int main()
{
scanf("%d %d",&N,&M);
vector<int> g[N+5];
rep(i,N+5)g[i].resize(i+5);
rep(i,N+5)rep(j,i+1)g[i][j] = 0;
rep(i,M)
{
int x,y,d;
scanf("%d %d %d",&y,&x,&d);
x--,y--;
g[y][x]++,g[y+d+2][x+1]++,g[y+d+1][x+d+2]++;
g[y][x+1]--,g[y+d+1][x]--,g[y+d+2][x+d+2]--;
}
rep(i,N+2)rep(j,i+2)if(j-1>=0)g[i][j] += g[i][j-1];
rep(x,N+2)REP(y,x,N+2)if(y-1>=0)g[y][x] += g[y-1][x];
rep(i,N+2)
{
int y = i,x = 0;
while(y <= N+2 && x <= N+2)
{
if(y-1>=0 && x-1>=0)g[y][x] += g[y-1][x-1];
y++,x++;
}
}
int ans = 0;
rep(y,N+2)rep(x,y+2)if(g[y][x]>0)ans++;
cout << ans << endl;
return 0;
} |
#include <cstdio>
#include <iostream>
#include <vector>
#include <list>
#include <cmath>
#include <fstream>
#include <algorithm>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <complex>
#include <iterator>
#include <cstdlib>
#include <cstring>
#include <sstream>
using namespace std;
const double EPS=(1e-10);
typedef long long ll;
typedef pair<int,int> pii;
bool EQ(double a,double b){
return abs((a)-(b))<EPS;
}
void fast_stream(){
std::ios_base::sync_with_stdio(0);
}
short dp[5002][5002];
void dfs(int x,int y,int depth){
if(dp[y][x]>=depth)return;
dp[y][x]=depth;
if(depth==0)return;
int ny=y+1;
int nx=x+1;
dfs(nx,ny,depth-1);
ny=y;
dfs(nx,ny,depth-1);
}
void solve(){
memset(dp,-1,sizeof(dp));
int n,m;
cin>>n>>m;
for(int i=0;i<m;i++){
int x,y,a;
cin>>x>>y>>a;
dp[x][y]=a;
//dfs(x,y,a);
}
for(int i=1;i<=n;i++){
for(int j=1;j<=i;j++){
dp[i+1][j+1]=max(dp[i+1][j+1],(short)(dp[i][j]-1));
dp[i+1][j]=max(dp[i+1][j],(short)(dp[i][j]-1));
}
}
int cnt=0;
for(int i=1;i<=n;i++){
for(int j=1;j<=i;j++){
if(dp[i][j]>=0)cnt++;
}
}
cout<<cnt<<endl;
}
int main(){
solve();
return 0;
} |
#include <bits/stdc++.h>
#define filein(t) freopen(t, "r", stdin)
#define fileout(t) freopen(t, "w", stdout)
#define f first
#define s second
#define cs 137
#define ll long long
#define mp make_pair
#define N 5025
#define ln 1e9
#define oo 111539786
#define Pa pair < int, int >
#define Pi pair < int, Pa >
using namespace std;
int n, m, P[N][N], Q[N][N], Val[N][N];
int ans = 0;
int main()
{
//filein("NAILS.inp"); fileout("NAILS.out");
int u, v, x;
cin >> n >> m;
for(int i=1; i<=m; i++)
{
cin >> u >> v >> x;
P[u+x][v]++; P[u+x][v+x+1]--;
Q[u+x-1][v+x]--;
if(u - 2 >= 0) Q[u-2][v-1]++;
}
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
P[i][j] += P[i][j-1];
for(int i=n; i>=1; i--)
for(int j=n; j>=1; j--)
Q[i][j] += Q[i+1][j+1];
for(int j=1; j<=n; j++)
for(int i=n; i>=1; i--)
Val[i][j] = Val[i+1][j] + P[i][j] + Q[i][j];
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
ans += Val[i][j] != 0;
cout << ans << endl;
} |
#include<stdio.h>
short imos[5001][5001];
int max(int a,int b){return a>b?a:b;}
int main(){
int n,m;
scanf("%d %d",&n,&m);
int i,j;
for(i=0;i<=n;i++)for(j=0;j<=n;j++)imos[i][j]=0;
for(i=0;i<m;i++){
int x,y,s;
scanf("%d %d %d",&x,&y,&s);
x--;y--;
imos[x][y]=max(imos[x][y],s+1);
}
int ans=0;
for(i=0;i<n;i++){
for(j=0;j<=i;j++){
if(imos[i][j]>0){
ans++;
imos[i+1][j]=max(imos[i+1][j],imos[i][j]-1);
imos[i+1][j+1]=max(imos[i+1][j+1],imos[i][j]-1);
}
}
}
printf("%d\n",ans);
return 0;
}
|
#include <cstdio>
using namespace std;
int n, m;
int t[5010][5010];
void imos(int a, int b, int x){
++t[a][b];
--t[a][b+1];
--t[a+x+1][b];
++t[a+x+2][b+1];
++t[a+x+1][b+x+2];
--t[a+x+2][b+x+2];
}
int main(){
scanf("%d %d", &n, &m);
for(int i=0; i<m; ++i){
int a, b, x;
scanf("%d %d %d", &a, &b, &x);
imos(a, b, x);
}
/*
for(int i=1; i<=n+2; ++i){
for(int j=1; j<=n+2; ++j)
printf("%d\t", t[i][j]);
printf("\n");
}
*/
for(int i=1; i<=n; ++i)
for(int j=2; j<=n; ++j)
t[i][j] += t[i][j-1];
for(int i=1; i<=n; ++i)
for(int j=2; j<=n; ++j)
t[j][i] += t[j-1][i];
for(int i=1; i<=n; ++i)
for(int j=2; j<=i; ++j)
t[i][j] += t[i-1][j-1];
int ans = 0;
for(int i=1; i<=n; ++i)
for(int j=1; j<=i; ++j)
if(t[i][j] > 0) ans++;
printf("%d\n", ans);
/*
for(int i=1; i<=n; ++i){
for(int j=1; j<=n; ++j)
printf("%d ", t[i][j]);
printf("\n");
}
*/
} |
#include<iostream>
using namespace std;
int ma[5000][5000] = {};
int main(){
int n, m;
cin >> n >> m;
while(m-- > 0){
int a, b, x;
cin >> a >> b >> x;
a--, b--;
ma[a+x][b] = max(ma[a+x][b], x+1);
}
int ans = 0;
for(int i = n-1;; i--){
int val = 0;
for(int j = 0; j <= i; j++){
val = max(val, ma[i][j]);
if(val > 0) ans++;
val--;
}
if(i == 0) break;
for(int j = 0; j <= i-1; j++){
ma[i-1][j] = max(ma[i-1][j], ma[i][j]-1);
}
}
cout << ans << endl;
return 0;
}
|
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
vector<int> vec[5010];
int main(){
int n,m,a,b,x,ans;
cin >> n >> m;
for(int i=0;i<n;i++){
for(int j=0;j<=i;j++) vec[i].push_back(0);
}
for(int i=0;i<m;i++){
cin >> a >> b >> x;
vec[a-1][b-1] = x+1;
}
for(int i=0;i<n-1;i++){
for(int j=0;j<=i;j++){
vec[i+1][j] = max(vec[i+1][j],vec[i][j]-1);
vec[i+1][j+1] = max(vec[i+1][j+1],vec[i][j]-1);
}
}
ans = 0;
for(int i=0;i<n;i++){
for(int j=0;j<=i;j++){
if(vec[i][j] > 0) ans++;
}
}
cout << ans << endl;
return(0);
}
|
#include<bits/stdc++.h>
using namespace std;
static vector< int > sum[5011];
int main(){
for(int i = 0; i <= 5010 ; i++){
sum[i].resize(i + 10, 0);
}
int N, M;
scanf("%d %d", &N, &M);
for(int i = 0; i < M; i++){
int a, b, x;
scanf("%d %d %d", &a, &b, &x);
++sum[a][b];
--sum[a][b + 1];
++sum[a + x + 1][b + x + 2];
--sum[a + x + 2][b + x + 2];
++sum[a + x + 2][b + 1];
--sum[a + x + 1][b];
}
for(int i = 1; i <= N + 10; i++){
for(int j = 1; j <= i + 5; j++){
sum[i][j] += sum[i - 1][j - 1];
}
}
for(int i = 1 ; i <= N + 10 ; i++){
for(int j = 1 ; j <= i + 5; j++){
sum[i][j] += sum[i][j - 1];
}
}
for(int i = 1; i <= N + 10; i++){
for(int j = 1; j <= i + 5; j++){
sum[i][j] += sum[i - 1][j];
}
}
int ret = 0, cnt = 0;
for(int i = 1; i <= N; i++){
for(int j = 1; j <= i; j++){
if(sum[i][j]) ret++;
}
}
printf("%d\n", ret);
} |
#include <cstdio>
#define S 5010
using namespace std;
int l[S][S]={0};
int main(){
int N,M,a,b,x,i,j;
scanf("%d %d",&N,&M);
for(i=0;i<M;i++){
scanf("%d %d %d",&a,&b,&x);
l[a][b]++;
l[a][b+1]--;
l[a+x+1][b]--;
l[a+x+2][b+1]++;
l[a+x+2][b+x+2]--;
l[a+x+1][b+x+2]++;
}
for(i=1;i<N+4;i++){
for(j=1;j<N+4;j++){
l[i][j]+=l[i][j-1];
}
}
for(j=1;j<N+4;j++){
for(i=1;i<N+4;i++){
l[i][j]+=l[i-1][j];
}
}
for(i=1;i<N+4;i++){
for(j=1;j<N+4;j++){
if(i+j-1<S){
l[i+j-1][j]+=l[i+j-2][j-1];
}
}
}
int cnt=0;
for(i=0;i<N+4;i++){
for(j=0;j<N+4;j++){
if(l[i][j]>0){cnt++;}
}
}
printf("%d\n",cnt);
return 0;
}
|
#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>
#include <iomanip>
using namespace std;
typedef long long ll;
const int MODULO = 1000000000;
const int INF = 2000000000; //1e9 * 2
const double EPS = 1e-7;
const double PI = acos(-1.0);
typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
typedef complex<double> Cd;
#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)(c).size())
template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
//start
int* table[5010];
int main(){
FOR(i,5010) table[i] = (int*)calloc((i+3),sizeof(int));
int n,m; cin>>n>>m;
FOR(i,m){
int a,b,x; cin>>a>>b>>x;
a--; b--;
table[a][b]++;
table[a][b+1]--;
table[a+x+1][b+x+2]++;
table[a+x+1][b]--;
table[a+x+2][b+1]++;
table[a+x+2][b+x+2]--;
}
//右
FOR(i,n+2) FOR(j,i+1) table[i][j+1] += table[i][j];
//下
FOR(i,n+1) FOR(j,i+1) table[i+1][j] += table[i][j];
//右下
FOR(i,n+1) FOR(j,i+1) table[i+1][j+1] += table[i][j];
int ans = 0;
FOR(i,n) FOR(j,i+1) ans += table[i][j] > 0;
cout << ans << endl;
return 0;
} |
#include<cstdio>
#include<algorithm>
using namespace std;
int main(){
int n,m;
static int nails[2][5001][5001];
scanf("%d %d",&n,&m);
fill(nails[0][0],nails[0][0]+2*5001*5001,0);
for(int i=0;i<m;i++){
int a,b,x;
scanf("%d %d %d",&a,&b,&x);
nails[0][a-1][b-1]++;
nails[0][a+x][b-1]--;
nails[1][a-1][b]--;
nails[1][a+x][b+x+1]++;
}
for(int i=1;i<=n;i++){
for(int j=0;j<=i;j++){
nails[0][i][j] += nails[0][i-1][j];
if(j>=1) nails[1][i][j] += nails[1][i-1][j-1];
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=i+1;j++){
nails[0][i][j] += nails[0][i][j-1];
nails[1][i][j] += nails[1][i][j-1];
}
}
int ans = 0;
for(int i=0;i<=n;i++){
for(int j=0;j<=i;j++){
if(nails[0][i][j]+nails[1][i][j]>0) ans++;
}
}
printf("%d\n",ans);
} |
#include<iostream>
#include<cmath>
using namespace std;
short int D[5000][5000];
int main(){
int N,M;
int i,j;
int ans = 0;
cin >> N >> M;
for(i = 0;i < N;i++){
for(j = 0;j < N;j++){
D[i][j] = -1;
}
}
for(i = 0;i < M;i++){
short int a,b,c;
cin >> a >> b >> c;
a--;b--;
D[a][b] = max(D[a][b],c);
}
for(i = 0;i < N-1;i++){
for(j = 0;j < i+1;j++){
D[i+1][j] = max((short int)(D[i][j]-1),D[i+1][j]);
D[i+1][j+1] = max((short int)(D[i][j]-1),D[i+1][j+1]);
}
}
for(i = 0;i < N;i++){
for(j = 0;j < N;j++){
if(D[i][j] >= 0)
ans++;
}
}
cout << ans << endl;
return 0;
} |
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define INF 2000000000
#define LLINF 4000000000000000000
#define SIZE 5010
int main(){
vector<int > nails[SIZE+3];
int n,m,a,b,x,ans=0;
scanf("%d%d",&n,&m);
for(int i=0;i<=n+2;i++){
nails[i].resize(i+5,0);
}
for(int i=0;i<m;i++){
scanf("%d%d%d",&a,&b,&x);
nails[a][b]++;
nails[a][b+1]--;
nails[a+x+1][b]--;
nails[a+x+2][b+1]++;
nails[a+x+1][b+x+2]++;
nails[a+x+2][b+x+2]--;
}
for(int i=1;i<=n;i++){
for(int j=1;j<=i;j++){
nails[i][j+1]+=nails[i][j];
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=i;j++){
nails[i+1][j]+=nails[i][j];
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=i;j++){
nails[i+1][j+1]+=nails[i][j];
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=i;j++){
if(nails[i][j]>0)
ans++;
}
}
printf("%d\n",ans);
return 0;
} |
#include <iostream>
#include <fstream>
#include <stdio.h>
#include <math.h>
#include <time.h>
#include <string>
#include <tuple>
#include <vector>
#include <map>
#include <unordered_map>
#include <list>
#include <set>
#include <stack>
#include <queue>
#include <cstdlib>
#include <algorithm>
#include <random>
#include <cassert>
using namespace std;
#define LL long long
#define MP(a, b) make_pair(a, b)
#define MMP(a, b, c) make_pair(make_pair(a, b), c)
#define MAX 1000000000
#undef INT_MIN
#undef INT_MAX
#define INT_MIN -2147483647
#define INT_MAX 2147483647
#define LL_MIN (LL)-9223372036854775807
#define LL_MAX (LL)9223372036854775807
#define PI 3.14159265359
int imosA[5002][5002] = {};
int imosB[5002][5002] = {};
int imos[5002][5002] = {};
int main(){
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
for(int i=0; i<M; i++){
int a,b,x;
cin >> a >> b >> x;
a--; b--;
imosA[a][b]++;
imosA[a+x+1][b]--;
imosB[a][b+1]--;
imosB[a+x+1][b+x+2]++;
}
for(int i=0; i<N+1; i++){
int now = 0;
for(int j=0; j<N-i+1; j++){
now += imosA[i+j][i];
imos[i+j][i] += now;
}
}
for(int i=0; i<N+1; i++){
int now = 0;
for(int j=0; j<N-i+1; j++){
now += imosB[i+j][j];
imos[i+j][j] += now;
}
}
int ans = 0;
for(int i=0; i<N; i++){
int now = 0;
for(int j=0; j<i+1; j++){
now += imos[i][j];
if(now > 0) ans++;
}
}
cout << ans << endl;
/*cout << endl;
for(int i=0; i<N; i++){
for(int j=0; j<i+1; j++){
cout << imos[i][j] << " ";
}
cout << endl;
}*/
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<vector<int> >A(5009);
int main(){
int sum=0,n,m,a,b,c;
for(int i=0;i<5009;i++){
A[i].assign(i+7,0);
}
cin>>n>>m;
while(m--){
cin>>a>>b>>c;
A[a][b]++;
A[a][b+1]--;
A[a+c+1][b]--;
A[a+c+1][b+c+2]++;
A[a+c+2][b+1]++;
A[a+c+2][b+c+2]--;
}
for(int i=0;i<=n+3;i++){
for(int j=0;j<i+2;j++){
if(j) A[i][j]+=A[i][j-1];
}
}
for(int i=0;i<=n+3;i++){
for(int j=0;j<=i+3;j++){
if(i) A[i][j]+=A[i-1][j];
}
}
for(int i=0;i<=n+3;i++){
for(int j=0;j<=i+3;j++){
if(i&&j) A[i][j]+=A[i-1][j-1];
}
}
for(int i=0;i<=n+3;i++){
for(int j=0;j<=i+5;j++){
if(A[i][j]>0) sum++;
}
}
cout<<sum<<endl;
}
|
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n, m;
vector<int> nail[5000];
scanf("%d%d", &n, &m);
for(int i = 0; i < n; ++i)
nail[i].resize(i + 1);
for(int i = 0; i < m; ++i) {
int a, b, x;
scanf("%d%d%d", &a, &b, &x);
a -= 1, b -= 1;
nail[a][b] = x + 1;
}
int ans = 0;
for(int a = 0; a < n; ++a) {
for(int b = 0; b <= a; ++b) {
int l = a > 0 && b > 0 && (b - 1) <= (a - 1) ? nail[a - 1][b - 1] : 1;
int r = a > 0 && (b) <= (a - 1) ? nail[a - 1][b] : 1;
nail[a][b] = max(nail[a][b], max(l - 1, r - 1));
if(nail[a][b] > 0)
ans += 1;
}
}
printf("%d\n", ans);
return 0;
} |
#include <stdio.h>
#define calc(x,y) ((((x)*((x)+1))/2)+(y))
#define safe_calc(x, y) ((((x)+2)*((x)+3)/2)+(y)+1)
int n;
int sum;
int nails[13000000];
void process() {
int i;
for (i=1;i<n+3;i++) {
int j;
for (j=1;j<=i;j++) {
nails[calc(i,j)] += nails[calc(i,j)-1];
}
}
for (i=0;i<n+3;i++) {
int j;
for (j=1;j<(n+3-i);j++) {
nails[calc(i+j,i)] += nails[calc(i+j-1,i)];
}
}
for (i=0;i<n+3;i++) {
int j;
for (j=1;j<(n+3-i);j++) {
nails[calc(i+j,j)] += nails[calc(i+j-1,j-1)];
}
}
for (i=0;i<n+3;i++) {
int j;
for (j=0;j<=i;j++) {
if (nails[calc(i,j)] > 0) sum++;
}
}
}
int main() {
int i;
int m;
scanf("%d %d", &n, &m);
for (i=0;i<m;i++) {
int a, b, x;
scanf("%d %d %d", &a, &b, &x);
a--;
b--;
x++;
nails[safe_calc(a,b)]++;
nails[safe_calc(a,b)+1]--;
nails[safe_calc(a+x,b)]--;
nails[safe_calc(a+x,b+x)+1]++;
nails[safe_calc(a+x+1,b+1)]++;
nails[safe_calc(a+x+1,b+x+1)]--;
}
process();
printf("%d\n", sum);
} |
#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
using namespace std;
#define INF 100000000
typedef long long ll;
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
const int MAXN = 5200;
vector<int> table[MAXN];
int main(void) {
int N, M;
cin >> N >> M;
for (int i = 0; i < MAXN; i++) {
table[i].resize(i+20);
}
while (M--) {
int a, b, x;
cin >> a >> b >> x;
table[a][b]++;
table[a][b+1]--;
table[a+x+1][b]--;
table[a+x+2][b+1]++;
table[a+x+1][b+x+2]++;
table[a+x+2][b+x+2]--;
}
// 左から右
for (int i = 0; i < MAXN-100; i++) {
for (int j = 1; j < i+10; j++) {
table[i][j] += table[i][j-1];
}
}
// 右上から左下
for (int i = 1; i < MAXN-100; i++) {
for (int j = 0; j < i+10; j++) {
table[i][j] += table[i-1][j];
}
}
// 左上から右下
for (int i = 1; i < MAXN-100; i++) {
for (int j = 1; j < i+10; j++) {
table[i][j] += table[i-1][j-1];
}
}
int ans = 0;
for (int i = 0; i < MAXN; i++) {
for (int j = 0; j < i+10; j++) {
if (table[i][j] > 0) ans++;
}
}
cout << ans << endl;
// for (int i = 0; i < 10; i++) {
// for (int j = 0; j < 10; j++) {
// cout << table[i][j] << "\t";
// }
// cout << endl;
// }
return 0;
} |
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <complex>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define EQ(a,b) (abs((a)-(b))<EPS)
int bo[12560000];
int cal(int s)
{
return s*(s+1)/2+1;
}
int main()
{
int n,m;
cin >> n >> m;
for(int i=0;i<m;i++)
{
int a,b,x;
cin >> a >> b >> x;
bo[cal(a)+b]=x+1;
}
int ans=0;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=i;j++)
{
bo[cal(i)+j]=max(max(bo[cal(i)+j],bo[cal(i-1)+j]-1),bo[cal(i-1)+j-1]-1);
if(bo[cal(i)+j])ans++;
}
}
cout << ans << endl;
return 0;
} |
#include <cstdio>
#include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
n += 3;
vector<vector<int> > s(n);
for(int i=0; i<n; ++i)
s[i].assign(i+2, 0);
for(int i=0; i<m; ++i){
int y, x, a;
cin >> y >> x >> a;
++ s[y][x];
-- s[y][x+1];
-- s[y+a+1][x];
++ s[y+a+2][x+1];
++ s[y+a+1][x+a+2];
-- s[y+a+2][x+a+2];
}
for(int i=0; i<n-1; ++i){
for(int j=0; j<i+2; ++j){
s[i+1][j] += s[i][j];
}
}
for(int i=0; i<n; ++i){
for(int j=0; j<i+1; ++j){
s[i][j+1] += s[i][j];
}
}
for(int i=-n; i<2; ++i){
for(int j=0; j<n-1; ++j){
if(i+j >= 0)
s[j+1][i+j+1] += s[j][i+j];
}
}
int ret = 0;
for(int i=0; i<n; ++i){
for(int j=0; j<i+2; ++j){
if(s[i][j] > 0)
++ ret;
}
}
cout << ret << endl;
return 0;
} |
#include <iostream>
#include <algorithm>
using namespace std;
#define loop(i,a,b) for(int i=(a); i<int(b); i++)
#define rep(i,b) loop(i,0,b)
short dp[5010][5010] = {};
int main(){
int n, m; cin >> n >> m;
rep(i, m){
int x, y, c; cin >> x >> y >> c;
x--, y--, c++;
dp[x][y] = c;
}
int ans = 0;
if (dp[0][0]) ans++;
loop(i, 1, n)rep(j, i + 1){
int t = -100;
if (j - 1 >= 0) t = max(t, dp[i - 1][j - 1] - 1);
if (j < i + 1) t = max(t, dp[i - 1][j] - 1);
dp[i][j] = max<short>(dp[i][j], t);
if (dp[i][j]) ans++;
}
cout << ans << endl;
} |
#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
using namespace std;
#define FOR(i,k,n) for(int i=(k); i<(int)(n); ++i)
#define REP(i,n) FOR(i,0,n)
#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
template<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cerr<<*i<<" "; cerr<<endl; }
inline bool valid(int x, int y, int W, int H){ return (x >= 0 && y >= 0 && x < W && y < H); }
typedef long long ll;
const int INF = 100000000;
const double EPS = 1e-8;
const int MOD = 1000000007;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
inline int f(int y, int x){
return 2 * y + y * (y + 1) / 2 + x;
}
int table[18000000];
int main(){
int N, M;
while(cin >> N >> M && N){
REP(i, M){
int Y, X, L;
scanf("%d %d %d", &Y, &X, &L);
Y--; X--;
table[f(Y, X)]++;
table[f(Y, X + 1)]--;
table[f(Y + L + 1, X)]--;
table[f(Y + L + 1, X + L + 2)]++;
table[f(Y + L + 2, X + 1)]++;
table[f(Y + L + 2, X + L + 2)]--;
}
for(int y = 0; y < N + 2; y++){
for(int x = 1; x <= y + 2; x++){
table[f(y, x)] += table[f(y, x - 1)];
}
}
for(int y = 1; y < N + 2; y++){
for(int x = 0; x <= y + 1; x++){
table[f(y, x)] += table[f(y - 1, x)];
}
}
for(int y = 1; y < N + 2; y++){
for(int x = 1; x <= y + 2; x++){
table[f(y, x)] += table[f(y - 1, x - 1)];
}
}
int ans = 0;
for(int y = 0; y < N; y++){
for(int x = 0; x <= y; x++){
if(table[f(y, x)] > 0) ans++;
}
}
cout << ans << endl;
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
using Int = long long;
//INSERT ABOVE HERE
const Int MAX = 5050;
Int dp[MAX][MAX];
signed main(){
Int n,m;
cin>>n>>m;
for(Int i=0;i<m;i++){
Int a,b,x;
cin>>a>>b>>x;
dp[a][b]++;
dp[a][b+1]--;
dp[a+x+1][b]--;
dp[a+x+2][b+1]++;
dp[a+x+1][b+2+x]++;
dp[a+x+2][b+2+x]--;
}
for(Int i=0;i<MAX;i++)
for(Int j=0;j+1<MAX;j++)
dp[i][j+1]+=dp[i][j];
for(Int j=0;j<MAX;j++)
for(Int i=0;i+1<MAX;i++)
dp[i+1][j]+=dp[i][j];
for(Int i=0;i+1<MAX;i++)
for(Int j=0;j+1<MAX;j++)
dp[i+1][j+1]+=dp[i][j];
Int ans=0;
for(Int i=0;i<MAX;i++)
for(Int j=0;j<MAX;j++)
ans+=!!dp[i][j];
cout<<ans<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> mp;
#define inf 1e9
int main(){
int n,m;
cin>>n>>m;
vector<vector<int> > dp(n+2,vector<int>(n+2,0) );
for(int i=0;i<m;i++){
int a,b,c;
cin>>a>>b>>c;
dp[a][b] = max(dp[a][b],c+1) ;
}
int cnt = 0;
for(int i=1;i<=n;i++){
for(int j = 1;j<=i;j++){
if(dp[i][j] != 0){
dp[i+1][j] = max(dp[i+1][j],dp[i][j]-1);
dp[i+1][j+1] = max(dp[i+1][j+1],dp[i][j]-1);
cnt++;
}
}
}
cout<<cnt<<endl;
return 0;
}
|
#include <iostream>
#define L 5005
using namespace std;
int N, M;
int m1[L*(L+1)/2] = {0}, m2[L*(L+1)/2] = {0};
int P(int y, int x) {
++y;
return y*(y+1)/2 + x;
}
void Print() {
for (int y = 0; y < N+1; ++y) {
for (int x = 0; x <= y+1; ++x) {
cout << m1[P(y, x)] << " ";
}
cout << endl;
}
}
int main() {
cin >> N >> M;
for (int i = 0; i < M; ++i) {
int y, x, l; cin >> y >> x >> l; --x, --y, ++l;
++m1[P(y, x)], --m1[P(y+l, x)], --m1[P(y+1, x+1)], ++m1[P(y+l+1, x+1)];
--m1[P(y, x+1)], ++m1[P(y+l, x+l+1)], ++m1[P(y+1, x+1)], --m1[P(y+l+1, x+l+1)];
}
for (int y = 0; y < N; ++y) {
for (int x = 0; x <= y+1; ++x) {
m1[P(y+1, x+1)] += m1[P(y, x)];
}
}
for (int y = 0; y < N; ++y) {
for (int x = 0; x <= y+1; ++x) {
m1[P(y+1, x)] += m1[P(y, x)];
}
}
for (int y = 0; y < N; ++y) {
for (int x = 0; x <= y+1; ++x) {
m1[P(y, x+1)] += m1[P(y, x)];
}
}
int ans = 0;
for (int y = 0; y < N; ++y) {
for (int x = 0; x <= y; ++x) {
if (m1[P(y, x)] > 0) ++ans;
}
}
cout << ans << endl;
} |
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
#include "numeric"
#include "cassert"
#include "functional"
using namespace std;
constexpr long long int MOD = 1000000007;
//const int MOD = 1000000007;
//constexpr int MOD = 998244353;
//constexpr long long int MOD = 998244353;
//const double EPS = 1e-8;
int N, M, K, H, W, L, R;
//long long int N, M, K, H, W, L, R;
int v[5001][5001];
int sum[5001][5002];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> K >> N;
for (int i = 0; i < N; i++) {
cin >> H >> W >> M;
v[H + M][W] = max(v[H + M][W], M + 1);
}
for (int i = 5000; i >= 1; i--) {
for (int j = 4999; j >= i; j--) {
v[j][i] = max(v[j][i], v[j + 1][i] - 1);
}
}
for (int i = 1; i <= 5000; i++) {
for (int j = 1; j <= i; j++) {
sum[i][j]++;
sum[i][j + v[i][j]]--;
}
}
for (int i = 1; i <= 5000; i++) {
for (int j = 2; j <= i; j++)sum[i][j] += sum[i][j - 1];
}
int ans = 0;
for (int i = 1; i <= 5000; i++) {
for (int j = 1; j <= i; j++)ans += !!sum[i][j];
}
cout << ans << endl;
}
|
#include<iostream>
#include<string>
#include<algorithm>
#include<math.h>
#include<queue>
#include<set>
#include<map>
#include<random>
#include<functional>
#include<utility>
typedef long long ll;
#define rep(i,n) for(int i=0; i<n; i++)
#define pb push_back
#define P pair<int, int>
#define PLI pair<ll, int>
#define PLL pair<ll, ll>
#define VI vector<int>
#define VII vector<VI>
using namespace std;
int N, M;
int dp[5005][5005] = {};
int main() {
cin >> N >> M;
rep(i, M) {
int a, b, x;
cin >> a >> b >> x;
dp[a][b] = x+1;
}
for (int i = 2; i <= N; i++) {
for (int j = 1; j <= i; j++) {
dp[i][j] = max({dp[i][j], dp[i-1][j-1]-1, dp[i-1][j]-1});
}
}
int cnt = 0;
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= i; j++) {
if (dp[i][j]) cnt++;
}
}
cout << cnt << endl;
return 0;
}
|
//39
#include<iostream>
#include<algorithm>
#include<cstdlib>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
short (*g)[5001]=(short(*)[5001])malloc(sizeof(short)*5001*5001);
fill(g[0],g[5000],-1);
while(m--){
int a,b,x;
cin>>a>>b>>x;
g[a-1][b-1]=x;
}
int a=0;
for(int i=0;i<n;i++){
for(int j=0;j<=i;j++){
a+=g[i][j]>=0;
g[i+1][j]=max<short>(g[i+1][j],g[i][j]-1);
g[i+1][j+1]=max<short>(g[i+1][j+1],g[i][j]-1);
}
}
cout<<a<<endl;
return 0;
} |
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
int N,M;
vector<int>G[5100];
int main(){
for(int i=0;i<5100;i++) G[i].resize(i+10, 0);
scanf("%d%d",&N,&M);
for(int i=0;i<M;i++){
int a,b,x;scanf("%d%d%d", &a,&b,&x);
G[a][b]++; G[a][b+1]--;
G[a+x+1][b]--; G[a+x+1][b+x+2]++;
G[a+x+2][b+1]++; G[a+x+2][b+x+2]--;
}
for(int i=0;i<=N+5;i++) for(int j=0;j<=i;j++) G[i][j+1] += G[i][j];
for(int i=0;i<=N+5;i++) for(int j=i;j<=N+5;j++) G[j+1][i] += G[j][i];
for(int i=0;i<=N+5;i++) for(int j=0;j<=i;j++) G[i+1][j+1] += G[i][j];
int res = 0;
for(int i=0;i<=N+5;i++) for(int j=0;j<=i;j++) if(G[i][j]) res++;
printf("%d\n", res);
return 0;
} |
#include <cstdio>
#include <algorithm>
using namespace std;
short ita[5005][5005]={};
int n;
int m;
int main()
{
scanf("%d %d",&n,&m);
for(int i=0;i<m;i++)
{
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
ita[a][b]=max((int)ita[a][b],c+1);
}
int ans=0;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
ita[i][j]=max(ita[i][j],(short)max(ita[i-1][j-1]-1,ita[i-1][j]-1));
if(ita[i][j]) ans++;
}
}
printf("%d\n",ans);
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
using namespace std;
int N, M;
int dp[5010][5010];
int main() {
cin >> N >> M;
for (int i=0; i<M; i++) {
int a, b, x;
cin >> a >> b >> x;
dp[a-1][b-1] = max(dp[a-1][b-1], x + 1);
}
for (int i=0; i<N; i++) {
for (int j=0; j<=i; j++) {
dp[i+1][j] = max(dp[i+1][j], dp[i][j] - 1);
dp[i+1][j+1] = max(dp[i+1][j+1], dp[i][j] - 1);
}
}
int ans = 0;
for (int i=0; i<N; i++) {
for (int j=0; j<=i; j++) {
ans += dp[i][j] != 0;
}
}
cout << ans << "\n";
return 0;
} |
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int n,m;
vector<int> f[5005];
int main(void){
cin >> n >> m;
for(int i = 0; i <= n+5; i++){
f[i].resize(i+5,0);
}
for(int i = 0; i < m; i++){
int a,b,x;
cin >> a >> b >> x;
f[a][b]++;
f[a][b+1]--;
f[a+x+1][b]--;
f[a+x+2][b+1]++;
f[a+x+1][b+x+2]++;
f[a+x+2][b+x+2]--;
}
for(int i = 1; i <= n; i++){
for(int j = i; j <= n; j++){
f[j][i] += f[j-1][i];
}
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= i; j++){
f[i][j] += f[i][j-1];
}
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= i; j++){
f[i][j] += f[i-1][j-1];
}
}
int res = 0;
for(int i =1; i <= n; i++){
for(int j = 1; j <= i; j++){
if(f[i][j]>0) res++;
}
}
cout << res << endl;
} |
#include<iostream>
#include<cstdio>
using namespace std;
int n,m,ans=0;
int tri[5001][5001];
int main(void){
scanf("%d%d",&n,&m);
for(int i=0;i<m;i++){
int x,y,size;
scanf("%d%d%d",&y,&x,&size);
tri[x][y]=size+1;
}
for(int i=1;i<=n;i++){
for(int j=1;j<=i;j++){
tri[j][i]=max(tri[j][i],max(tri[j-1][i-1],tri[j][i-1])-1);
if(tri[j][i]>0)ans++;
}
}
printf("%d\n",ans);
return 0;
} |
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<algorithm>
using namespace std;
int main(void){
vector<pair<int,int> >a[5000];
int b[5010];
int d[5010];
for (int i = 0; i < 5010; i++){
b[i] = 0;
d[i] = 0;
}
int c;
int n, m;
int x, y, z;
c = 0;
scanf("%d %d", &n, &m);
for (int i = 0; i < m; i++){
scanf("%d %d %d", &x, &y, &z);
a[x-1].push_back(make_pair(y-1, z+1));
}
for (int i = 0; i < n; i++){
for (int j = 0; j < i+1; j++){
if (b[j] > 0){
if (d[j] < b[j] - 1)d[j] = b[j] - 1;
d[j + 1] = b[j] - 1;
}
}
for (int j = 0; j < a[i].size(); j++){
if (d[a[i][j].first] < a[i][j].second){
d[a[i][j].first] = a[i][j].second;
}
}
for (int j = 0; j < i+1; j++){
b[j] = d[j];
if (b[j] > 0){
c++;
}
d[j] = 0;
}
}
printf("%d\n", c);
return 0;
} |
#include <iostream>
#include <vector>
using namespace std;
vector<vector<int>> nails;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
nails.resize(n + 2);
for(int i = 0; i < n + 2; ++i)
nails[i].assign(i + 2, 0);
for(int i = 0; i < m; ++i){
int a, b, x;
cin >> a >> b >> x;
--a, --b;
nails[a][b]++;
nails[a][b + 1]--;
nails[a + x + 1][b]--;
nails[a + x + 2][b + 1]++;
nails[a + x + 1][b + x + 2]++;
nails[a + x + 2][b + x + 2]--;
}
for(int i = 0; i < n; ++i){
for(int j = 0; j <= i; ++j){
nails[i][j + 1] += nails[i][j];
}
}
for(int i = 0; i < n; ++i){
for(int j = 0; j <= i; ++j){
nails[i + 1][j] += nails[i][j];
}
}
for(int i = 0; i < n; ++i){
for(int j = 0; j <= i; ++j){
nails[i + 1][j + 1] += nails[i][j];
}
}
int ans = 0;
for(int i = 0; i < n; ++i){
for(int j = 0; j <= i; ++j){
if(nails[i][j] > 0)
ans++;
}
}
cout << ans << endl;
return 0;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.