[SHOI 2013] 发微博

#include<bits/stdc++.h>
using namespace std;
#define MAXN 500010

int n , m;
int cnt[MAXN] , ans[MAXN];
set< int > S[MAXN];

int main()
{
    
    scanf("%d%d" , &n , &m);
    for (int i = 1; i <= m; i++)
    {
        char op[5];
        scanf("%s" , &op);
        if (op[0] == ‘!‘)
        {
            int x;
            scanf("%d" , &x);
            cnt[x]++;    
        } else if (op[0] == ‘+‘)
        {
            int x , y;
            scanf("%d%d" , &x , &y);
            S[x].insert(y);
            S[y].insert(x);
            ans[x] -= cnt[y];
            ans[y] -= cnt[x];
        } else
        {
            int x , y;
            scanf("%d%d" , &x , &y);
            ans[x] += cnt[y];
            ans[y] += cnt[x];
            S[x].erase(S[x].find(y));
            S[y].erase(S[y].find(x));
        }
    }
    for (int i = 1; i <= n; i++)
    {
        for (set< int > :: iterator it = S[i].begin(); it != S[i].end(); it++)
            ans[i] += cnt[*it];
    }
    for (int i = 1; i < n; i++) printf("%d " , ans[i]);
    printf("%d\n" , ans[n]);
    
    return 0;
}