982B Bus of Characters

B. Bus of Characters

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

In the Bus of Characters there are $n$ rows of seat, each having $2$ seats. The width of both seats in the $i$-th row is $w_i$ centimeters. All integers $w_i$ are distinct.

Initially the bus is empty. On each of $2n$ stops one passenger enters the bus. There are two types of passengers:

• an introvert always chooses a row where both seats are empty. Among these rows he chooses the one with the smallest seats width and takes one of the seats in it;
• an extrovert always chooses a row where exactly one seat is occupied (by an introvert). Among these rows he chooses the one with the largest seats width and takes the vacant place in it.

You are given the seats width in each row and the order the passengers enter the bus. Determine which row each passenger will take.

Input

The first line contains a single integer $n$ ($1\le n\le 200000$) — the number of rows in the bus.

The second line contains the sequence of integers $w_1,w_2,\dots ,w_n$ ($1\le w_i\le {10}^9$), where $w_i$ is the width of each of the seats in the $i$-th row. It is guaranteed that all $w_i$ are distinct.

The third line contains a string of length $2n$, consisting of digits '0' and '1' — the description of the order the passengers enter the bus. If the $j$-th character is '0', then the passenger that enters the bus on the $j$-th stop is an introvert. If the $j$-th character is '1', the the passenger that enters the bus on the $j$-th stop is an extrovert. It is guaranteed that the number of extroverts equals the number of introverts (i. e. both numbers equal $n$), and for each extrovert there always is a suitable row.

Output

Print $2n$ integers — the rows the passengers will take. The order of passengers should be the same as in input.

Examples

input

Copy

2
3 1
0011

output

Copy

2 1 1 2 

input

Copy

6
10 8 9 11 13 5
010010011101

output

Copy

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

Note

In the first example the first passenger (introvert) chooses the row $2$, because it has the seats with smallest width. The second passenger (introvert) chooses the row $1$, because it is the only empty row now. The third passenger (extrovert) chooses the row $1$, because it has exactly one occupied seat and the seat width is the largest among such rows. The fourth passenger (extrovert) chooses the row $2$, because it is the only row with an empty place.

题意：在一个汽车上，有n排座位，每排座位有；两个座位，然后2n个车站，每个车站上来一个乘客，0表示内向乘客，1表示外向乘客， 让你们给他们排座位。排座位的要求是：

• 内向的人总是选择两个座位都是空的一排。在这些行中，他选择了一个座位宽度最小的，并占了其中的一个座位；
• 外向的人总是选择一排座位，而这个位置正好是一个内向的人所占的座位。在这几排中，他选择了座位宽度最大的一排，并在其中占据了空位。

输入n排，然后输入每排座位的宽度。然后输入2n个乘客的是内向还是外向的，给你每一行的座位宽度和乘客进入公共汽车的顺序。决定每一位乘客将坐哪一排。

题解：贪心      最开始自己写是写炸了的，用了标记，但是座位宽度太大，数组越界。参考网上博客的思路是开栈和队列做的，思路很不错。开结构体里面存每排座位宽度和当座位的排号。按照宽度从小到大排序，遇见0就是存入队列（先进先出），然后在把这个座位的排号存入栈（先进后出），遇见1就出栈，存入队列。最后输出队列，不过CF大佬们都是用的pair这种更简单的方法。还不会用，把两个数据合成一个，然后排序，也用了栈。

栈+队列+结构体：

#include<bits/stdc++.h>
using namespace std;
stack<int>st;
queue<int> q;
struct node
{
    int w,num;
} s[200100];
bool cmp(node a,node b)
{
    return a.w<b.w;
}
int main()
{
    int n;
    string a;
    cin>>n;
    for(int i=1; i<=n; i++)
        cin>>s[i].w,s[i].num=i;///输入座位宽度,也把座位第几行存入进去
    sort(s+1,s+1+n,cmp);///对输入的宽度从小到大排序
    cin>>a;
    int x=1;
    for(int i=0; i<a.size(); i++)
    {
        if(a[i]=='0')
            q.push(s[x].num),st.push(s[x++].num);
        else
        {
            int b=st.top();
            st.pop();
            q.push(b);
        }
    }
    while(!q.empty())
        cout<<q.front()<<" ",q.pop();
    return 0;
}

pair+栈：

#include <bits/stdc++.h>
using namespace std;

int w[200005];
char inp[400005];
pair<int,int> a[200005];
stack<int> s;
int main(){
	int n,i,j,k;
	cin >> n;
	for(i=0;i<n;i++){
		scanf(" %d",w+i);
		a[i]=make_pair(w[i],i+1);
	}
	sort(a,a+n);
	k=0;
	scanf(" %s",inp);
	for(i=0;i<n+n;i++){
		j = inp[i]-'0';
		if(j==0){
			printf("%d ",a[k].second);
			s.push(a[k].second);
			k++;
		}
		else{
			printf("%d ",s.top());
			s.pop();
		}
	}

}