Submission #72713483

---

Source Code Expand

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

using ll = long long;
using mi = map<int, int>;
using ml = map<long long, long long>;
using mc = map<char, int>;

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

void solve() {
    ll n, m;
    cin >> n >> m;
    vector<set<ll>> conflicts(n);
    for (int i = 0; i < m; i++) {
        ll a, b;
        cin >> a >> b;
        --a;
        --b;
        conflicts[a].insert(b);
        conflicts[b].insert(a);
    }
    for (int i = 0; i < n; i++) {
        ll remaining = n - (ll)conflicts[i].size() - 1;
        cout << (remaining * (remaining - 1) * (remaining - 2)) / 6 << ' ';
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    //cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}

Submission Info

Judge Result