LonLife 1071 - Boring Game

1071 - Boring Game

Time Limit：1s Memory Limit：1024MByte

Submissions：595Solved：189

DESCRIPTION

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 valuesai .

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 ) .

INPUT

The first line is a single integer $T$, indicating the number of test cases.
For each test case:
In the first line, there are only one integer $n$(n≤105), indicating the number of food piles.
The second line is $n$ integers indicate sequence $a$ ( | ai | ≤ 106).
The third line is $n$ integers indicate sequence $b$ ( | bi | ≤ 106).

OUTPUT

For each test case, just print 'Yes' if PigVan can get$b$ after some operations; otherwise, print 'No'.

SAMPLE INPUT

261 6 9 4 2 0 7 -6 19 2 -6 641 2 3 4 4 2 1 3

SAMPLE OUTPUT

YesNo

SOLUTION

“玲珑杯”ACM比赛 Round #7

题目链接：http://www.ifrog.cc/acm/problem/1071

思路：

考虑一次操作(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<string.h>#include<algorithm>using namespace std;int sum1[110000],sum2[110000];int main(){int t,n,m,i,j,k,a,b;scanf("%d",&t);while(t--){scanf("%d",&n);sum1[0]=0;sum2[0]=0;for(i=1;i<=n;i++){scanf("%d",&a);sum1[i]=sum1[i-1]+a;}sort(sum1+1,sum1+n+1);for(i=1;i<=n;i++){scanf("%d",&b);sum2[i]=sum2[i-1]+b;}sort(sum2+1,sum2+n+1);int flag=0;for(i=1;i<n;i++){if(sum1[i]!=sum2[i]){flag=1;break;}}if(flag){printf("No\n");}else{printf("Yes\n");}}return 0;}