【 2013 Multi-University Training Contest 3 】

#include<cstdio>
#include<set>
#include<iostream>
typedef long long LL;
#define MAXN 500010
#define oo 123456789123456789LL
using namespace std;
struct Point {
int x, y;
Point(int _x = 0, int _y = 0) {
x = _x;
y = _y;
}
friend bool operator<(Point a, Point b) {
if (a.x != b.x) {
return a.x < b.x;
} else {
return a.y < b.y;
}
}
};
set<Point> myset;
Point p[MAXN];
inline LL dis2(Point a, Point b) {
LL x = a.x - b.x;
LL y = a.y - b.y;
return x * x + y * y;
}
inline LL dis1(Point a, Point b) {
LL x = a.x - b.x;
return x * x;
}
int main() {
int T;
int n;
int ax, bx, cx;
int ay, by, cy;
LL ans, res;
set<Point>::iterator it, tmp;
scanf("%d", &T);
while (T--) {
scanf("%d%d%d%d%d%d%d", &n, &ax, &bx, &cx, &ay, &by, &cy);
p[0] = Point(bx % cx, by % cy);
for (int i = 1; i < n; i++) {
p[i] = Point((p[i - 1].x * (LL) ax + bx) % cx,
(p[i - 1].y * (LL) ay + by) % cy);
}
res = oo;
ans = 0;
myset.clear();
myset.insert(p[0]);
for (int i = 1; i < n; i++) {
if (myset.count(p[i])) {
break;
}
myset.insert(p[i]);
it = myset.find(p[i]);
for (tmp = it, ++tmp; tmp != myset.end(); ++tmp) {
if (dis1(*it, *tmp) >= res) {
break;
} else {
res = min(res, dis2(*it, *tmp));
}
}
if (it != myset.begin()) {
for (tmp = it, --tmp;; --tmp) {
if (dis1(*it, *tmp) >= res) {
break;
} else {
res = min(res, dis2(*it, *tmp));
}
if (tmp == myset.begin()) {
break;
}
}
}
ans += res;
}
cout << ans << endl;
}
return 0;
}