【CodeForces - 705C】Thor（模拟，STLset优化链表）

题干：

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.

Input

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 = 2 then it is followed by an integer xi. Otherwise it is followed by an integer ti (1 ≤ typei ≤ 3, 1 ≤ xi ≤ n, 1 ≤ ti ≤ q).

Output

Print the number of unread notifications after each event.

Examples

Input

Output

Input

Output

Note

In the first sample:

Application 3 generates a notification (there is 1 unread notification).
Application 1 generates a notification (there are 2 unread notifications).
Application 2 generates a notification (there are 3 unread notifications).
Thor reads the notification generated by application 3, there are 2 unread notifications left.

In the second sample test:

Application 2 generates a notification (there is 1 unread notification).
Application 4 generates a notification (there are 2 unread notifications).
Application 2 generates a notification (there are 3 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 3 generates a notification (there is 1 unread notification).
Application 3 generates a notification (there are 2 unread notifications).

题目大意：

第一行两个整数n，m，代表n个软件，m次操作。(1 ≤ n, q ≤ 300 000)

接下来m行：
1 x :软件 x 产生了一条未读信息。
2 x: 软件 x 的所有信息都被读了。
3 t: 前 t 条产生的信息都被读了。注意是前t条，不是未读的前t条，已读的也算在t条中。

解题报告：

本来想用个双向链表来啊维护出现过的所有信息，但是发现它可以支持快速的删除一个元素，但是对于查找前t条信息比较鸡肋，甚至还要拿个并查集去搞，比较麻烦，于是换了各项性能都还说的过去的set，直接二分找前t条信息就可以了，这样最后的答案就是set的大小。

注意不能让标号直接等于i，因为第i个操作不一定是产生一天新的信息。

AC代码：

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<queue>
#include<stack>
#include<map>
#include<vector>
#include<set>
#include<string>
#include<cmath>
#include<cstring>
#define FF first
#define SS second
#define ll long long
#define pb push_back
#define pm make_pair
using namespace std;
typedef pair<int,int> PII;
const int MAX = 5e5 + 5;
int n,m,last,id;
set<int> ss[MAX],q;//存链表，因为值直接就是索引就可以了，不需要单独弄链表了int main()
{cin>>n>>m;for(int op,x,i = 1; i<=m; i++) {scanf("%d%d",&op,&x);if(op == 1) {id++;ss[x].insert(id);q.insert(id);}if(op == 2) {for(auto idx : ss[x]) {if(q.find(idx) != q.end())q.erase(idx);}ss[x].clear();}if(op == 3) {auto upp = q.upper_bound(x),down = q.begin();q.erase(down,upp);last = max(last,x);}printf("%d\n",q.size());}return 0 ;
}

【CodeForces - 705C】Thor（模拟，STLset优化链表）相关推荐

Codeforces 786B Legacy (线段树优化建图)
Codeforces 786B Legacy (线段树优化建图) 题意:\(n\)个点,有\(3\)种连边操作:1.将\(u\)指向\(v\):2.将\(v\)指向编号在区间\([l,r]\)的点:3 ...
Promodel®模拟和优化套装加速企业绩效改善功能介绍
采用Promodel®模拟和优化套装加速企业绩效改善,消除风险! Promodel®仿真模拟和优化套装是业内先进的离散事件系统仿真软件,由ProModel公司于1996年开发.它可以构造多种生产.物流 ...
CodeForces - 1491E Fib-tree(模拟)
题目链接:点击查看题目大意:给出一棵树,问是否为斐波那契树.斐波那契树的定义是,树的大小为斐波那契数列的其中一项,且可以通过删除掉一条边使其拆分的两个子树也为斐波那契树题目分析:需要观察到,大小为 ...
R语言几何布朗运动 GBM模拟股票价格优化建立期权定价概率加权收益曲线可视化
最近我们被客户要求撰写关于几何布朗运动的研究报告,包括一些图形和统计输出. 对于模拟股票价格,几何布朗运动 (GBM) 是事实上的首选模型. 它有一些很好的属性,通常与股票价格一致,例如对数正态分 ...
Codeforces 1408 D. Searchlights（优化DP、思维）
整理的算法模板合集: ACM模板传送门 DP的思想,因为题目中有两个维度,数据达到了1e6,所以我们直接开二维数组显然不太恰当,而且我们的答案不好选取,我们可以使用一个技巧,开一维数组,用DP的下标 ...
codeforces 719C (复杂模拟-四舍五入-贪心)
题目链接:http://codeforces.com/problemset/problem/719/C 题目大意: 留坑... 转载于:https://www.cnblogs.com/A--Q/p/5 ...
模拟实现单链表（三级）
讲了顺序表的实现呢,下面我们来讲单链表每个节点包括两部分,哪两部分,一部分是存放数据的,另一部分是存放地址的,存放下一个节点的地址,这叫单链表,单链表也就是单向链表,有单向的就应该有双向的,双向表该怎 ...
Codeforces 67A【模拟】
题意: 给一个字符串代表相邻学生的比较,L代表左边多,R表示右边多,=表示左右相等. 保证每个人拿糖>=1,在分糖最少的情况下,输出每个学生所分得的糖. 思路: 模拟一下,第一个人一开始拿1个, ...
CodeForces - 786C——二分+模拟？
[题目描述] Rick and Morty want to find MR. PBH and they can't do it alone. So they need of Mr. Meeseeks. ...

【CodeForces - 705C】Thor（模拟，STLset优化链表）

【CodeForces - 705C】Thor（模拟，STLset优化链表）相关推荐

最新文章

热门文章