305442: CF1032C. Playing Piano

Memory Limit:256 MB Time Limit:1 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Playing Piano

题意翻译

给定长为 $n$ 的序列 $a$,要求给定长为 $n$ 的序列 $b$ 满足: - $1\le b_i\le 5$ - 如果 $a_i<a_{i+1}$,则 $b_i<b_{i+1}$; - 如果 $a_i>a_{i+1}$,则 $b_i>b_{i+1}$; - 如果 $a_i=a_{i+1}$,则 $b_i\ne b_{i+1}$。 给出一个 $b$,或说明不存在,输出 $-1$。

题目描述

Little Paul wants to learn how to play piano. He already has a melody he wants to start with. For simplicity he represented this melody as a sequence $ a_1, a_2, \ldots, a_n $ of key numbers: the more a number is, the closer it is to the right end of the piano keyboard. Paul is very clever and knows that the essential thing is to properly assign fingers to notes he's going to play. If he chooses an inconvenient fingering, he will then waste a lot of time trying to learn how to play the melody by these fingers and he will probably not succeed. Let's denote the fingers of hand by numbers from $ 1 $ to $ 5 $ . We call a fingering any sequence $ b_1, \ldots, b_n $ of fingers numbers. A fingering is convenient if for all $ 1\leq i \leq n - 1 $ the following holds: - if $ a_i < a_{i+1} $ then $ b_i < b_{i+1} $ , because otherwise Paul needs to take his hand off the keyboard to play the $ (i+1) $ -st note; - if $ a_i > a_{i+1} $ then $ b_i > b_{i+1} $ , because of the same; - if $ a_i = a_{i+1} $ then $ b_i\neq b_{i+1} $ , because using the same finger twice in a row is dumb. Please note that there is $ \neq $ , not $ = $ between $ b_i $ and $ b_{i+1} $ . Please provide any convenient fingering or find out that there is none.

输入输出格式

输入格式


The first line contains a single integer $ n $ ( $ 1 \le n \le 10^5 $ ) denoting the number of notes. The second line contains $ n $ integers $ a_1, a_2, \ldots, a_n $ ( $ 1 \le a_i \le 2\cdot10^5 $ ) denoting the positions of notes on the keyboard.

输出格式


If there is no convenient fingering, print $ -1 $ . Otherwise, print $ n $ numbers $ b_1, b_2, \ldots, b_n $ , each from $ 1 $ to $ 5 $ , denoting a convenient fingering, separated by spaces.

输入输出样例

输入样例 #1

5
1 1 4 2 2

输出样例 #1

1 4 5 4 5 

输入样例 #2

7
1 5 7 8 10 3 1

输出样例 #2

1 2 3 4 5 4 3 

输入样例 #3

19
3 3 7 9 8 8 8 8 7 7 7 7 5 3 3 3 3 8 8

输出样例 #3

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

说明

The third sample test is kinda "Non stop" song by Reflex.

Input

题意翻译

给定长为 $n$ 的序列 $a$,要求给定长为 $n$ 的序列 $b$ 满足: - $1\le b_i\le 5$ - 如果 $a_i<a_{i+1}$,则 $b_i<b_{i+1}$; - 如果 $a_i>a_{i+1}$,则 $b_i>b_{i+1}$; - 如果 $a_i=a_{i+1}$,则 $b_i\ne b_{i+1}$。 给出一个 $b$,或说明不存在,输出 $-1$。

加入题单

上一题 下一题 算法标签: