제출 #698772

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
698772		vjudge1	철인 이종 경기 (APIO18_duathlon)	C++17	0 / 100	23 ms	1920 KiB

count_triplets

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

#define int long long
#define endl '\n'

const int M = 1e4+5, K = 4e2+2, MOD = 1e9+7;
vector<int> node[M];
bitset<10005> vis;
int dist[M];

void dfs(int s, int p = 0) {
    if (!p) p = s, vis = 0, dist[s] = 0;
    dist[s] = dist[p] + 1;
    vis[s] = true;
    for (int i:node[s])
        if (!vis[i]) dfs(i, s);
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);

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

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

    int ans = 0;
    for (int i = 1; i <= n; i++) {
        dfs(i);
        for (int j = 1; j <= n; j++) {
            ans += max(dist[j]-2, 0ll);
        }
    } cout << ans << endl;

    return 0;
}
/*
1 2 3 4 5 6 7 8
1 2 2 4 5 6 7 8
3
SRS RR SRRRS RRRR
4 2 4
3 1 1 10
9 2 2 4
7 2 5 7
4 1 8 10
5 3
5 6
5 9
1 10
------
2 1 3
1 1 1 4
1 1 2 5
1 3
1 5
1 7
------
1 1 1
100000000 1 1 1
1 1
------
*/

• 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