codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

1203A.md (2307B)


      1 Source: https://codeforces.com/problemset/problem/1203/A
      2 
      3 A. Circle of Students
      4 
      5 time limit per test
      6 
      7 2 seconds
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 There are $n$ students standing in a circle in some order. The index of the $i$-th student is $p_i$. It is guaranteed that all indices of students are distinct integers from $1$ to $n$ (i. e. they form a permutation).
     22 
     23 Students want to start a round dance. A clockwise round dance can be started if the student $2$ comes right after the student $1$ in clockwise order (there are no students between them), the student $3$ comes right after the student $2$ in clockwise order, and so on, and the student $n$ comes right after the student $n - 1$ in clockwise order. A counterclockwise round dance is almost the same thing — the only difference is that the student $i$ should be right after the student $i - 1$ in counterclockwise order (this condition should be met for every $i$ from $2$ to $n$).
     24 
     25 For example, if the indices of students listed in clockwise order are $[2, 3, 4, 5, 1]$, then they can start a clockwise round dance. If the students have indices $[3, 2, 1, 4]$ in clockwise order, then they can start a counterclockwise round dance.
     26 
     27 Your task is to determine whether it is possible to start a round dance. Note that the students cannot change their positions before starting the dance; they cannot swap or leave the circle, and no other student can enter the circle.
     28 
     29 You have to answer $q$ independent queries.
     30 
     31 Input
     32 
     33 The first line of the input contains one integer $q$ ($1 \le q \le 200$) — the number of queries. Then $q$ queries follow.
     34 
     35 The first line of the query contains one integer $n$ ($1 \le n \le 200$) — the number of students.
     36 
     37 The second line of the query contains a permutation of indices $p_1, p_2, \dots, p_n$ ($1 \le p_i \le n$), where $p_i$ is the index of the $i$-th student (in clockwise order). It is guaranteed that all $p_i$ are distinct integers from $1$ to $n$ (i. e. they form a permutation).
     38 
     39 Output
     40 
     41 For each query, print the answer on it. If a round dance can be started with the given order of students, print "YES". Otherwise print "NO".
     42 
     43 Example
     44 
     45 Input
     46 
     47 ```
     48 5
     49 4
     50 1 2 3 4
     51 3
     52 1 3 2
     53 5
     54 1 2 3 5 4
     55 1
     56 1
     57 5
     58 3 2 1 5 4
     59 ```
     60 
     61 Output
     62 
     63 ```
     64 YES
     65 YES
     66 NO
     67 YES
     68 YES
     69 ```