Submission #51860994

---

Source Code Expand

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

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

int main() {
	cin.tie(0)->sync_with_stdio(0);
	
	int n, q; cin >> n >> q;

    vi x(q), z(q);
    set<int> s;
    for (int i = 0; i < q; ++i) {
        cin >> x[i]; --x[i];
        if (s.find(x[i]) != s.end()) {
            s.erase(x[i]);
        } else {
            s.insert(x[i]);
        }
        z[i] = sz(s);
    }

    vector<ll> pf(q+1);
    for (int i = 0; i < q; ++i) {
        pf[i+1] = pf[i] + z[i];
    }

    map<int, int> m;
    vector<ll> ans(n);
    for (int i = 0; i < q; ++i) {
        if (m.find(x[i]) != m.end()) {
            int t = m[x[i]];
            m.erase(x[i]);
            ans[x[i]] += pf[i] - pf[t];
        } else {
            m[x[i]] = i;
        }
    }
    for (auto [e, t] : m) {
        ans[e] += pf[q] - pf[t];
    }

    for (int i = 0; i < n; ++i) {
        cout << ans[i] << " ";
    }
}

Submission Info

Judge Result