제출 #159452

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
159452		Minnakhmetov	Duathlon (APIO18_duathlon)	C++14	0 / 100	1074 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 n, m;

vector<int> pt;
set<vector<int>> st;

void dfs(int node, int len) {

    used[node] = 1;
    pt.push_back(node);

    for (int i = 1; i < (int)pt.size() - 1; i++) {
        st.insert({pt[0], pt[i], pt.back()});
    }

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

    pt.pop_back();

    used[node] = 0;
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    
    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 << st.size();

    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