제출 #252132

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
252132		Mlxa	Duathlon (APIO18_duathlon)	C++14	10 / 100	20 ms	768 KiB

count_triplets

#include <bits/stdc++.h>
using ll = long long;
#define int ll
#define x first
#define y second
#define all(x) x.begin(), x.end()
#define mp make_pair
#define mt make_tuple
using namespace std;

const int N = 3e3;
int n;
int m;
vector<int> g[N];
int used[N];
int timer = 0;
int answer = 0;

void dfs(int v, int d) {
    if (d > 1) {
        answer += d - 1;
    }
    used[v] = timer;
    for (int u : g[v]) {
        if (used[u] < timer) {
            dfs(u, d + 1);
        }
    }
}

signed main() {
#ifdef LC
    assert(freopen("input.txt", "r", stdin));
#endif // LC
    ios::sync_with_stdio(0);
    cin.tie(0);

    cin >> n >> m;
    for (int v, u, i = 0; i < m; ++i) {
        cin >> v >> u;
        --v;
        --u;
        g[v].push_back(u);
        g[u].push_back(v);
    }
    for (int i = 0; i < n; ++i) {
        ++timer;
        dfs(i, 0);
    }
    cout << answer << "\n";
    return 0;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 11
• Subtask 3: 0 / 8
• Subtask 4: 10 / 10
• Subtask 5: 0 / 13
• Subtask 6: 0 / 15
• Subtask 7: 0 / 20
• Subtask 8: 0 / 8
• Subtask 9: 0 / 10