CF641A.Little Artem and Grasshopper

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

Little Artem found a grasshopper. He brought it to his house and constructed a jumping area for him.

The area looks like a strip of cells $1×n$ . Each cell contains the direction for the next jump and the length of that jump. Grasshopper starts in the first cell and follows the instructions written on the cells. Grasshopper stops immediately if it jumps out of the strip. Now Artem wants to find out if this will ever happen.

输入格式

The first line of the input contains a single integer $n$ ( $1<=n<=100000$ ) — length of the strip.

Next line contains a string of length $n$ which consists of characters "<" and ">" only, that provide the direction of the jump from the corresponding cell. Next line contains $n$ integers $d_{i}$ ( $1<=d_{i}<=10^{9}$ ) — the length of the jump from the $i$ -th cell.

输出格式

Print "INFINITE" (without quotes) if grasshopper will continue his jumps forever. Otherwise print "FINITE" (without quotes).

输入输出样例

输入#1
```
2
&gt;&lt;
1 2
```
输出#1
```
FINITE
```
输入#2
```
3
&gt;&gt;&lt;
2 1 1
```
输出#2
```
INFINITE
```

说明/提示

In the first sample grasshopper starts from the first cell and jumps to the right on the next cell. When he is in the second cell he needs to jump two cells left so he will jump out of the strip.

Second sample grasshopper path is $1$ - $3$ - $2$ - $3$ - $2$ - $3$ and so on. The path is infinite.

首页