codeforces
来源:互联网 发布:淘宝卖家如何提前收款 编辑:程序博客网 时间:2024/06/05 07:24
A. New Year Transportation
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 - 1positive integers a1, a2, ..., an - 1. For every integer i where 1 ≤ i ≤ n - 1 the condition 1 ≤ ai ≤ n - i holds. Next, he made n - 1portals, numbered by integers from 1 to n - 1. The i-th (1 ≤ i ≤ n - 1) portal connects cell i and cell (i + ai), and one can travel from cell i to cell (i + ai) using the i-th portal. Unfortunately, one cannot use the portal backwards, which means one cannot move from cell(i + ai) to cell i using the i-th portal. It is easy to see that because of condition 1 ≤ ai ≤ 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.
The first line contains two space-separated integers n (3 ≤ n ≤ 3 × 104) 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 a1, a2, ..., an - 1 (1 ≤ ai ≤ n - i). It is guaranteed, that using the given transportation system, one cannot leave the Line World.
If I can go to cell t using the transportation system, print "YES". Otherwise, print "NO".
8 41 2 1 2 1 2 1
YES
8 51 2 1 2 1 1 1
NO
import java.util.Scanner; public class Main { @SuppressWarnings("resource")public static void main(String[] args) {Scanner sc = new Scanner(System.in);while (sc.hasNext()) {int n = sc.nextInt();int m = sc.nextInt();int arr[] = new int[n ];for (int i = 1; i < arr.length; i++) {arr[i] = sc.nextInt(); }arr[0]=1;int mix = 0;for (int i = 0; i < arr.length; i=mix) {if(mix>arr.length-1){break;}if(arr[mix]==0){break;}mix=arr[i]+mix;if(mix==m){mix=Integer.MAX_VALUE;break;}}if (mix != Integer.MAX_VALUE) {System.out.println("NO");} else {System.out.println("YES");} }} }
- codeforces~~~
- Codeforces
- codeforces
- Codeforces
- codeforces
- codeforces
- Codeforces
- Codeforces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- html小例子
- 目标检测RON网络安装运行记录
- 使用netty和messagepack编写网络请求
- HDU6127Hardchallenge(优美的暴力)
- 【工具巧用】用killall -STOP保留多进程运行环境现场
- codeforces
- 15分钟了解Apache Phoenix(HBase的开源SQL引擎)
- 当 TiDB 遇上 Jepsen
- 中国美术史-蒋勋有声书
- C++中STL的介绍和vector容器的介绍
- 0816memo
- 企业的IT架构
- HDU 1421 搬寝室
- Integer == 和equals的区别