제출 #1335319

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

count_triplets

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

const int mxN = 51;

set<int> adj[mxN];
bitset<mxN> g[mxN][mxN];
int n, m, vis[mxN];
long long ans = 0;

void dfs(int u, int st){
    vis[u] = 1;
    for(auto it : adj[u]){
        if(!vis[it]){
            g[st][it] |= g[st][u];
            dfs(it, st);
        }
    }
    vis[u] = 0;
}

signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(nullptr); cout.tie(nullptr);

    cin >> n >> m;

    for(int i = 1, u, v ; i <= m; ++i){
        cin >> u >> v; --u, --v;
        adj[u].insert(v);
        adj[v].insert(u);
    }

    for(int i = 0; i < n; ++i){
        for(int j = 0; j < n; ++j){
            g[i][j][j] = 1;
            g[i][i][i] = 1;
        }
    }

    for(int i = 0; i < n; ++i){
        dfs(i, i);
    }

    for(int i = 0; i < n; ++i){
        for(int j = i + 1; j < n; ++j){
            ans += max(0ll, (long long) g[i][j].count() - 2);
        }
    }

    cout << ans * 2ll << "\n";

	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