Submission #698795

#	Time	Username	Problem	Language	Result	Execution time	Memory
698795		vjudge1	Duathlon (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];
int dfs(int node) {
    vis[node] = 1;
    int cnt = 1;
    for(auto ch : v[node]) {
        if(!vis[ch]) {
            cnt += dfs(ch);
        }
    }
    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++) {
        if(!vis[i]) {
            int temp = dfs(i);
            if(temp < 3) continue;
            for(int j = 1; j <= temp; j++) {
                int a = temp - i - 1;
                ans += a * (a + 1);
            }
        }
    }
    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