Codeforces 761B-Dasha and friends

Dasha and friends time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output

Running with barriers on the circle track is very popular in the country where Dasha lives, so no wonder that on her way to classes she saw the following situation:

The track is the circle with length L, in distinct points of which there are n barriers. Athlete always run the track in counterclockwise direction if you look on him from above. All barriers are located at integer distance from each other along the track.

Her friends the parrot Kefa and the leopard Sasha participated in competitions and each of them ran one lap. Each of the friends started from some integral point on the track. Both friends wrote the distance from their start along the track to each of the n barriers. Thus, each of them wrote n integers in the ascending order, each of them was between 0 and L - 1, inclusively.

Consider an example. Let L = 8, blue points are barriers, and green points are Kefa's start (A) and Sasha's start (B). Then Kefa writes down the sequence[2, 4, 6], and Sasha writes down [1, 5, 7].

There are several tracks in the country, all of them have same length and same number of barriers, but the positions of the barriers can differ among different tracks. Now Dasha is interested if it is possible that Kefa and Sasha ran the same track or they participated on different tracks.

Write the program which will check that Kefa's and Sasha's tracks coincide (it means that one can be obtained from the other by changing the start position). Note that they always run the track in one direction — counterclockwise, if you look on a track from above.

Input

The first line contains two integers n and L (1 ≤ n ≤ 50, n ≤ L ≤ 100) — the number of barriers on a track and its length.

The second line contains n distinct integers in the ascending order — the distance from Kefa's start to each barrier in the order of its appearance. All integers are in the range from 0 to L - 1 inclusively.

The second line contains n distinct integers in the ascending order — the distance from Sasha's start to each barrier in the order of its overcoming. All integers are in the range from 0 to L - 1 inclusively.

Output

Print "YES" (without quotes), if Kefa and Sasha ran the coinciding tracks (it means that the position of all barriers coincides, if they start running from the same points on the track). Otherwise print "NO" (without quotes).

Examples input 3 8 2 4 6 1 5 7 output YES input 4 9 2 3 5 8 0 1 3 6 output YES input 2 4 1 3 1 2 output NO Note

The first test is analyzed in the statement.

题意：有两个人分别在周长为L的圆上，圆上有n个障碍物，两个人分别以逆时针的方向告诉你他们各自距离各个障碍物的距离，问他们是否在同一个圆上

解题思路：若一开始不在障碍物上，则先把他们逆时针移到他们各自前面的第一个障碍物，然后把一个人不断地逆时针地向其他障碍物前进，计算出距离各个障碍物的距离，比较一下两个人的是否相同

#include <iostream> #include <cstdio> #include <string> #include <cstring> #include <algorithm> #include <cmath> #include <queue> #include <vector> #include <set> #include <stack> #include <map> #include <climits> using namespace std; #define LL long long int n,L; int a[105],b[105]; bool check(int x[],int y[]) { int flag=1; for(int i=0;i<n;i++) if(x[i]!=y[i]) flag=0; return flag; } int main() { while(~scanf("%d %d",&n,&L)) { for(int i=0;i<n;i++) { scanf("%d",&a[i]); if(i) a[i]-=a[0]; } a[0]=0; for(int i=0;i<n;i++) { scanf("%d",&b[i]); if(i) b[i]-=b[0]; } b[0]=0; int flag=0; if(check(a,b)) flag=1; for(int i=0;i<n;i++) { int x=a[1]; for(int j=1;j<n;j++) a[j-1]=a[j]-x; a[n-1]=L-x; if(check(a,b)) flag=1; if(flag) break; } if(flag) printf("YES\n"); else printf("NO\n"); } return 0; }