Each month Blake gets the report containing main economic indicators of the company "Blake Technologies". There are n commodities produced by the company. For each of them there is exactly one integer in the final report, that denotes corresponding revenue. Before the report gets to Blake, it passes through the hands of m managers. Each of them may reorder the elements in some order. Namely, the i-th manager either sorts first ri numbers in non-descending or non-ascending order and then passes the report to the manager i + 1, or directly to Blake (if this manager has number i = m).
Employees of the "Blake Technologies" are preparing the report right now. You know the initial sequence ai of length n and the description of each manager, that is value ri and his favourite order. You are asked to speed up the process and determine how the final report will look like.
The first line of the input contains two integers n and m (1 ≤ n, m ≤ 200 000) — the number of commodities in the report and the number of managers, respectively.
The second line contains n integers ai (|ai| ≤ 109) — the initial report before it gets to the first manager.
Then follow m lines with the descriptions of the operations managers are going to perform. The i-th of these lines contains two integers ti and ri (, 1 ≤ ri ≤ n), meaning that the i-th manager sorts the first ri numbers either in the non-descending (if ti = 1) or non-ascending (if ti = 2) order.
Print n integers — the final report, which will be passed to Blake by manager number m.
3 1 1 2 3 2 2
2 1 3
4 2 1 2 4 3 2 3 1 2
2 4 1 3
In the first sample, the initial report looked like: 1 2 3. After the first manager the first two numbers were transposed: 2 1 3. The report got to Blake in this form.
In the second sample the original report was like this: 1 2 4 3. After the first manager the report changed to: 4 2 1 3. After the second manager the report changed to: 2 4 1 3. This report was handed over to Blake.
思路:一开始觉得可以用线段树来保存每次最后的状态值,最后进行排序,然而复杂度并没有降下来;
排序果然还是够蛋疼。每次夜深人静一想到排序我就想睡觉……
题目其实只要保存下时间戳,时间戳小的并不会影响到时间戳大的,所以只要排一次序就行了;
代码:
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
int a[200005];
int time[200005];
int flag[200005];
int ans [200005];
int main()
{
int n,m;
while(scanf("%d%d",&n,&m)!=EOF)
{
memset(flag,0,sizeof(flag));
memset(time,0,sizeof(time));
vector<int>data;
int i,j;
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
for(i=1;i<=m;i++)
{
int f1,f2;
scanf("%d%d",&f1,&f2);
time[f2]=i;
flag[f2]=f1;
}
int st=n+1;
for(i=n;i>=1;i--)
{
st=i;
if( !flag[st])
ans[i]=a[i];
else
break;
}
sort(a+1,a+1+st);
int mintime=time[st];
int nowflag=flag[st];
int wtf1=1,wtf2=st;
for(i=st;i>=1;i--)
{
if(flag[i]&&time[i]>mintime)
{
mintime=time[i];
nowflag=flag[i];
}
if(nowflag==1)
{
ans[i]=a[wtf2];
wtf2--;
}
else
{
ans[i]=a[wtf1];
wtf1++;
}
}
for(i=1;i<n;i++)
printf("%d ",ans[i]);
printf("%d\n",ans[n]);
}
return 0;
}