提出 #9754931

---

ソースコード 拡げる

/*
 _     _                             
| |__ | |__   __ _  __ _ _   _  __ _ 
| '_ \| '_ \ / _` |/ _` | | | |/ _` |
| |_) | | | | (_| | (_| | |_| | (_| |
|_.__/|_| |_|\__,_|\__, |\__, |\__,_|
                   |___/ |___/       
*/
#include<bits/stdc++.h>

#define ll          long long
#define pb          push_back
#define ppb         pop_back
#define	endl		'\n'
#define mii         map<ll int,ll int>
#define pii         pair<ll int,ll int>
#define vi          vector<ll int>
#define all(a)      (a).begin(),(a).end()
#define F           first
#define S           second
#define sz(x)       (ll int)x.size()
#define hell        1000000007
#define lbnd        lower_bound
#define ubnd        upper_bound
#define bs          binary_search
#define mp          make_pair
#define what_is(x)  cerr << #x << " is " << x << endl;
using namespace std;

#define N  100005

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int TESTS=1;
	// cin>>TESTS;
	while(TESTS--)
	{
		ll int n,d,a;
		cin>>n>>d>>a;
		vector<pii> v(n);
		for(ll int i=0;i<n;i++)
		{
			cin>>v[i].F>>v[i].S;
			v[i].S=(v[i].S+a-1)/a;
		}
		sort(all(v));
		int pre[n+1],sm=0;
		memset(pre,0,sizeof(pre));
		ll int ans=0;
		for(int i=n-1;i>=0;i--)
		{
			pii p={v[i].F-2*d,-hell};
			ll int lidx=lower_bound(all(v),p)-v.begin();
			ll int left=v[i].S+sm;
			if(left>0)
			{
				ans+=left;
				pre[lidx]+=left;
				sm-=left;
			}
			sm+=pre[i];
		}
		cout<<ans<<endl;
	}
	return 0;
}

提出情報

ジャッジ結果