题目描述
Thor is getting used to the Earth. As a gift Loki gave him a smartphone. There are nn 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).
qq events are about to happen (in chronological order). They are of three types:
- Application xx generates a notification (this new notification is unread).
- Thor reads all notifications generated so far by application xx (he may re-read some notifications).
- Thor reads the first tt notifications generated by phone applications (notifications generated in first tt events of the first type). It's guaranteed that there were at least tt events of the first type before this event. Please note that he doesn't read first tt unread notifications, he just reads the very first tt 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 nn and qq ( 1<=n,q<=300000 ) --- the number of applications and the number of events to happen.
The next qq lines contain the events. The ii -th of these lines starts with an integer type_{i}typei --- type of the ii -th event. If type_{i}=1typei=1 or type_{i}=2typei=2 then it is followed by an integer x_{i}xi . Otherwise it is followed by an integer t_{i}ti ( 1<=type_{i}<=3,1<=x_{i}<=n,1<=t_{i}<=q1<=typei<=3,1<=xi<=n,1<=ti<=q ).
输出格式
Print the number of unread notifications after each event.
题意翻译
（可能无关紧要的地方有点漏洞，但不会影响题意） 【题目描述】
雷神常常要去地球，所以洛基给她一款智能手机作为礼物。手机上安装了n款应用，每款应用都会跳出很多消息，在每一单位时间，会发生以下3种事件之一：
-
- 第x个应用跳出了一条消息
-
- 雷神读了第x个应用跳出的所有消息
-
- 雷神读了所有应用跳出的前x条消息
雷神很不喜欢手机上有一堆"99+"，所以她希望知道，每一分钟后有多少条新消息未读。
【输入格式】
第一行2个整数n,q表示应用的数目和事件总数
接下来有q行，每行2个整数i,x表示发生事件i(i=1,2,3即与题目描述中的序号对应）和事件中的x
【输出格式】
共q行，每行一个整数表示每个事件发生后有多少未读消息
【输入样例1】
3 4
1 3
1 1
1 2
2 3【输出样例1】
1
2
3
2【输入样例2】
4 6
1 2
1 4
1 2
3 3
1 3
1 3【输出样例2】
1
2
3
0
1
2【数据范围】 对于100%的数据，满足1<=n,q<=300000，且保证每个事件合法。
输入输出样例
输入 #1复制
3 4
1 3
1 1
1 2
2 3输出 #1复制
1
2
3
2输入 #2复制
4 6
1 2
1 4
1 2
3 3
1 3
1 3输出 #2复制
1
2
3
0
1
2说明/提示
In the first sample:
- Application 33 generates a notification (there is 11 unread notification).
- Application 11 generates a notification (there are 22 unread notifications).
- Application 22 generates a notification (there are 33 unread notifications).
- Thor reads the notification generated by application 33 , there are 22 unread notifications left.
In the second sample test:
-
Application 22 generates a notification (there is 11 unread notification).
-
Application 44 generates a notification (there are 22 unread notifications).
-
Application 22 generates a notification (there are 33 unread notifications).
-
Thor reads first three notifications and since there are only three of them so far, there will be no unread notification left.
-
Application 33 generates a notification (there is 11 unread notification).
-
Application 33 generates a notification (there are 22 unread notifications).
#include
#include
#include
#include
using namespace std;
typedef long long ll;
const int N = 3e5 + 10;
queueque[N]; //队列数组，存储每个app的信息
queue<pair<int, int>> t;
ll v[N]; //判定某条信息是否被读过
ll n, q;
ll cnt = 1; //信息序号从1开始计算
ll sum = 0;//总信息量
int main()
{
scanf_s("%lld%lld", &n, &q);
for (ll i = 1; i <= q; i++)
{
ll a, b; scanf_s("%lld%lld", &a, &b);
if (a == 1)
{
sum++; //未读信息总数加一
que[b].push(cnt); //b号app存储的是第几条信息
t.push({ cnt,b });//存储第cnt条信息的是b号app
cnt++; //未读信息序号自增
}if (a == 2) { while (que[b].size()) //当b号app的信息未读完时 { v[que[b].front()] = 1; //标为已读 que[b].pop(); //删除已读的信息，只存未读信息 sum--; //总信息量减一 } } if (a == 3) { //这里有个坑，读的所有应用的前x条信息可能包含在2时读过的，要特殊处理 while (t.size() && t.front().first <= b) { if (!v[t.front().first]) //检查该信息是否被读过 { v[t.front().first] = 1; que[t.front().second].pop(); sum--; } t.pop(); } } cout << sum << endl; } return 0;}