提出 #72685402

---

ソースコード 拡げる

# pragma GCC target("avx2")
# pragma GCC optimize("O3")
# pragma GCC optimize("unroll-loops")
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vl=vector<long long>;
using vvl=vector<vector<long long>>;
using vvvl=vector<vector<vector<long long>>>;
using pl=pair<long long,long long>;
using vpl=vector<pair<long long,long long>>;
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(long long i=(long long)(a);i<(long long)(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#include <atcoder/all>
using namespace atcoder;

long long modpow(long long a, long long n, long long mo){long long res=1;while(n>0){if(n&1){res=res*a%mo;}a=a*a%mo;n>>=1;}return res;}
long long Pow(long long a, long long n){long long res=1;while(n>0){if(n&1){res=res*a;}a=a*a;n>>=1;}return res;}


const ll MOD=998244353;
const ll INF=(1ll<<60);
int main(){
  ll N,M;
  cin>>N>>M;
  vl A(M),B(M);
  rep(i,M) cin>>A[i]>>B[i];
  vl canl(N,N-1);
  rep(i,M){
    A[i]--;B[i]--;
    canl[A[i]]--;
    canl[B[i]]--;
  }
  rep(i,N){
    ll x=canl[i];
    cout<<x*(x-1)*(x-2)/6<<" ";
  }
  cout<<endl;
}

提出情報

ジャッジ結果