Submission #1521558


Source Code Expand

#pragma GCC optimize("O3")
#include<bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define in insert
#define er erase
#define fr first
#define sc second
const int inf=INT_MAX;
const int nmax=1e5+5;
const int mod=1e9+7;
typedef long long ll;
using namespace std;
int n,i;
ll h[nmax],a,b,l,r,mid,mx;
int check(ll nr)
{
	int i;
	ll cnt=0;
	for(i=1;i<=n;i++)if(h[i]-nr*b>0)cnt+=(h[i]-nr*b)/(a-b)+((h[i]-nr*b)%(a-b)!=0);
	return cnt<=nr;
}
int main()
{
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
	//freopen("sol.in","r",stdin);
	cin>>n>>a>>b;
	for(i=1;i<=n;i++)cin>>h[i],mx=max(mx,h[i]);
	r=mx/b+(mx%b!=0);
	while(l<=r)
	{
		mid=(l+r)/2;
		if(check(mid))r=mid-1;
		else l=mid+1;
	}
	cout<<r+1<<endl;
	return 0;
}

Submission Info

Submission Time
Task D - Widespread
User abcde2002
Language C++14 (GCC 5.4.1)
Score 400
Code Size 797 Byte
Status AC
Exec Time 47 ms
Memory 1024 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 13
Set Name Test Cases
Sample a01, a02, a03
All a01, a02, a03, b04, b05, b06, b07, b08, b09, b10, b11, b12, b13
Case Name Status Exec Time Memory
a01 AC 1 ms 256 KB
a02 AC 1 ms 256 KB
a03 AC 1 ms 256 KB
b04 AC 1 ms 256 KB
b05 AC 13 ms 1024 KB
b06 AC 47 ms 1024 KB
b07 AC 32 ms 1024 KB
b08 AC 30 ms 1024 KB
b09 AC 15 ms 1024 KB
b10 AC 14 ms 1024 KB
b11 AC 16 ms 1024 KB
b12 AC 16 ms 1024 KB
b13 AC 36 ms 1024 KB