Result: Accepted
Time: 3ms
Memory: 1120kB
#include<stdio.h>
#include<string.h>
int main()
{
int n,m;
int x;
int i,j;
char a[20];
int b[20];
scanf("%d %d",&n,&m);
for(i=0;i<20;i++)
{
b[i]=-1;
}
while(m--)
{
scanf("%s",a);
int sum=0;
if(a[4]=='L')
{
getchar();
scanf("%d",&x);
for(i=0;i<n;i++)
{
if(b[i]==-1)
{
for(j=0;j<i;j++)
{
b[j+1]=b[j];
}
b[0]=x;
printf("Pushed in left: %d\n",x);
break;
}
else
{
sum++;
}
}
if(sum==n)
{
printf("The queue is full\n");
}
}
else if(a[4]=='R')
{
scanf("%d",&x);
for(i=n-1;i>=0;i--)
{
if(b[i]==-1)
{
for(j=n-1;j>i;j--)
{
b[j-1]=b[j];
}
b[n-1]=x;
printf("Pushed in right: %d\n",x);
break;
}
else
{
sum++;
}
}
if(sum==n)
{
printf("The queue is full\n");
}
}
else if(a[3]=='L')
{
for(i=0;i<n;i++)
{
if(b[i]!=-1)
{
printf("Popped from left: %d\n",b[i]);
b[i]=-1;
break;
}
else
{
sum++;
}
}
if(sum==n)
{
printf("The queue is empty\n");
}
}
else if(a[3]=='R')
{
for(i=n-1;i>=0;i--)
{
if(b[i]!=-1)
{
printf("Popped from right: %d\n",b[i]);
b[i]=-1;
break;
}
else
{
sum++;
}
}
if(sum==n)
{
printf("The queue is empty\n");
}
}
}
}