Submission #569108

#	Time	Username	Problem	Language	Result	Execution time	Memory
569108		SSRS	Duathlon (APIO18_duathlon)	C++14	16 / 100	1099 ms	1048576 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 c = 0; c < n; c++){
    vector<vector<bool>> ok(n, vector<bool>(n, true));
    for (int u = 0; u < n; u++){
      if (u != c){
        vector<bool> used(n, false);
        used[c] = true;
        queue<int> Q;
        Q.push(c);
        while (!Q.empty()){
          int v = Q.front();
          Q.pop();
          for (int w : E[v]){
            if (!used[w] && w != u){
              used[w] = true;
              Q.push(w);
            }
          }
        }
        for (int s = 0; s < n; s++){
          for (int f = 0; f < n; f++){
            if (!used[s] && !used[f]){
              ok[s][f] = false;
            }
          }
        }
      }
    }
    for (int s = 0; s < n; s++){
      for (int f = 0; f < n; f++){
        if (s != c && f != c && s != f && ok[s][f]){
          ans++;
        }
      }
    }
  }
  cout << ans << endl;
}

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