verify/AOJ-DSL_5_B.test.cpp

View this file on GitHub
Last update: 2023-07-29 15:01:05+09:00
Problem: https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_5_B

Depends on

Code

#define PROBLEM "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_5_B"

#include "../template.hpp"
#include "../data-structure/cumulative-sum-2d.hpp"

int main() {
  int n = input();
  CumulativeSum2D<ll> cum(1001);
  REP(i, n) {
    int a, b, c, d;
    cin >> a >> b >> c >> d;
    cum.imos(a, b, c, d, 1);
  }
  ll ans = 0;
  REP(i, 1001) REP(j, 1001) chmax(ans, cum.get(i, j));
  cout << ans << endl;
}

#line 1 "verify/AOJ-DSL_5_B.test.cpp"
#define PROBLEM "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_5_B"

#line 1 "template.hpp"
#include<bits/stdc++.h>
using ll = long long;
#define REP(i, n) for(ll i = 0; (i) < ll(n); ++ (i))
#define FOR(i, m, n) for(ll i = (m); (i) <= ll(n); ++ (i))
#define REPR(i, n) for(ll i = ll(n) - 1; (i) >= 0; -- (i))
#define FORR(i, m, n) for(ll i = ll(n); (i) >= ll(m); -- (i))
#define ALL(x) x.begin(),x.end()

#define INF (int)1e9
#define LLINF (long long)1e18
#define MOD (int)(1e9+7)
#define MOD9 (int)998244353
#define PI 3.141592653589
#define PB push_back
#define F first
#define S second

#define YESNO(T) if(T){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define yesno(T) if(T){cout<<"yes"<<endl;}else{cout<<"no"<<endl;}
#define YesNo(T) if(T){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}
#define Yes(T) {cout<<"Yes"<<endl; if(T) return 0;}
#define No(T) {cout <<"No"<<endl; if(T) return 0;}
#define YES(T) {cout<<"YES"<<endl; if(T) return 0;}
#define NO(T) {cout <<"NO"<<endl; if(T) return 0;}

#define Graph vector<vector<int> >
#define CostGraph vector<vector<pair<int,ll> > >
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define VI vector<int>
#define VL vector<ll>
#define VVI vector<vector<int> >
#define VVL vector<vector<ll> >
#define VPII vector<pair<int,int> >
#define VPLL vector<pair<ll,ll> >

#define DDD fixed<<setprecision(10)
#define PAD setfill('0')<<right<<setw(8)

template <class T>
inline bool chmin(T &a, T b) {
  if(a > b){ a = b; return true;}
  return false;
}
template <class T>
inline bool chmax(T &a, T b) {
  if(a < b){a = b; return true;}
  return false;
}
struct input{
  int n;
  input() {}
  input(int n_) : n(n_){};
  template <class T>
  operator T(){
    T ret;
    std::cin >> ret;
    return ret;
  }
  template <class T>
  operator std::vector<T>() {
    std::vector<T> ret(n);
    REP(i,n) std::cin >> ret[i];
    return ret;
  }
};
template <class T>
inline void printVec(std::vector<T> v){
  REP(i,v.size()){
    if(i) std::cout << " ";
    std::cout << v[i];
  } std::cout << std::endl;
}

using namespace std;
#line 1 "data-structure/cumulative-sum-2d.hpp"
template<class T>
struct CumulativeSum2D{
  vector<vector<T>> data;
  vector<vector<T>> sum;
  bool flgBuild;

  CumulativeSum2D(){
    flgBuild = false;
  }

  CumulativeSum2D(int n): data(n, vector<T>(n, 0)), sum(n+1, vector<T>(n+1, 0)){
    flgBuild = false;
  }

  CumulativeSum2D(int h, int w): data(h, vector<T>(w, 0)), sum(h+1, vector<T>(w+1, 0)){
    flgBuild = false;
  }

  CumulativeSum2D(vector<vector<T>> &v): data(v), sum(v.size()+1, vector<T>(v[0].size()+1, 0)){
    flgBuild = false;
    build();
  }

  void update(int i, int j, T value){
    flgBuild = false;
    data[i][j] = value;
  }

  void update(pair<int,int> p, T value){
    update(p.first, p.second, value);
  }

  void add(int i, int j, T value){
    flgBuild = false;
    data[i][j] += value;
  }

  void add(pair<int,int> p, T value){
    add(p.first, p.second, value);
  }

  void imos(int x1, int y1, int x2, int y2, T value){
    add(x1, y1, value);
    add(x1, y2, -value);
    add(x2, y1, -value);
    add(x2, y2, value);
  }

  void imos(pair<int,int> p1, pair<int,int> p2, T value){
    imos(p1.first, p1.second, p2.first, p2.second, value);
  }

  void build(){
    if(flgBuild) return;
    for(int i = 0; i < data.size(); ++i){
        for(int j = 0; j < data[i].size(); ++j){
            sum[i+1][j+1] = sum[i+1][j] + sum[i][j+1] - sum[i][j] + data[i][j];
        }
    }
    flgBuild = true;
  }

  T get(int x1, int y1, int x2, int y2){
    if(!flgBuild) build();
    return sum[x2][y2] - sum[x1][y2] - sum[x2][y1] + sum[x1][y1];
  }

  T get(pair<int,int> l, pair<int,int> r){
    return get(l.first, l.second, r.first, r.second);
  }

  T get(int i, int j){
    if(!flgBuild) build();
    return sum[i][j];
  }
  
  T get(pair<int,int> p){
    return get(p.first, p.second);
  }
};
#line 5 "verify/AOJ-DSL_5_B.test.cpp"

int main() {
  int n = input();
  CumulativeSum2D<ll> cum(1001);
  REP(i, n) {
    int a, b, c, d;
    cin >> a >> b >> c >> d;
    cum.imos(a, b, c, d, 1);
  }
  ll ans = 0;
  REP(i, 1001) REP(j, 1001) chmax(ans, cum.get(i, j));
  cout << ans << endl;
}