Submission #1777992


Source Code Expand

#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<vector>
#define N 100000
#define INF 10000000000
#define mem(a,b) memset(a,b,sizeof(a))
#define sqr(x)   return x*x
#define abs(x)   return x>0?x:(-x)
typedef long long ll;
//coding........
int  w[N+15];
int n;
int  a,b;
using namespace std;
ll Check(ll ans)
{
    int sum=0;
    for (int i=0;i<n;i++)
    {
        ll temp=w[i]-ans*b;
        if (temp>0)
        {
              sum+= temp/(a-b);
              if (temp%(a-b))
                sum++;
            if (sum>ans||sum<0)
                return 0;
        }
    }
     return 1;
}
int MAX;
void solve()
{
    ll left=0,right=MAX;
    while (left<right)
    {
        ll mid=(left+right)/2;
        if (Check(mid))
         right=mid;
        else
            left=mid+1;
    }
    printf("%lld\n",right);
}
int main()
{
    while(~scanf("%d%d%d",&n,&a,&b))
    {
       MAX= 0;
        for(int i=0; i<n; ++i)
        {
            scanf("%d",&w[i]);
            MAX= max(MAX, w[i]);
        }
    solve();
      }
         return 0;
}

Submission Info

Submission Time
Task D - Widespread
User vjudge5
Language Bash (GNU bash v4.3.11)
Score 0
Code Size 1172 Byte
Status RE
Exec Time 21 ms
Memory 1444 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
RE × 3
RE × 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 RE 21 ms 1444 KB
a02 RE 4 ms 548 KB
a03 RE 4 ms 544 KB
b04 RE 4 ms 544 KB
b05 RE 4 ms 644 KB
b06 RE 4 ms 596 KB
b07 RE 4 ms 548 KB
b08 RE 4 ms 552 KB
b09 RE 4 ms 548 KB
b10 RE 4 ms 604 KB
b11 RE 4 ms 552 KB
b12 RE 4 ms 544 KB
b13 RE 4 ms 540 KB