제출 #59906

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
59906		Flugan42	철인 이종 경기 (APIO18_duathlon)	C++14	0 / 100	189 ms	9704 KiB

count_triplets

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vi;
typedef pair<ll,ll> ii;
typedef vector<ii> vii;
#define rep(i,a,b) for(int i = a; i < b; i++)
#define per(i,a,b) for(int i = a; i >= b; i--)
#define inf 1000000000000000000
#define sz(x) (ll)(x).size()

ll n,m,u,v,cur,ans;
vector<vi> edges;
vi _,vis;

void dfs(ll a){
  rep(i,0,sz(edges[a])){
    ll b = edges[a][i];
    if (!vis[b]) {
      vis[b] = cur; ans++;
      dfs(b);
    }
  }
}

ll c3(ll x){
  return (x*(x-1)*(x-2)/3);
}

int main(){
  cin >> n >> m;
  edges.assign(n,_);
  rep(i,0,m){
    cin >> u >> v; u--; v--;
    edges[u].push_back(v);
    edges[v].push_back(u);
  }
  vis.assign(n,0);
  cur = 1; ll res = 0; ans = 0;
  rep(i,0,n){
    if (vis[i] == 0) { vis[i] = cur; ans = 1; dfs(i); cur++; }
    res += c3(ans); ans = 0;
    //cout << i << " " << res << endl;
  }
  cout << res << endl;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 11
• Subtask 3: 0 / 8
• Subtask 4: 0 / 10
• Subtask 5: 0 / 13
• Subtask 6: 0 / 15
• Subtask 7: 0 / 20
• Subtask 8: 0 / 8
• Subtask 9: 0 / 10