题意:
给出一个无限大小的二维平面坐标系,现在给出一系列数据点,给出的形式是给出
(
x
0
,
y
0
)
(x_{0},y_{0})
(x0,y0),再规定可以使用递推式
x
i
=
a
x
∗
x
i
−
1
+
b
x
,
y
i
=
a
y
∗
y
i
−
1
+
b
y
x_{i}=a_{x}*x_{i-1}+b_{x},y_{i}=a_{y}*y_{i-1}+b_{y}
xi=ax∗xi−1+bx,yi=ay∗yi−1+by,现在问,若给出起点为
(
s
x
,
s
y
)
(s_{x},s_{y})
(sx,sy),可以进行上下左右的移动,每次移动消耗一次步数,问在步数不超过
k
k
k 次的情况下,最多能经过多少个数据点,注意一个数据点经过多次也只算一次。
a
x
a_{x}
ax 和
a
y
a_{y}
ay 大于等于
2
2
2,再加上步数小于等于
1
e
16
1e^{16}
1e16,在这两个条件的约束下,可以做出贡献的点数最多是小于
64
64
64个的,因为
2
64
>
1
e
18
2^{64}>1e18
264>1e18,这样一来我们就可以预处理出这
60
60
60 多个点,然后暴力,两层for循环确定起点和终点。
AC代码:
#include <cstdio>
#include <vector>
#include <queue>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <stack>
#include <queue>
using namespace std;
#define sd(n) scanf("%d", &n)
#define sdd(n, m) scanf("%d%d", &n, &m)
#define sddd(n, m, k) scanf("%d%d%d", &n, &m, &k)
#define pd(n) printf("%d\n", n)
#define pc(n) printf("%c", n)
#define pdd(n, m) printf("%d %d", n, m)
#define pld(n) printf("%lld\n", n)
#define pldd(n, m) printf("%lld %lld\n", n, m)
#define sld(n) scanf("%lld", &n)
#define sldd(n, m) scanf("%lld%lld", &n, &m)
#define slddd(n, m, k) scanf("%lld%lld%lld", &n, &m, &k)
#define sf(n) scanf("%lf", &n)
#define sc(n) scanf("%c", &n)
#define sff(n, m) scanf("%lf%lf", &n, &m)
#define sfff(n, m, k) scanf("%lf%lf%lf", &n, &m, &k)
#define ss(str) scanf("%s", str)
#define rep(i, a, n) for (int i = a; i <= n; i++)
#define per(i, a, n) for (int i = n; i >= a; i--)
#define mem(a, n) memset(a, n, sizeof(a))
#define debug(x) cout << #x << ": " << x << endl
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mod(x) ((x) % MOD)
#define gcd(a, b) __gcd(a, b)
#define lowbit(x) (x & -x)
typedef pair<int, int> PII;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const int MOD = 1e9 + 7;
const double eps = 1e-9;
const ll INF = 0x3f3f3f3f3f3f3f3fll;
const int inf = 0x3f3f3f3f;
inline int read()
{
int ret = 0, sgn = 1;
char ch = getchar();
while (ch < '0' || ch > '9')
{
if (ch == '-')
sgn = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9')
{
ret = ret * 10 + ch - '0';
ch = getchar();
}
return ret * sgn;
}
inline void Out(int a) //Êä³öÍâ¹Ò
{
if (a > 9)
Out(a / 10);
putchar(a % 10 + '0');
}
ll gcd(ll a, ll b)
{
return b == 0 ? a : gcd(b, a % b);
}
ll lcm(ll a, ll b)
{
return a * b / gcd(a, b);
}
///快速幂m^k%mod
ll qpow(ll a, ll b, ll mod)
{
if (a >= mod)
a = a % mod + mod;
ll ans = 1;
while (b)
{
if (b & 1)
{
ans = ans * a;
if (ans >= mod)
ans = ans % mod + mod;
}
a *= a;
if (a >= mod)
a = a % mod + mod;
b >>= 1;
}
return ans;
}
// 快速幂求逆元
int Fermat(int a, int p) //费马求a关于b的逆元
{
return qpow(a, p - 2, p);
}
///扩展欧几里得
int exgcd(int a, int b, int &x, int &y)
{
if (b == 0)
{
x = 1;
y = 0;
return a;
}
int g = exgcd(b, a % b, x, y);
int t = x;
x = y;
y = t - a / b * y;
return g;
}
///使用ecgcd求a的逆元x
int mod_reverse(int a, int p)
{
int d, x, y;
d = exgcd(a, p, x, y);
if (d == 1)
return (x % p + p) % p;
else
return -1;
}
///中国剩余定理模板0
ll china(int a[], int b[], int n) //a[]为除数,b[]为余数
{
int M = 1, y, x = 0;
for (int i = 0; i < n; ++i) //算出它们累乘的结果
M *= a[i];
for (int i = 0; i < n; ++i)
{
int w = M / a[i];
int tx = 0;
int t = exgcd(w, a[i], tx, y); //计算逆元
x = (x + w * (b[i] / t) * x) % M;
}
return (x + M) % M;
}
int cnt;
ll x[100], y[100], ax, ay, bx, by, xs, ys;
ull t;
int main()
{
scanf("%lld%lld%lld%lld%lld%lld", x, y, &ax, &ay, &bx, &by);
scanf("%lld%lld%llu", &xs, &ys, &t);
cnt = 0;
rep(i, 1, 60)
{
x[i] = ax * x[i - 1] + bx;
y[i] = ay * y[i - 1] + by;
if (x[i] < x[i - 1] || y[i] < y[i - 1])
break;
cnt++;
}
int ans = 0;
rep(i, 0, cnt)
{
rep(j, i, cnt)
{
ull dis = min(abs(xs - x[i]) + abs(ys - y[i]), abs(xs - x[j]) + abs(ys - y[j]));
dis += abs(x[i] - x[j]) + abs(y[i] - y[j]);
if (dis <= t)
ans = max(j - i + 1, ans);
}
}
pd(ans);
return 0;
}