Submission #70965601

---

Source Code Expand

#include<bits/stdc++.h>
#define ll long long
#define REP(i,l,r) for(int i=(l);i<=(r);i++)
#define PER(i,r,l) for(int i=(r);i>=(l);i--)
using namespace std;
inline int read(){
    int x=0,f=1;
    char c=getchar();
    while(!isdigit(c)){
        if(c=='-')f=-1;
        c=getchar();
    }
    while(isdigit(c)){
        x=(x<<3)+(x<<1)+c-'0';
        c=getchar();
    }
    return x*f;
}
void write(ll x){
    if(x<0)putchar('-'),x=-x;
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
const int N=2e5+5;
int gcd(int a,int b){
    if(!b)return a;
    return gcd(b,a%b);
}
int n,a[N],x,y;
int main(){
    n=read(),x=read(),y=read();
    REP(i,1,n)a[i]=read();
    sort(a+1,a+n+1);
    int d=(y-x)/gcd(x,y-x);
    REP(i,2,n)if((a[i]-a[i-1])%d){
        write(-1),putchar('\n');
        return 0;
    }
    if(1ll*y*a[1]<1ll*x*a[n]){
        write(-1),putchar('\n');
        return 0;
    }
    ll res=a[1];int p=a[1];
    REP(i,2,n){
        p-=1ll*(a[i]-a[i-1])*x/(y-x);
        res+=p;
    }
    write(res),putchar('\n');
    return 0;
}

Submission Info

Judge Result