Submission #159450

#	Time	Username	Problem	Language	Result	Execution time	Memory
159450		Minnakhmetov	Duathlon (APIO18_duathlon)	C++14	0 / 100	3 ms	504 KiB

count_triplets

#include <bits/stdc++.h>
  
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()
  
using namespace std;

const int N = 105;
vector<int> g[N];
bool used[N];

int ans = 0;

void dfs(int node, int len) {
    used[node] = 1;

    if (len > 2) {
        ans += len - 2;
    }

    for (int to : g[node]) {
        if (!used[to])
            dfs(to, len + 1);
    }

    used[node] = 0;
}

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

    int n, m;
    cin >> n >> m;

    for (int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;
        a--, b--;
        g[a].push_back(b);
        g[b].push_back(a);
    }

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

    cout << ans;

    return 0;
}

• Subtask 1: 0 / 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