Submission #1777748


Source Code Expand

import java.util.*;

class Main {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n=scan.nextInt();
        int a=scan.nextInt();
        int b=scan.nextInt();
        int c=scan.nextInt();
        int[]d=new int[n];
        for(int i=0;i<n;++i)d[i]=scan.nextInt();
        long p=0,f=1000000000;
        for(;f-p>1;){
            long m=(p+f)/2;
            long t=c-a*m;
            for(int j=0;j<n;++j)
                if(d[j]>b*m)t+=d[j]-b*m;
            if(t>=0)
                p=m;
            else
                f=m;
        }
        System.out.println(p);
    }
}

Submission Info

Submission Time
Task C - 最高のピザ (Best Pizza)
User kirika_comp
Language Java8 (OpenJDK 1.8.0)
Score 100
Code Size 657 Byte
Status AC
Exec Time 105 ms
Memory 21844 KB

Judge Result

Set Name set01 set02 set03 set04 set05
Score / Max Score 20 / 20 20 / 20 20 / 20 20 / 20 20 / 20
Status
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
Set Name Test Cases
set01 data1
set02 data2
set03 data3
set04 data4
set05 data5
Case Name Status Exec Time Memory
data1 AC 92 ms 19412 KB
data2 AC 91 ms 19028 KB
data3 AC 105 ms 21712 KB
data4 AC 97 ms 19412 KB
data5 AC 97 ms 21844 KB