题意:就是有一个钟表之后上边可以有很多指针 问指针旋转之后是否能够重合
思路:首先,刚开始用差分的方法进行做之后用vector判断是否全部相等(vector可以一次性判断全部元素是否相等)之后一直wa 之后发现是kmp进行判断是否重合将第一个数组开到两倍 计算出最后一个指针到第一个指针间距(36000-(a[n-1]-a[0]))插入进行计算可能那个值就在连那个数组之进行匹配 kmp匹配;
代:
#include <bits/stdc++.h>
using namespace std;
#define FAST ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
typedef long long LL;
typedef pair<int, int> PII;
const int N = 200000+10;
int n, m, a[N];
int ne[N], b[N], sum1[N], sum2[N];
void get_ne()//求next数组
{
ne[0] = -1;
for (int i = 1, j = -1; i < n; i++)
{
while (j != -1 && sum2[i] != sum2[j + 1])
j = ne[j];
if (sum2[i] == sum2[j + 1])
j++;
ne[i] = j;
}
}
int kmp()//匹配
{
for (int i = 0, j = -1; i < 2 * n; i++)
{
while (j != -1 && sum1[i] != sum2[j + 1])
j = ne[j];
if (sum1[i] == sum2[j + 1])
j++;
if (j == n - 1)
return 1;
}
return 0;
}
void solve()
{
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
sort(a, a + n);
sort(b, b + n);
for (int i = 0; i < n; i++)//计算间距差分
{
if (i != n - 1)
sum1[i] = a[i + 1] - a[i];
else
sum1[i] = 360000 - (a[i] - a[0]);
}
for (int i = 0; i < n; i++)
{
if (i != n - 1)
sum2[i] = b[i + 1] - b[i];
else
sum2[i] = 360000 - (b[i] - b[0]);
}
for (int i = 0; i < n; i++)//第一个数组扩张到2倍
sum1[i + n] = sum1[i];
get_ne();
if (kmp())
cout << "possible" << endl;
else
cout << "impossible" << endl;
}
signed main()
{
FAST;
int T = 1;
// cin>>T;
while (T--)
{
solve();
}
}