제출 #1335304

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

count_triplets

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

const int mxN = 55;

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

void dfs(int u, int st, int en, long long mask){
    if(u == en) {
        g[st][en] |= mask;
        g[en][st] |= mask;
        return;
    }
    for(auto it : adj[u]){
        if(!(mask & (1ll << it))){
            dfs(it, st, en, 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;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }

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

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

    cout << ans << "\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