제출 #1335317

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

count_triplets

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

vector<int> adj[51];
int n, m;
long long g[51][51][51], ans = 0;

void dfs(int u, int st, long long mask){
    for(auto it : adj[u]){
        if(!(mask & (1ll << it))){
            for(int j = 0; j < n; ++j) if(g[st][u][j]) g[st][it][j] = 1;
            dfs(it, st, mask | (1 << it));
        }
    }
}

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].push_back(v);
        adj[v].push_back(u);
    }

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

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

    for(int i = 0; i < n; ++i){
        for(int j = i + 1; j < n; ++j){
            long long cnt = 0;
            for(int k = 0; k < n; ++k){
                if(g[i][j][k]) cnt += 1;
            }
            ans += max(0ll, cnt - 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