Submission #70985812

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <bitset>
#include <numeric>
using namespace std;
#define ll long long
#define vi vector<int>
#define vs vector<string>
#define vll vector<long long>
#define vii vector<pair<int, int>>
#define vllvector vector<pair<ll, ll>>
#define vb vector<bool>
#define yes cout << "Yes" << endl;
#define no cout << "No" << endl;
#define rep(i, n) for (int i = 0; i < n; i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true;} return false;}
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true;} return false;}

ll kouyaku(ll a, ll b) {
    return b == 0 ? a : kouyaku(b , a % b);
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    ll n, x, y;
    cin >> n >> x >> y;
    vll A(n);
    rep(i, n) {
        cin >> A[i];
    }

    ll delta = y - x;
    ll k = kouyaku(x, delta);
    ll delta_dash = delta / k;
    ll x_dash = x / k;
    ll u_lim = A[0];
    ll d_lim = 0;
    ll sum = 0;

    rep ( i, n) {
        ll diff_a = A[i] - A[0];
        if(diff_a % delta_dash != 0) {
            cout << -1 << endl;
            return 0;
        }
        ll fac = diff_a / delta_dash;
        ll temp_i = x_dash * fac;
        d_lim = max(d_lim, temp_i);
        u_lim = min(u_lim, A[i] + temp_i);

        sum += temp_i;

    }
    ll max = u_lim;
    ll max_total_small = n * max - sum;
    if (d_lim > u_lim) {
        cout << -1 << endl;
    }else {
        cout << max_total_small << endl;

    }


}

Submission Info

Judge Result