Time Limit:1s Memory Limit:1024MByte
Submissions:541Solved:155
In a mysterious cave, PigVan ( Mr.Van's pet ) has lived for thousands years. PigVan absorbed the power of nature, and it may pretend a human in speaking, walking and so on.
One day, he bought some valuable stone, and divided them into n piles of stone where the ith pile (1≤i≤n) contains values ai .
After PigVan put them in a line, he wants to play a game.
In the boring game, he can do this operation:
Choose a stone pile ai (i>1)and its two adjacent piles ai-1, ai+1, turn (ai-1, ai, ai+1) to (ai-1 + ai, -ai, ai + ai+1).
PigVan wonders whether he can get (b1, b2, b3, …, bn) after several operations.
Note:
If you choose the last pile an, the operation will be ( an-1 + an, -an ) .
For each test case:
In the first line, there are only one integer nn(n≤10 5), indicating the number of food piles.
The second line is nn integers indicate sequence aa ( | a i | ≤ 10 6).
The third line is nn integers indicate sequence bb ( | b i | ≤ 10 6).
(ai-1, ai, ai+1)->(ai-1 + ai, -ai, ai+1 + ai)
如果考虑前缀和,那么一次操作等效为
(si-1, si, si+1)->(si, si-1, si+1)
即对于前缀和而言,他只是交换了位置。
因此,我们只需求出前缀和,然后看元素是否对等就行了。
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
int a[1000000],b[1000000];
int c[1000000],d[1000000];
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int n;
memset(c,0,sizeof(c));
memset(d,0,sizeof(d));
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
c[i]=c[i-1]+a[i];
}
for(int i=1;i<=n;i++)
{
scanf("%d",&b[i]);
d[i]=d[i-1]+b[i];
}
sort(c+1,c+n+1);
sort(d+1,d+n+1);
int sum=0;
for(int i=1;i<=n;i++)
{
if(c[i]==d[i])
{
sum++;
}
}
if(sum==n)
{
printf("Yes\n");
}
else
printf("No\n");
}
}