CF1110E Magic Stones

题目描述

Grigory has $n$ magic stones, conveniently numbered from $1$ to $n$ . The charge of the $i$ -th stone is equal to $c_i$ .

Sometimes Grigory gets bored and selects some inner stone (that is, some stone with index $i$ , where $2\le i\le n-1$ ), and after that synchronizes it with neighboring stones. After that, the chosen stone loses its own charge, but acquires the charges from neighboring stones. In other words, its charge $c_i$ changes to $c_i^{\prime }=c_{i+1}+c_{i-1}-c_i$ .

Andrew, Grigory’s friend, also has $n$ stones with charges $t_i$ . Grigory is curious, whether there exists a sequence of zero or more synchronization operations, which transforms charges of Grigory’s stones into charges of corresponding Andrew’s stones, that is, changes $c_i$ into $t_i$ for all $i$ ?

输入格式

The first line contains one integer $n$ ( $2\le n\le 10^5$ ) — the number of magic stones.

The second line contains integers $c_1,c_2,\dots ,c_n$ ( $0\le c_i\le 2\cdot 10^9$ ) — the charges of Grigory’s stones.

The second line contains integers $t_1,t_2,\dots ,t_n$ ( $0\le t_i\le 2\cdot 10^9$ ) — the charges of Andrew’s stones.

输出格式

If there exists a (possibly empty) sequence of synchronization operations, which changes all charges to the required ones, print “Yes”.

Otherwise, print “No”.

样例 #1

样例输入 #1

4
7 2 4 12
7 15 10 12

样例输出 #1

Yes

样例 #2

样例输入 #2

3
4 4 4
1 2 3

样例输出 #2

No

提示

In the first example, we can perform the following synchronizations ( $1$ -indexed):

• First, synchronize the third stone $[7,2,4,12]\to [7,2,10,12]$ .
• Then synchronize the second stone: $[7,2,10,12]\to [7,15,10,12]$ .

In the second example, any operation with the second stone will not change its charge.

题面翻译

题意：

一次操作选择$1<i<n$，使$c_i$变为$c_i^{\prime }$，$c_i^{\prime }=c_{i+1}+c_{i-1}-c_i$

是否能做若干次操作，使每个$c_i$和$t_i$相等？

数据范围：

$2\le n\le 10^5,0\le c_i\le 2\ast 10^9,0\le t_i\le 2\ast 10^9$

输入方式：

行1 $n$

行2 $c_1,\cdots ,c_n$

行3 $t_1,\cdots ,t_n$

输出方式：

Yes/No

思路

1. 首先$c_1$$!$=$t_1$或$c_n$$!$=$t_n$的情况肯定不可以
2. 然后设$a_i=$$c_i-c_{i-1},a_{i+1}=c_{i+1}-c_i$
3. $c_i^{\prime }=c_{i+1}+c_{i-1}-c_i$
4. 则$a_i=c_i^{\prime }-c_{i-1}=c_{i+1}+c_{i-1}-c_i-c_{i-1}=c_{i+1}-c_i=a_{i+1}$
   $a_{i+1}=c_{i+1}-c_i^{\prime }=c_{i+1}-(c_{i+1}+c_{i-1}-c_i)=c_i-c_{i-1}=a_i$
5. 我们发现两个$a_i$ 互换了。于是问题就变成了：给两个差分数组，每次操作可以将其中一个数组的相邻两个元素互换，问能不能让两个数组相等。

代码

/*************************************************
Note:
*************************************************/
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <stdio.h>
#include <iostream>
#include <vector>
#include <iomanip>
#include <string.h>
#include <algorithm>
#include <cmath>
#include <cstring>
#define ll long long
#define ull unsigned long long
using namespace std;
const int N = 1e5 + 10;
const int INF = 0x3f3f3f3f;
inline int read()
{
    int s = 0, w = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9')
    {
        if (ch == '-')
            w = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9')
        s = s * 10 + ch - '0', ch = getchar();
    return s * w;
}
int a[N], b[N], c[N], d[N];
int main()
{
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    for (int i = 1; i <= n; i++)
        cin >> b[i];
    if (a[1] != b[1] || a[n] != b[n])
    {
        cout << "No" << endl;
        return 0;
    }
    for (int i = 1; i < n; i++)
    {
        c[i] = a[i + 1] - a[i];
        d[i] = b[i + 1] - b[i];
    }
    sort(c + 1, c + n);
    sort(d + 1, d + n);
    for (int i = 1; i < n; i++)
        if (c[i] != d[i])
        {
            cout << "No" << endl;
            return 0;
        }
    cout << "Yes" << endl;
    return 0;
}