Submission #62280428

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <iostream>
#include <algorithm>
#include <unordered_map>
using namespace std;
const int N=1e6+10;
int a[N];
unordered_map <int,int> s;
int main()
{
    int n,q;
    cin>>n>>q;
    int cnt=0;
    for(int i=1;i<=n;i++)   
    {
        a[i]=1;
        s[i]=i;
    }
    while(q--)
    {
        int x;
        cin>>x;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <iostream>
#include <algorithm>
#include <unordered_map>
using namespace std;
const int N=1e6+10;
int a[N];
unordered_map <int,int> s;
int main()
{
    int n,q;
    cin>>n>>q;
    int cnt=0;
    for(int i=1;i<=n;i++)   
    {
        a[i]=1;
        s[i]=i;
    }
    while(q--)
    {
        int x;
        cin>>x;
        if(x==1)
        {
            int p,h;
            cin>>p>>h;
            if(a[s[p]]==2)  cnt--;
            a[s[p]]--;
            if(a[h]==1)   cnt++;
            a[h]++;
            s[p]=h;
        }
        else
        {
            cout<<cnt<<endl;
        }
    }
}

Submission Info

Judge Result