WA 0,求条
查看原帖
WA 0,求条
1373205
dg114514楼主2024/12/7 23:12
#include<bits/stdc++.h>
using namespace std;
stack<int>a1;
queue<int>a2;
priority_queue<int>a3;
priority_queue<int,vector<int>,greater<int>>a4;
int f1=1,f2=1,f3=1,f4=1;
int main(){
	int q,x,op;
	cin>>q;
	while(q--){
		cin>>op>>x;
		if(op==1)a1.push(x),a2.push(x),a3.push(x),a4.push(x);
		else{
			if(a1.top()!=x||a1.empty())f1=false;
			else a1.pop();
			if(a2.front()!=x||a2.empty())f2=false;
			else a2.pop();
			if(a3.top()!=x||a3.empty())f3=false;
			else a3.pop();
			if(a4.top()!=x||a4.empty())f2=false;
			else a4.pop();
		}
	}
	puts(f2?"Yes":"No");
	puts(f1?"Yes":"No");
	puts(f3?"Yes":"No");
	puts(f4?"Yes":"No");
	return 0;
}
2024/12/7 23:12
加载中...