Submission #70963290

---

Source Code Expand

#include <bits/stdc++.h>
#define int long long
using namespace std;

int gcd(int a, int b) {
    if (b == 0) return a;
    return gcd(b, a%b);
}

const int N = 2e5+5;
int a[N];

signed main()
{
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    ///
    int n, x, y;
    cin >> n >> x >> y;
    int gd = gcd(x, y);
    int miv = 1e18;
    int mav = -1e18;
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
        int ai = a[i];
        miv = min(miv, ai);
        mav = max(mav, ai);
    }
    int sm = 0;
    bool pos = true;
    for (int i = 0; i < n; ++i) {
        if ((a[i]-miv)%(y/gd-x/gd) != 0) pos = false;
        int mv = (a[i]-miv)/(y/gd-x/gd);
        int ad = miv-mv*(x/gd);
        if (ad < 0) pos = false;
        sm += ad;
    }
    if (pos) cout << sm;
    else cout << -1;
    cout << '\n';
}

Submission Info

Judge Result