Submission #1730831

---

Source Code Expand

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define mp make_pair
typedef long long ll;
typedef pair<ll,int> ii;
typedef tree<ii, null_type, less<ii>, rb_tree_tag, tree_order_statistics_node_update> pbds;
pbds pos,neg;
int timer;
ll len[100011];
ll shiftpos,shiftneg;
void addpos(ll x){pos.insert(mp(x-shiftpos,timer++));}
void addneg(ll x){neg.insert(mp(x-shiftneg,timer++));}
int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	int n; cin>>n;
	ll m=0; ll c=0;
	for(int i=0;i<n;i++)
	{
		ll l,r; cin>>l>>r;
		len[i]=r-l;
		if(i>0){shiftpos+=len[i-1];	c-=len[i-1]*m;}
		shiftneg-=len[i];addpos(l); addpos(l);
		auto it=pos.begin();
		ll res=it->fi+shiftpos;
		pos.erase(pos.begin()); addneg(res);
		ll neglas=prev(neg.end())->fi+shiftneg;
		ll posles=pos.begin()->fi+shiftpos;
		if(!neg.empty()&&neglas>posles)
		{
			neg.erase(prev(neg.end())); pos.erase(pos.begin());
			addpos(neglas); addneg(posles);
		}
		m++; c-=l;
	}
	while(m>0)
	{
		c+=(*prev(pos.end())).fi+shiftpos; m--; pos.erase(prev(pos.end()));
	}
	cout<<c<<'\n';
}

Submission Info

Judge Result