OI-Codes/atcoder/abc391/C_Pigeonhole_Query.cpp
Frederick Chen ebb7f9ba04 AtCoder Beginner Contest 391
https://atcoder.jp/contests/abc391

Signed-off-by: Frederick Chen <seventeen@ohdragonboi.cn>
2025-04-19 10:09:51 +08:00

32 lines
584 B
C++

#include <iostream>
#include <vector>
using namespace std;
int n, q, mp[10005], g[10005], cnt = 0, a, b, c;
int main()
{
cin >> n >> q;
for (int i = 0; i <= n; i++)
{
mp[i] = 1;
g[i] = i;
}
while (q--)
{
cin >> a;
if (a == 1)
{
cin >> b >> c;
if (mp[g[b]] == 2)
cnt--;
if (mp[c] == 1)
cnt++;
mp[g[b]]--;
mp[c]++;
g[b] = c;
}
else if (a == 2)
cout << cnt << endl;
return 0;
}