卷业务模型分析
这里我们可以这么缩小
k
k
k 的范围,我们先去个括号
B [ i ] = k × A [ i ] + b ± 10 B[i]=k×A[i]+b±10 B[i]=k×A[i]+b±10
B [ i + 1 ] = k × A [ i + 1 ] + b ± 10 B[i+1]=k×A[i+1]+b±10 B[i+1]=k×A[i+1]+b±10
B [ i + 1 ] − B [ i ] = k × ( A [ i + 1 ] − A [ i ] ) ± 20 B[i+1]-B[i]=k×(A[i+1]-A[i])±20 B[i+1]−B[i]=k×(A[i+1]−A[i])±20
k = B [ i + 1 ] − B [ i ] A [ i + 1 ] − A [ i ] ± 20 A [ i + 1 ] − A [ i ] k=\frac{B[i+1]-B[i]}{A[i+1]-A[i]}\ ±\ \frac{20}{A[i+1]-A[i]} k=A[i+1]−A[i]B[i+1]−B[i] ± A[i+1]−A[i]20
那么我们发现只要有一个 A [ i ] ≠ A [ i + 1 ] A[i]≠A[i+1] A[i]=A[i+1] 的位置,我们就可以将 k k k 的范围缩小到 20 20 20 以内。然而我们是肯定可以找到这么个位置的,因为题目中有描述 A [ i ] A[i] A[i] 将会在 [ 1 , 1000000 ] [1,1000000] [1,1000000] 之间均匀分布。所以我们立马一步就可以将 k k k 的范围缩小到 20 20 20 以内。如下:
pair<double, double> k;
for (int i = 2; i <= n; ++i) {
if (A[i] == A[i - 1]) continue;
double d = A[i] - A[i - 1], t = B[i] - B[i - 1];
k.first = min(t / d - 20 / d, t / d + 20 / d);
k.second = max(t / d - 20 / d, t / d + 20 / d);
break;
}
如果 k k k 是确定的,那么 b b b 的范围就出来了呀。那么,我们可以遍历区间内每个 k k k ,然后算出 n n n 个 b b b 的范围,其有交集便有解,否则一定无解。时间复杂度 O ( 20 × n ) O(20×n) O(20×n)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 10;
int n;
ll A[N], B[N];
int main() {
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
int T;
scanf("%d", &T);
while(T--) {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%lld", &A[i]);
}
for (int i = 1, x; i <= n; ++i) {
scanf("%d", &x);
}
for (int i = 1; i <= n; ++i) {
scanf("%lld", &B[i]);
}
pair<double, double> k;
for (int i = 2; i <= n; ++i) {
if (A[i] == A[i - 1]) continue;
double d = A[i] - A[i - 1], t = B[i] - B[i - 1];
k.first = min(t / d - 20 / d, t / d + 20 / d);
k.second = max(t / d - 20 / d, t / d + 20 / d);
break;
}
bool ok = false;
pair<ll, ll> b = {-1e18, 1e18};
for (ll i = ceil(k.first); i <= (ll)k.second; ++i) {
for (int j = 1; j <= n; ++j) {
ll c = i * A[j] - B[j];
ll l = -10 - c, r = 10 - c;
b.first = max(b.first, l);
b.second = min(b.second, r);
if (b.first > b.second) break;
}
if (b.first <= b.second) {
ok = true;
break;
}
}
if (ok) {
puts("1");
}
else {
puts("2");
}
}
}