Submission #51865674

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

typedef long long ll;
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>  ordered_set;
//member functions : order_of_key(k){no_of_ele < k} find_by_order(k){kth ele}

const ll M = 998244353;
const ll N = 2e5 + 69;
const ll lmax = 2e18;
const ll lmin = -2e18;
//  ... --- ... 
// --------------------------------------------------------------

// --------------------------------------------------------------

void solve()
{    
    ll n, q, curr = 0; cin >> n >> q;
    set<ll> s;
    vector<ll> a(n + 1, lmin);
    while(q--)
    {
        ll x; cin >> x;
        if(s.find(x) == s.end())
        {
            s.insert(x);
        }
        else
        {
            s.erase(x);
        }
        ll z = s.size();
        if(s.find(x) == s.end())
        {
            a[x] += curr;
        }
        else
        {
            if(a[x] == lmin)
                a[x] = -curr;
            else
            {
                a[x] -= curr;
            }
        }
        curr += z;
    }
    for(int i = 1; i <= n; i++)
    {
        if(a[i] == lmin)
            cout << 0 << " ";
        else if(a[i] > 0)
            cout << a[i] << " ";
        else cout << (a[i] + curr) << " ";
    }
    return;
}

int main()
{
    ios_base::sync_with_stdio(NULL);
    cin.tie(NULL);
    cout.tie(NULL);
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
    solve();
    return 0;
}

Submission Info

Judge Result