Submission #710251

#	Time	Username	Problem	Language	Result	Execution time	Memory
710251		vjudge1	Duathlon (APIO18_duathlon)	C++17	5 / 100	1085 ms	596 KiB

count_triplets

/*
Author : DeMen100ns (a.k.a Vo Khac Trieu)
School : VNU-HCM High school for the Gifted
fuck you adhoc
*/

#include <bits/stdc++.h>
#define endl '\n'

using namespace std;

const int N = 50 + 5;
const long long INF = 1e18 + 7;
const int MAXA = 1e9;
const int B = sqrt(N) + 5;

bool f[N][N][N];
bool vis[N];
vector <int> a[N];

void dfs(int start, int u, vector <int> &v){
    vis[u] = true;

    for(int i : v){
        f[start][i][u] = true;
    }
    v.push_back(u);

    for(int i : a[u]){
        if (vis[i]) continue;
        dfs(start, i, v);
    }

    v.pop_back();

    vis[u] = false;
}

void solve()
{
    int n, m; cin >> n >> m;
    for(int i = 1; i <= m; ++i){
        int u, v; cin >> u >> v;
        a[u].push_back(v);
        a[v].push_back(u);
    }

    for(int i = 1; i <= n; ++i){
        memset(vis, 0, sizeof vis);
        vector <int> bruh = {i};
        dfs(i, i, bruh);
    }

    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)
                    ans += f[i][j][k];
            }
        }
    }

    cout << ans;
}

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

    // freopen("codeforces.inp","r",stdin);
    // freopen("codeforces.out","w",stdout);

    int t = 1; // cin >> t;
    while (t--)
    {
        solve();
    }
}

• 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