제출 #974438

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
974438		vjudge1	철인 이종 경기 (APIO18_duathlon)	C++17	16 / 100	616 ms	684 KiB

count_triplets

#pragma GCC optimize("O3,Ofast,unroll-loops")
#pragma GCC target("avx2,bmi")
#include <bits/stdc++.h>

#define lli long long int
#define ld long double
#define pb push_back
#define MP make_pair
#define REP(i, n) for(int i = 0; (i) < (n); (i)++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

using namespace std;

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}

const int N = 55;
const int INF = 1e9 + 500;
int n, m;
array<vector<int>, N> adj;
array<int, N> vis;
inline bool dfs(int node, int l, int t) {
    if(l == node) return 0;
    if(node == t) return 1;
    vis[node] = 1;
    for(auto c : adj[node]) {
        if(vis[c]) continue;
        if(dfs(c, l, t)) {
            return 1;
        }
    }
    return 0; 
} 

void solve() {
    cin >> n >> m;
    REP(i, m) {
        int u, v;
        cin >> u >> v;
        adj[u].pb(v);
        adj[v].pb(u);
    }
    int ans = 0;
    for(int i = 1; i<=n; i++) {
        for(int j = 1; j <= n; j++) {
            for(int k = 1; k <= n; k++) {
                if(i == j || j == k || i == k) continue;
                bool f = 1;
                for(int l = 1; l <= n; l++) {
                    if(l == j) continue;
                    fill(vis.begin(), vis.begin() + n + 1, 0);
                    if(dfs(i, l, j)) continue;
                    fill(vis.begin(), vis.begin() + n + 1, 0);
                    if(dfs(k, l, j)) continue;
                    f = 0;
                    break;
                }
                ans += f;
            }
        }
    }
    cout << ans << "\n";
}


signed main() {
    fastio();
    solve();
}

• 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