abc211 D题

题目

题意: 给定n次操作(2e5),使得区间[l,l+r-1]每个点的值+1。输出值为1-n的点的个数。(l和r为1e9)

**思路:**显然，需要离散化。而且是对区间+1,可用差分。可用vector存操作的点以及是+1还是-1.排序后扫一遍，每个操作的贡献是下一个点-这个点，中间点的个数。

代码:

// Problem: D - Online games
// Contest: AtCoder - AtCoder Beginner Contest 221
// URL: https://atcoder.jp/contests/abc221/tasks/abc221_d
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// 
// Powered by CP Editor (https://cpeditor.org)
 
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<complex>
#include<cstring>
#include<cmath>
#include<vector>
#include<map>
#include<unordered_map>
#include<list>
#include<set>
#include<queue>
#include<stack>
#define OldTomato ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr)
#define fir(i,a,b) for(int i=a;i<=b;++i) 
#define mem(a,x) memset(a,x,sizeof(a))
#define p_ priority_queue
// round() 四舍五入 ceil() 向上取整 floor() 向下取整
// lower_bound(a.begin(),a.end(),tmp,greater<ll>()) 第一个小于等于的
// #define int long long //QAQ
using namespace std;
typedef complex<double> CP;
typedef pair<int,int> PII;
typedef long long ll;
// typedef __int128 it;
const double pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
const ll inf = 1e18;
const int N = 2e5+10;
const int M = 1e6+10;
const int mod = 1e9+7;
const double eps = 1e-6;
inline int lowbit(int x){ return x&(-x);}
template<typename T>void write(T x)
{
    if(x<0)
    {
        putchar('-');
        x=-x;
    }
    if(x>9)
    {
        write(x/10);
    }
    putchar(x%10+'0');
}
template<typename T> void read(T &x)
{
    x = 0;char ch = getchar();ll f = 1;
    while(!isdigit(ch)){if(ch == '-')f*=-1;ch=getchar();}
    while(isdigit(ch)){x = x*10+ch-48;ch=getchar();}x*=f;
}
int n,m,k,T;
vector<PII> va;
int now = 0;
int cnt[N];
void solve()
{
   read(n);
   for(int i=0;i<n;++i)
   {
   	  int x,y; read(x),read(y);
   	  va.push_back({x,1});
   	  va.push_back({x+y,-1});
   }
   sort(va.begin(),va.end());
   for(int i=0;i<va.size()-1;++i)
   {
   	  auto tmp = va[i];
   	  int l = tmp.first,r = tmp.second;
   	  now += r;
   	  cnt[now] += (va[i+1].first - l); 
   	  // cout<<l<<' '<<r<<endl;
   }
   for(int i=1;i<=n;++i)
   {
   	 printf("%d%c",cnt[i],i==n?'\n':' ');
   }
}
signed main(void)
{  
   T = 1;
   // OldTomato; cin>>T;
   // read(T);
   while(T--)
   {
   	 solve();
   }
   return 0;
}