【暴力】Codeforces-500A New Year Transportation

版权声明：本文为博主原创文章，转载请留言通知。 https://blog.csdn.net/silent0001/article/details/52576693

。。。暴力，看懂题目就行。

【题目】

New Year Transportation

Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Description

New Year is coming in Line World! In this world, there are n cells numbered by integers from 1 to n, as a 1 × n board. People live in cells. However, it was hard to move between distinct cells, because of the difficulty of escaping the cell. People wanted to meet people who live in other cells.

So, user tncks0121 has made a transportation system to move between these cells, to celebrate the New Year. First, he thought of n - 1 positive integers a₁, a₂, ..., a_n - 1. For every integer i where 1 ≤ i ≤ n - 1 the condition 1 ≤ a_i ≤ n - i holds. Next, he made n - 1 portals, numbered by integers from 1 to n - 1. The i-th (1 ≤ i ≤ n - 1) portal connects cell i and cell (i + a_i), and one can travel from cell i to cell (i + a_i) using the i-th portal. Unfortunately, one cannot use the portal backwards, which means one cannot move from cell (i + a_i) to cell i using the i-th portal. It is easy to see that because of condition 1 ≤ a_i ≤ n - i one can't leave the Line World using portals.

Currently, I am standing at cell 1, and I want to go to cell t. However, I don't know whether it is possible to go there. Please determine whether I can go to cell t by only using the construted transportation system.

Input

The first line contains two space-separated integers n (3 ≤ n ≤ 3 × 10⁴) and t (2 ≤ t ≤ n) — the number of cells, and the index of the cell which I want to go to.

The second line contains n - 1 space-separated integers a₁, a₂, ..., a_n - 1 (1 ≤ a_i ≤ n - i). It is guaranteed, that using the given transportation system, one cannot leave the Line World.

Output

If I can go to cell t using the transportation system, print "YES". Otherwise, print "NO".

Sample Input

Input

8 4
1 2 1 2 1 2 1

Output

YES

Input

8 5
1 2 1 2 1 1 1

Output

NO

Hint

In the first sample, the visited cells are: 1, 2, 4; so we can successfully visit the cell 4.

In the second sample, the possible cells to visit are: 1, 2, 4, 6, 7, 8; so we can't visit the cell 5, which we want to visit.

【题意】

      n（3e4）个点，排成一排。 

      对于点i，可以传送到i+a[i]。 
     问你我们能否传送到t点。

      输入：第一行：共有n个点，m是要传送到的t点

                   第二行：每个点能传送到离这个点多远的距离

      输出：如果能到m，输出YES，否则NO

【思路】

      直接模拟就行了，30000个点根本不用考虑超时的问题，第i个点必须要传送到第i+a[i]个点处酱紫。

【代码】

#include<cstdio>

int a[30005];

int main()
{
	int n,m;
	while(scanf("%d%d",&n,&m)!=EOF)
	{
		int x=1;
		for(int i=1;i<n;i++)
			scanf("%d",a+i);
		while(x<m)
			x=x+a[x];
		if(x==m)
			printf("YES\n");
		else
			printf("NO\n");
	}
}