제출 #432110

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

count_triplets

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

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

void dfs (int u, int t, int k, bool ok = 0) {
  if (found) {
    return;
  }
  vis[u] = vid;
  if (u == k) {
    found = ok;
    ans += ok;
  }
  ok |= u == t;
  for (int v : adj[u]) {
    if (vis[v] != vid) {
      dfs(v, t, k, ok);
    }
  }
  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) {
      for (int k = 0; k < n; ++k) {
        if (set<int>{u, v, k}.size() == 3) {
          ++vid;
          found = 0;
          dfs(u, v, k);
        }
      }
    }
  }
  cout << ans;

  return 0;
}

• Subtask 1: 5 / 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