CF1146E.Hot is Cold

普及/提高-

通过率:0%

AC君温馨提醒

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

题目描述

You are given an array of nn integers a1,a2,,ana_1, a_2, \ldots, a_n .

You will perform qq operations. In the ii -th operation, you have a symbol sis_i which is either "<" or ">" and a number xix_i .

You make a new array bb such that bj=ajb_j = -a_j if ajsixia_j s_i x_i and bj=ajb_j = a_j otherwise (i.e. if sis_i is '>', then all aj>xia_j > x_i will be flipped). After doing all these replacements, aa is set to be bb .

You want to know what your final array looks like after all operations.

输入格式

The first line contains two integers n,qn,q ( 1n,q1051 \leq n,q \leq 10^5 ) — the number of integers and the number of queries.

The next line contains nn integers a1,a2,,ana_1, a_2, \ldots, a_n ( 105ai105-10^5 \leq a_i \leq 10^5 ) — the numbers.

Each of the next qq lines contains a character and an integer si,xis_i, x_i . ( s_i \in \{<, >\}, -10^5 \leq x_i \leq 10^5 ) – the queries.

输出格式

Print nn integers c1,c2,,cnc_1, c_2, \ldots, c_n representing the array after all operations.

输入输出样例

  • 输入#1

    11 3
    -5 -4 -3 -2 -1 0 1 2 3 4 5
    > 2
    > -4
    < 5

    输出#1

    5 4 -3 -2 -1 0 1 2 -3 4 5
    
  • 输入#2

    5 5
    0 1 -2 -1 2
    < -2
    < -1
    < 0
    < 1
    < 2

    输出#2

    0 -1 2 -1 2
    

说明/提示

In the first example, the array goes through the following changes:

  • Initial: [5,4,3,2,1,0,1,2,3,4,5][-5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5]
  • >2> 2 : [5,4,3,2,1,0,1,2,3,4,5][-5, -4, -3, -2, -1, 0, 1, 2, -3, -4, -5]
  • >4> -4 : [5,4,3,2,1,0,1,2,3,4,5][-5, -4, 3, 2, 1, 0, -1, -2, 3, -4, -5]
  • <5< 5 : [5,4,3,2,1,0,1,2,3,4,5][5, 4, -3, -2, -1, 0, 1, 2, -3, 4, 5]
首页