Submission #370667

#	Time	Username	Problem	Language	Result	Execution time	Memory
370667		Leonardo_Paes	Duathlon (APIO18_duathlon)	C++17	23 / 100	1120 ms	1048580 KiB

count_triplets

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ar array
#define sz(a) ((int)(a).size())
#define all(a) (a).begin(),(a).end()
typedef pair<int,int> pii;
#define f first
#define s second
const int maxn = 1e5+10;
vector<int> grafo[maxn];
int n, m, dp[maxn], sz[maxn], qtd2[maxn];
int solve(int u, int p = 0){ // lca of path is u, 1 as a root
    int ans = 0; // sum of dps
    sz[u] = 1;
    for(int v : grafo[u]){
        if(v == p) continue;
        ans += solve(v, u);
        sz[u] += sz[v];
        qtd2[u] += qtd2[v] + sz[v];
    }
    int qtd = sz[u] - 1;
    for(int v : grafo[u]){
        if(v == p) continue;
        qtd -= sz[v];
        dp[u] += sz[v] * qtd;
        dp[u] += (sz[u]  - sz[v]) * qtd2[v];
    }
    return ans + dp[u];
}
int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    cin >> n >> m;
    for(int i=1; i<=m; i++){
        int u, v;
        cin >> u >> v;
        grafo[u].push_back(v);
        grafo[v].push_back(u);
    }
    int ans = 0;
    for(int i=1; i<=n; i++){
        if(!sz[i]) ans += solve(i);
    }
    cout << 2*ans << "\n";
    return 0;
}

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