제출 #698818

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

count_triplets

#include <bits/stdc++.h>
#define endl '\n'
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define int ll
#define all(vec) vec.begin(), vec.end()
typedef long long ll;
using namespace std;
const int N = 1e3 + 10, mod = 1e9 + 7;
vector<vector<int> > v(N);
bool vis[N];
bool flag;
int dfs(int node, int par) {
    vis[node] = 1;
    int cnt = 1;
    for(auto ch : v[node]) {
        if(!vis[ch]) {
            cnt += dfs(ch, node);
        }
        if(vis[ch] && par != ch) flag = 1;
    }
    return cnt;
}
signed main()
{
    FAST;
    int n, m;
    cin >> n >> m;
    for(int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;
        v[a].push_back(b);
        v[b].push_back(a);
    }
    int ans = 0;
    for(int i = 1; i <= n; i++) {
        flag = 0;
        int x = 0;
        if(!vis[i]) x = dfs(i, i);
        if(x > 2) {
            if (flag) ans += x*(x-1)*(x-2);
            else  ans += x*(x-1)*(x-2)/3;
        }
    }
    cout << ans << endl;
}

• 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