Submission #70964851

---

Source Code Expand

#include <bits/stdc++.h>
#define ll long long
using namespace std;
void solve()
{
    ll n;
    ll x,y;
    cin>>n>>x>>y;
    vector<ll> a(n);
    for(auto &x : a)
        cin>>x;
    ll g= __gcd(x, y);
    ll k=(y-x)/g;
    for(int i=1;i<n;i++)
        if((a[i]-a[0])%k!=0){
            cout<<-1<<endl;
            return;
        }
    ll mod=y-x;
    ll t=(a[0]*x)%mod;
    ll mx=LLONG_MAX;
    for(ll a : a) mx=min(mx,a*y);
    ll rem=mx%mod;
    ll diff=(rem-t+mod)%mod;
    ll W=mx-diff;
    if(W < *max_element(a.begin(),a.end())*x){
        cout<<-1<<endl;
        return;
    }
    ll t2 = 0;
    for(ll a : a)
        t2+=(W-a*x)/(y-x);
    cout<<t2<<endl;
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t;
    //cin>>t;
    t=1;
    while(t--) solve();
    return 0;
}

Submission Info

Judge Result