#双栈初始化##判断栈空，栈满，进栈和出栈

#include<algorithm>
#include<cstdio>
#include<string>
#include<vector>
#include<string.h>
#include<map>
#include<cmath>
#include<set>
#define ll long long
#define maxn 1000001
#define INF 0x7fffffff
#define MAX 0x3f3f3f3f
#define ull unsigned long long
using namespace std;

template<class SElemType>
struct DblStack
{
    int top[2],bot[2];
    SElemType *V;
    int m;
};
DblStack S;
void Init(DblStack &s,int m){
    s.m=m;
	s.V=new int[m];
	s.bot[0]=-1;
	s.bot[1]=m;
	s.top[0]=-1;
	s.top[1]=m;
}
int IsEmpty(DblStack s,int i)
{
    if(s.top[i]==s.bot[i])
        return 1;
    else return 0;
}
int IsFull(DblStack s)
{
    if(s.top[0]+1==s.top[1])
        return 1;
    else return 0;
}
void Dblpush(DblStack &s,SElemType x,int i)
{
    int flag=0;
	if(i<0||i>1)
		cout<<"栈号不合理"<<endl,return;
	if(i==0){
			if(IsFull(DblStack s)){
				cout<<"栈已满"<<endl;
				flag=1;
				}
			else
				s.V[++s.top[0]]=x;
			if(flag==1) return;
		}
	else{
			if(IsFull(DblStack s)){
				cout<<"栈已满"<<endl;
				flag=1;
				}
			else
				s.V[--s.top[1]]=x;
			if(flag==1)	break;
		}
}
int Dblpop(DblStack &s,int i,SElemType x)
{
		if(IsEmpty(DblStack s,int i))
			{
			    cout<<"该栈已空"<<endl;
			    return 0;
            }
		if(i==0)
            x=s.V[s.top[0]--];
		else
			x=s.V[s.top[1]++];
        return x;
}