Submission #72688445

---

Source Code Expand

#include <bits/stdc++.h>
#ifdef LOCAL
#include "debug.h"
#else
#define dbg(...) 0
#endif
using namespace std;
using ll = long long;
using db = double;
const ll N = 1e6 + 5;
const ll md = 998244353;
const ll MOD = 1e9 + 7;
const ll INF = 0x3f3f3f3f3f3f3f;
const db PI = acos(-1);
const db eps = 1e-6;
const db E = 2.718281828459045;
typedef pair<ll, ll> PLL;
#define fi first
#define se second
ll in[N];
ll cal(ll x)
{
    if(x<=2)
        return 0;
    return x * (x - 1) * (x - 2) / 6;
}
void solve()
{
    ll n, m;
    ll u, v;
    cin >> n >> m;
    for (ll i = 1;i<=m;i++)
    {
        cin >> u >> v;
        in[v]++, in[u]++;
    }
    for (ll i = 1;i<=n;i++)
    {
        ll res = 0;
        // cout << n - in[i] - 1 << ' ';
        res = cal(n - in[i]-1);
        cout << res << " \n"[i == n];
    }
}
int main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int T;
    T = 1;
    //cin>>T;
    while (T--)
    {
        solve();
    }
}

Submission Info

Judge Result