Start: Jul, 10, 2019 08:30:00
2019年度暑期短学期达标测试补考
End: Jul, 10, 2019 11:30:00
Time elapsed:
Time remaining:

Problem_ID: I
Result: Accepted
Time: 4ms
Memory: 1120kB
Author: 2018212212275
In contest: 1284

#include <stdio.h>

int main()
{
	int n, m;
	scanf("%d %d", &n, &m);
	getchar();
	int s[15]; 
	int i, j, p;
	int kk = 0;
	char x[15];
	for(i=0; i<m; i++){
		scanf("%s", x);
		getchar();
		if(x[2]=='s'){
			if (kk==0){
				scanf("%d", &s[0]);
				getchar();
				if(x[4]=='L')
				printf("Pushed in left: %d\n", s[0]);
				else if(x[4]=='R')
				printf("Pushed in right: %d\n", s[0]);
			}
			else if(kk<n){
				if(x[4]=='L'){
					for(j=kk; j>0; j--){
						s[j] = s[j-1];
						
					}scanf("%d", &s[0]);
					getchar();
					printf("Pushed in left: %d\n", s[0]);
				}else if(x[4]=='R'){
					scanf("%d", &s[kk]);
					getchar();
					printf("Pushed in right: %d\n", s[kk]);
				}
				
			}
			else if(kk==n){
				scanf("%d", &s[11]);
				printf("The queue is full\n");
			}
			if(kk<n)
			kk++;
		}
		else if(x[2]=='p'){
			if (kk==0){
				printf("The queue is empty\n");
			}else if(kk>0){
				if(x[3]=='L'){
					printf("Popped from left: %d\n", s[0]);
					for(p=0; p<kk; p++){
						s[p] = s[p+1];
					}
				}else if(x[3]=='R'){
					printf("Popped from right: %d\n", s[kk-1]);
				}
			}
			if(kk>0)
			kk--;
		}
	}
    return 0;
}