Submission #1370858

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back((a))
#define all(x) (x).begin(),(x).end()
#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))
#define fi first
#define se second
#define dbg(...) _dbg(#__VA_ARGS__",", __VA_ARGS__)
void _dbg(string){cout<<endl;}
template<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<" = "<<h<<", ";_dbg(s.substr(l+1),t...);}
template<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<"("<<p.fi<<","<<p.se<<")";return o;}
template<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<"[";for(T t:v){o<<t<<",";}o<<"]";return o;}

#define INF 1120000000

long vec[2600][2600];

inline void tri(int x, int y, int d, int v){
  x += 1010; y += 1010;
  vec[x][y] += v;
  vec[x+1][y-1] -= v;
  vec[x][y+d] -= v;
  vec[x+1][y+d] += v;
  vec[x+d+1][y] -= v;
  vec[x+d+1][y-1] += v;
}

inline void hex(int x, int y, int d, int v){
  tri(x-d+1, y-d+1, 3*d-2, v);
  tri(x-d+1, y-d+1, d-1, -v);
  tri(x-d+1, y+d, d-1, -v);
  tri(x+d, y-d+1, d-1, -v);
}

int main(){
  fill(vec[0], vec[2600], 0);
  int n;
  cin>>n;
  rep(i,n){
    int t,x,y,s;
    cin>>t>>x>>y>>s;
    if(t==1){
      hex(x,y,s,1);
    } else if(t==2){
      rep(j,s){
        hex(x,y,j+1,1);
      }
    } else if(t==3){
      rep(j,s){
        hex(x,y,s-j,2*j+1);
      }
    } else assert(false);
  }

  // imos
  for(int i=1; i<2600; i++){
    for(int j=2598; j>=0; j--)
      vec[i][j] += vec[i-1][j+1];
  }
  for(int i=1; i<2600; i++){
    for(int j=0; j<2600; j++)
      vec[i][j] += vec[i-1][j];
  }
  for(int i=0; i<2600; i++){
    for(int j=1; j<2600; j++)
      vec[i][j] += vec[i][j-1];
  }

  // for(int i=1000; i<=1020; i++){
  //   for(int j=1000; j<=1020; j++) cout<<vec[i][j]<<" ";
  //   cout << endl;
  // }

  long ans = 0;
  rep(i,2600)rep(j,2600) ans = max(ans, vec[i][j]);

  cout << ans << endl;

  return 0;
}

Submission Info

Judge Result