Submission #70982865

---

Source Code Expand

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.IOException;
import java.util.StringTokenizer;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter out = new PrintWriter(System.out);
        StringTokenizer st = new StringTokenizer(br.readLine());

        int N = Integer.parseInt(st.nextToken());
        long X = Long.parseLong(st.nextToken());
        long Y = Long.parseLong(st.nextToken());

        long[] A = new long[N];
        st = new StringTokenizer(br.readLine());

        long minA = Long.MAX_VALUE;
        long maxA = Long.MIN_VALUE;
        long D = Y - X;
        long K = -1;
        boolean possible = true;

        for (int i = 0; i < N; i++) {
            A[i] = Long.parseLong(st.nextToken());
            minA = Math.min(minA, A[i]);
            maxA = Math.max(maxA, A[i]);

            long currentK = (A[i] * X) % D;
            if (K == -1) {
                K = currentK;
            } else if (K != currentK) {
                possible = false;
            }
        }

        if (!possible) {
            out.println(-1);
            out.flush();
            return;
        }

        long W_lower_bound = maxA * X;
        long W_upper_bound = minA * Y;

        if (W_lower_bound > W_upper_bound) {
            out.println(-1);
            out.flush();
            return;
        }

        long W_max = W_upper_bound;
        long totalLargeCandies = 0;

        for (int i = 0; i < N; i++) {
            long li = (W_max - A[i] * X) / D;
            totalLargeCandies += li;
        }

        out.println(totalLargeCandies);

        out.flush();
        br.close();
        out.close();
    }
}

Submission Info

Judge Result