Submission #26319477

---

Source Code Expand

#include <bits/stdc++.h>
#define ll long long 
#define ft first
#define sec second
#define pb push_back
#define pf push_front
#define pr pair<ll,ll>
#define bged(a) a.begin(),a.end()
#define ISCC ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//#pragma optimize("Ofast","unroll-loop")
using namespace std;
const int MOD = 1e9+7; 
ll t ,n ,m ,d[400005] ,ans[200005] ,mx;
pr a[200005];
vector<ll> vec;
int num(int x){return lower_bound(bged(vec) ,x)-vec.begin()+1;}
int main()
{ 		
	cin >> n;
	for(int i=1 ,x, y ;i<=n ;i++)
	{
		cin >> x >> y;
		vec.pb(x) ,vec.pb(x+y);
		a[i].ft = x;  a[i].sec = x+y;
	} 	
	sort(bged(vec));
	vec.erase(unique(bged(vec)) ,vec.end());
	for(int i=1 ;i<=n ;i++)
	{
		d[num(a[i].ft)]++;  
		d[num(a[i].sec)]--;
	}
	int k = vec.size();
	for(int i=1 ;i<=k ;i++)
	{
		d[i] += d[i-1];		
		ans[d[i]] += vec[i]-vec[i-1];
	} 
	for(int i=1 ;i<=n ;i++) cout << ans[i] << ' ';
	return 0; 
}

Submission Info

Judge Result