3101 - Non-boring Sequences 3101 - Non-boring Sequences 3101 - Non-boring Sequences

Statistics Sub: 40 | AC: 14 | AC%: 35,00 | Score: 3,85
Created by 2012 Central Europe Regional Contest
Added by jcfernandez (2015-01-30)
Limits
Total Time: 20000 MS | Test Time: 6000 MS |Memory: 256 MB | Output: 64 MB | Size: 16 KB
Enabled languages
Available in

Description

We were afraid of making this problem statement too boring, so we decided to keep it short. A sequence is called non-boring if its every connected sub-sequence contains a unique element, i.e. an element such that no other element of that sub-sequence has the same value. Given a sequence of integers, decide whether it is non-boring.
We were afraid of making this problem statement too boring, so we decided to keep it short. A sequence is called non-boring if its every connected sub-sequence contains a unique element, i.e. an element such that no other element of that sub-sequence has the same value. Given a sequence of integers, decide whether it is non-boring.
We were afraid of making this problem statement too boring, so we decided to keep it short. A sequence is called non-boring if its every connected sub-sequence contains a unique element, i.e. an element such that no other element of that sub-sequence has the same value. Given a sequence of integers, decide whether it is non-boring.

Input specification

The first line of the input contains the number of test cases T . The descriptions of the test cases follow: Each test case starts with an integer n (1 <= n <= 200000) denoting the length of the sequence. In the next line the n elements of the sequence follow, separated with single spaces. The elements are non-negative integers less than 10^9.
The first line of the input contains the number of test cases T . The descriptions of the test cases follow: Each test case starts with an integer n (1 <= n <= 200000) denoting the length of the sequence. In the next line the n elements of the sequence follow, separated with single spaces. The elements are non-negative integers less than 10^9.
The first line of the input contains the number of test cases T . The descriptions of the test cases follow: Each test case starts with an integer n (1 <= n <= 200000) denoting the length of the sequence. In the next line the n elements of the sequence follow, separated with single spaces. The elements are non-negative integers less than 10^9.

Output specification

Print the answers to the test cases in the order in which they appear in the input. For each test case print a single line containing the word non-boring or boring.
Print the answers to the test cases in the order in which they appear in the input. For each test case print a single line containing the word non-boring or boring.
The first line of the input contains the number of test cases T . The descriptions of the test cases follow: Each test case starts with an integer n (1 <= n <= 200000) denoting the length of the sequence. In the next line the n elements of the sequence follow, separated with single spaces. The elements are non-negative integers less than 10^9.

Sample input

4
5
1 2 3 4 5
5
1 1 1 1 1
5
1 2 3 2 1
5
1 1 2 1 1

Sample output

non-boring
boring
non-boring
boring

Hint(s)

http://coj.uci.cu/24h/
http://coj.uci.cu/24h/
http://coj.uci.cu/24h/

Recommendation

We have carefully selected several similar problems: 3378 | 3376 | 1873 | 2441 | 3573 | 3599