제출 #432114

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
432114		SuhaibSawalha1	철인 이종 경기 (APIO18_duathlon)	C++17	0 / 100	1095 ms	19188 KiB

count_triplets

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

int n, m, nodes, vid, found;
vector<vector<int>> adj;
vector<int> vis, stck;
set<int> st;
long long ans;

void dfs (int u, int k) {
  if (found) {
    return;
  }
  vis[u] = vid;
  if (u == k) {
    for (int v : stck) {
      st.insert(v);
    }
  }
  stck.push_back(u);
  for (int v : adj[u]) {
    if (vis[v] != vid) {
      dfs(v, k);
    }
  }
  stck.pop_back();
  vis[u] = 0;
}
    
int main (){

  ios_base::sync_with_stdio(false);
  cin.tie(NULL);

  cin >> n >> m;
  adj.resize(n);
  while (m--) {
    int u, v;
    cin >> u >> v, --u, --v;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }    
  vis.resize(n);
  for (int u = 0; u < n; ++u) {
    for (int v = 0; v < n; ++v) {
      if (u ^ v) {
        ++vid;
        dfs(u, v);
        ans += max(0, (int)st.size() - 1);
        st.clear();
      }
    }
  }
  cout << ans;

  return 0;
}

• 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