题解 | 锁

#include <iostream>
#include<vector>
using namespace std;

int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int T;
cin>>T;
while(T--){
int m,n,x,y;
int p;
cin>>n>>m>>x>>y;
int ans1=x;
int ans2=n-y+1;
vector<bool>lock(n+1,false);
while(m--){
cin>>p;
if(p<=x){
if(lock[p]==0) ans1--;
else ans1++;
}
if(p>=y){
   if(lock[p]==0) ans2--;
   else ans2++; 
}
lock[p]=!lock[p];
cout<<ans1<<" "<<ans2<<endl;
}
}
return 0;
}