제출 #569101

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
569101		SSRS	철인 이종 경기 (APIO18_duathlon)	C++14	5 / 100	1095 ms	20748 KiB

count_triplets

#include <bits/stdc++.h>
using namespace std;
int main(){
  int n, m;
  cin >> n >> m;
  vector<vector<int>> E(n);
  for (int i = 0; i < m; i++){
    int u, v;
    cin >> u >> v;
    u--;
    v--;
    E[u].push_back(v);
    E[v].push_back(u);
  }
  int ans = 0;
  for (int s = 0; s < n; s++){
    for (int c = 0; c < n; c++){
      for (int f = 0; f < n; f++){
        if (s != c && s != f && c != f){
          vector<vector<bool>> dp1(n, vector<bool>(1 << n, false));
          dp1[s][1 << s] = true;
          for (int i = 0; i < (1 << n); i++){
            for (int j = 0; j < n; j++){
              if (dp1[j][i]){
                for (int k : E[j]){
                  if ((i >> k & 1) == 0){
                    dp1[k][i | (1 << k)] = true;
                  }
                }
              }
            }
          }
          vector<vector<bool>> dp2(n, vector<bool>(1 << n, false));
          for (int i = 0; i < (1 << n); i++){
            if (dp1[c][i]){
              dp2[c][i] = true;
            }
          }
          for (int i = 0; i < (1 << n); i++){
            for (int j = 0; j < n; j++){
              if (dp2[j][i]){
                for (int k : E[j]){
                  if ((i >> k & 1) == 0){
                    dp2[k][i | (1 << k)] = true;
                  }
                }
              }
            }
          }
          bool ok = false;
          for (int i = 0; i < (1 << n); i++){
            if (dp2[f][i]){
              ok = true;
            }
          }
          if (ok){
            ans++;
          }
        }
      }
    }
  }
  cout << ans << endl;
}

• 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