Submission #3042509

---

Source Code Expand

#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <deque>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <ctime>
#include <iterator>
#include <bitset>
#include <numeric>
#include <list>
#include <iomanip>
using namespace std;


typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
	v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
	stringstream ss;
	ss << f;
	ss >> t;
}


#define REP(i,n) for(int i=0;i<int(n);++i)
#define ALL(v) (v).begin(),(v).end()
#define RALL(v) (v).rbegin(),(v).rend()
#define PB push


#define MOD 1000000009LL
#define EPS 1e-8

int N;
LL H[ 100010 ];
LL S[ 100010 ];
LL finalH[ 100010 ];
int deadlines[ 100010 ];

bool check( LL h )
{
	REP( i, N ) deadlines[ i ] = 0;

	//printf( "check %lld\n", h );

	REP( i, N )
	{
		if( H[ i ] > h )
		{
			return false;
		}

		LL deadline = ( h - H[ i ] ) / S[ i ];

		if( deadline > N - 1 )
		{
			deadline = N - 1;
		}

		//printf( "H = %lld S = %lld -> %lld\n", H[ i ], S[ i ], deadline );

		++deadlines[ deadline ];
	}

	int cursor = 0;
	REP( i, N )
	{
		if( deadlines[ i ] > 0 )
		{
			int capacity = i - cursor + 1;
			//printf( "i = %d deadlines[ i ] = %d capacity = %d cursor = %d\n", i, deadlines[ i ], capacity, cursor );
			if( deadlines[ i ] <= capacity )
			{
				cursor += deadlines[ i ];
			}
			else
			{
				return false;
			}
		}
	}
	return true;
}

int main()
{
	cin >> N;
	REP( i, N )
	{
		cin >> H[ i ] >> S[ i ];
		finalH[ i ] = H[ i ] + S[ i ] * ( N - 1 );
	}

	sort( finalH, finalH + N );

	LL middle;
	LL left = 0;
	LL right = 1e16;
	while( left <= right )
	{
		middle = ( left + right ) / 2;

		if( check( middle ) )
		{
			right = middle - 1;
		}
		else
		{
			left = middle + 1;
		}
	}

	while( ! check( middle ) ) ++middle;

	cout << middle << endl;

	return 0;
}

Submission Info

Judge Result