test/yuki2577.test.cpp

View this file on GitHub
Last update: 2023-04-05 23:10:22+09:00
Problem: https://yukicoder.me/problems/2577

Depends on

Code

#define PROBLEM "https://yukicoder.me/problems/2577"

#include "../template.hpp"

#include "../DataStructure/RectangleUnion.hpp"

signed main(){
    int n;cin>>n;
    RectangleUnion<ll> ur,ul,dr,dl;
    ll pre=0;
    while(n--){
        ll xp,yp,xm,ym;cin>>xm>>ym>>xp>>yp;
        ur.add(xp,yp);
        ul.add(-xm,yp);
        dr.add(xp,-ym);
        dl.add(-xm,-ym);
        ll sum=ur.S+ul.S+dr.S+dl.S;
        cout<<sum-pre<<endl;
        pre=sum;
    }
    return 0;
}

#line 1 "test/yuki2577.test.cpp"
#define PROBLEM "https://yukicoder.me/problems/2577"

#line 1 "template.hpp"
#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;
 
template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}

#line 4 "test/yuki2577.test.cpp"

#line 1 "DataStructure/RectangleUnion.hpp"
template<typename T>
struct RectangleUnion{
    private:
    map<T,T> mp;

    public:
    T S;
    
    RectangleUnion():S(0){
        const T inf=numeric_limits<T>::max()/2;
        mp[0]=inf;
        mp[inf]=0;
    }

    void add(T x,T y){
        auto ite=mp.lower_bound(x);
        if(ite->second>=y) return ;
        T lw=ite->second;
        S+=(y-lw)*x;
        ite=prev(ite);
        while(ite->second<=y){
            S-=ite->first*(ite->second-lw);
            lw=ite->second;
            ite=prev(mp.erase(ite));
        }
        S-=(ite->first)*(y-lw);
        mp[x]=y;
    }
};
#line 6 "test/yuki2577.test.cpp"

signed main(){
    int n;cin>>n;
    RectangleUnion<ll> ur,ul,dr,dl;
    ll pre=0;
    while(n--){
        ll xp,yp,xm,ym;cin>>xm>>ym>>xp>>yp;
        ur.add(xp,yp);
        ul.add(-xm,yp);
        dr.add(xp,-ym);
        dl.add(-xm,-ym);
        ll sum=ur.S+ul.S+dr.S+dl.S;
        cout<<sum-pre<<endl;
        pre=sum;
    }
    return 0;
}