提出 #70963598

---

ソースコード 拡げる

/* Code By WCM */
/*
Date:
大致思路：
复杂度：
期望得分：
*/
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <vector>
#include <queue>
#define int long long

using namespace std;

inline int read();
void write(int);
void writeln(int);

const int N = 2e5 + 5, inf = 1e18;
int n, x, y, a[N], d[N];

signed main() {

//	freopen(".in", "r", stdin);
//	freopen(".out", "w", stdout);

	n = read(), x = read(), y = read();
	for(int i = 0; i < n; i++) a[i] = read();
	int g = y - x, m0 = (x * a[0]) % g, sum = 0;
	for(int i = 1; i < n; i++) if((x * a[i]) % g != m0) return puts("-1"), 0;
	for(int i = 0; i < n; i++) d[i] = x * (a[0] - a[i]) / g, sum += d[i];
	int L = -inf, R = inf;
	for(int i = 0; i < n; i++) L = max(L, -d[i]), R = min(R, a[i] - d[i]);
	if(L > R) return puts("-1"), 0;
	printf("%lld\n", sum + n * R);
	
//	printf("\nThe time used: ");
//	printf("%.2lfs",(double)clock()/CLOCKS_PER_SEC);

	return 0;

}

inline int read() {
	int res = 0, f = 1;
	char ch = getchar();
	while( !(ch >= '0' && ch <= '9') ) {
		if(ch == '-') f = -1;
		ch = getchar();
	}
	while(ch >= '0' && ch <= '9') {
		res = (res << 1) + (res << 3) + (ch ^ 48);
		ch = getchar();
	}
	return res * f;
}

void write(int x) {
	static int sta[35];
	int top = 0;
	do {
		sta[top++] = x % 10;
		x /= 10;
	} while(x);
	while(top) putchar(sta[--top] ^ 48);
}

void writeln(int x) {
	write(x);
	putchar('\n');
}

提出情報

ジャッジ結果