Thor is getting used to the Earth. As a gift Loki gave him a smartphone. There are n applications on this phone. Thor is fascinated by this phone. He has only one minor issue: he can't count the number of unread notifications generated by those applications (maybe Loki put a curse on it so he can't).
q events are about to happen (in chronological order). They are of three types:
- Application x generates a notification (this new notification is unread).
- Thor reads all notifications generated so far by application x (he may re-read some notifications).
- Thor reads the first t notifications generated by phone applications (notifications generated in first t events of the first type). It's guaranteed that there were at least t events of the first type before this event. Please note that he doesn't read first t unread notifications, he just reads the very first t notifications generated on his phone and he may re-read some of them in this operation.
Please help Thor and tell him the number of unread notifications after each event. You may assume that initially there are no notifications in the phone.
The first line of input contains two integers n and q (1 ≤ n, q ≤ 300 000) — the number of applications and the number of events to happen.
The next q lines contain the events. The i-th of these lines starts with an integer typei — type of the i-th event. If typei = 1 or typei = 2then it is followed by an integer xi. Otherwise it is followed by an integer ti (1 ≤ typei ≤ 3, 1 ≤ xi ≤ n, 1 ≤ ti ≤ q).
Print the number of unread notifications after each event.
3 4 1 3 1 1 1 2 2 3
1 2 3 2
4 6 1 2 1 4 1 2 3 3 1 3 1 3
1 2 3 0 1 2
#include<cstdio>
#include<queue>
using namespace std;
const int maxn = 300005;
int needread[maxn];
int readed[maxn];
int cnt[maxn];
int main()
{
int n,q,type,num,pop_cnt = 0;
queue<int> que;
scanf("%d %d", &n, &q);
int ans = 0;
while (q--)
{
scanf("%d %d", &type, &num);
if (type == 1)
{
ans++;
needread[num]++;
que.push(num);//产生新消息时候将消息入队
}
else if (type == 2)
{
ans -= needread[num] - readed[num];
readed[num] = needread[num];
}
else
{
int t = num - pop_cnt;//前(num-pop_cnt)个消息已经出队了,处理过了。
while (!que.empty() && t > 0)
{
t--;
int cur = que.front();
que.pop();
pop_cnt++;
cnt[cur]++;
if (cnt[cur] > readed[cur])//当处理到某个应用的消息数大于了这个应用已经处理的消息数后,接下来的消息就是未读的消息了,此时处理未读消息,更新记录。
{
ans -= cnt[cur] - readed[cur];
readed[cur] = cnt[cur];
}
}
}
printf("%d\n",ans);
}
return 0;
}