CodeforceMathMashupTwo

running_Turtle1

于 2024-04-14 21:31:16 发布

阅读量693

点赞数 13

分类专栏：专题训练总结文章标签： Algorithm

本文链接：https://blog.csdn.net/2301_78527293/article/details/137755262

版权

专题训练总结专栏收录该内容

13 篇文章 0 订阅

订阅专栏

1857F Sum and Product

You have an array $a$ of length $n$ .
Your task is to answer $q$ queries: given $x, y$ , find the number of pairs $i$ and $j$ ( $\le i < j \le n$ ) that both $a_i + a_j = x$ and $a_i \cdot a_j = y$ .
That is, for the array $[1, 3, 2]$ and asking for $x = 3, y = 2$ the answer is $1$ :

$i = 1$ and $j = 2$ fail because $1 + 3 = 4$ and not $3,$ also $\cdot 3=3$ and not $2$ ;
$i = 1$ and $j = 3$ satisfies both conditions;
$i = 2$ and $j = 3$ fail because $3 + 2 = 5$ and not $3,$ also $\cdot 2=6$ and not $2$ ;

换一下题面，设 $a_i+a_j=n_1$ , $a_i-a_j=n_2$

设一元二次方程 $x^2-n_1*x+n_2=0$

根据韦达定理， $x_1+x_2=n_1$ , $x_1*x_2=n_2$

发现 $a_i$ 与 $a_j$ 就是一元二次方程的根，我们解对应根的数量即可

如果 $n_1^2-4*n_2<0$ , 那么无解，也就是 $n_1^2<4*n_2$ , 因为数据范围问题，改为判定 $\sqrt{n_1}<2\sqrt{n_2}$ , 这个式子成立就无解；如果相等（浮点数误差在 1e-6 之内）的话，就是解单根，单根 = $-\frac{n_1}{2}$ ; 其余情况，方程有两个根，先求 $\Delta=n_1^2-4*n_2=(n_1+2\sqrt{n_2})(n_1-2\sqrt{n_2})$

则 $\sqrt{\Delta}=(\sqrt{n_1+2\sqrt{n_2}})(\sqrt{n_1-2\sqrt{n_2}})$

$x_{1}=\frac{n_1+\sqrt{\Delta}}{2}$

$x_{2}=\frac{n_1-\sqrt{\Delta}}{2}$

注意将数据全部转化为浮点数处理，先看看是否是接近整数，对于接近整数的， $ma p$ 查询映射的数量

其实以上处理均为无效。答案只有 $\Delta$ 完全平方才有效，这个优良性质使得我们不需要关心数据范围的问题

1920C Partitioning the Array



Allen has an array $a_1, a_2,\ldots,a_n$ . For every positive integer $k$ that is a divisor of $n$ , Allen does the following:

He partitions the array into $\frac{n}{k}$ disjoint subarrays of length $k$ . In other words, he partitions the array into the following subarrays:

$[a_1,a_2,\ldots,a_k],[a_{k+1}, a_{k+2},\ldots,a_{2k}],\ldots,[a_{n-k+1},a_{n-k+2},\ldots,a_{n}]$

Allen earns one point if there exists some positive integer $m$ ( $\geq 2$ ) such that if he replaces every element in the array with its remainder when divided by $m$ , then all subarrays will be identical.
Help Allen find the number of points he will earn.

if $x$ % $m$ = $y$ % $m$ , 那么 $∣ x - y ∣$ % $m$ = 0;

枚举 $k$ , 如果某个 m 成立，则对于所有 $a_i$ ，需要满足 $a_i-a_{i+k}|$ % $m$ = $0$

#include<bits/stdc++.h>
using namespace std;
#define int long long

int n, a[200010];

void solve(){
    cin >> n;
    for(int i = 1; i <= n; i ++){
        cin >> a[i];
    }
    int res = 0;
    auto check = [&] (int k) -> void{
        int g = 0;
        for(int i = 1; i + k <= n; i ++){
            g = __gcd(g, abs(a[i] - a[i + k]));
        }
        if(g != 1) res ++;
    };
    for(int k = 1; k <= n / k; k ++){
        if(n % k == 0){
            check(k);
            if(k != n / k) check(n / k);
        }
    }
    cout << res << '\n';
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0); 
    int T;
    cin >> T;
    while(T --)
    solve();
    return 0;
}

The Walkway

There are $n$ benches near the Main Walkway in Summer Infomatics School. These benches are numbered by integers from $1$ to $n$ in order they follow. Also there are $m$ cookie sellers near the Walkway. The $i$ -th ( $\le i \le m$ ) cookie sellers is located near the $s_i$ -th bench.
Petya is standing in the beginning of the Walkway. He will pass near all benches starting from the $1$ -st bench and ending with the $n$ -th bench. Petya passes the distance between two consecutive benches in $1$ minute. He has a knapsack with an infinite amount of cookies. Petya is going to eat cookies from his knapsack and buy them from cookie sellers during the walk.
Petya eats cookies only near the benches according to the following rule: he will eat the cookie near the $i$ -th ( $\le i \le n$ ) bench if and only if at least one of the following conditions holds:

There is a cookie seller near the $i$ -th bench. Then Petya will buy a cookie from cookie seller and eat it immediately.
Petya has not yet eaten a cookie. Then Petya will take a cookie from his knapsack and eat it immediately.
At least $d$ minutes passed since Petya ate the previous cookie. In other words, Petya has not eaten a cookie near the benches $\ldots, \max(i-d+1, 1)$ . Then Petya will take a cookie from his knapsack and eat it immediately.
You may assume that Petya eats cookies instantly. Petya will not eat two or more cookies near the same bench.
You want to minimize the number of cookies Petya will eat during his walk. In order to do this, you will ask the administration of the Summer Informatics School to remove exactly one cookie seller from the Walkway before Petya starts his walk.
Please determine the minimum possible number of cookies Petya can eat after removing exactly one cookie seller. Also determine the number of cookie sellers, such that if you remove one of them, Petya will eat the minimum possible number of cookies.

Input
The first line contains a single integer $t$ ( $\le t \le 10^3$ ) — the number of test cases.
The first line of each test case contains three integers $n$ , $m$ and $d$ ( $\le d \le n \le 10^9$ , $\le m \le \min(10^{5}, n)$ ) — the number of benches, the number of cookie sellers and the value of parameter $d$ from the statement, respectively.
The second line of each test case contains $m$ integers $s_1, s_2, \ldots, s_m$ ( $\le s_i \le n$ ) — the locations of the cookie sellers. It is guaranteed that $s_{i} < s_{i+1}$ for all $\leq i \leq m - 1$ .
It is guaranteed that the sum of $m$ over all test cases does not exceed $10^5$ .

Output
For each test case print two integers — the minimum number of cookies that Petya can eat if exactly one cookie seller is removed, and the number of cookie sellers such that if one of them is removed, Petya will eat the minimum possible number of cookies.

从 1 走到 n，

如果当前位置有标记，代价 + 1 ;

如果 [i-d+1,i-1] 均未付出代价，i 处代价 + 1 (也就是说每 d 段必须代价 + 1)

特殊的，位置 1 一定代价 + 1

可以去掉一个标记，求答案

如果不去掉任何标记，代价 =

s[0] = 0, s[1] = 1; 原来的 [1, m] 右移到 [2, m + 1]; s[m + 2] = n + 1
如果 s[1] = 1, 就无需新增一个
for(int i = 1; i <= m + 2; i ++){
    int dis = s[i] - s[i - 1] - 1;
    res += dis / d;
    res ++;
}
res --;