Submission #49190

#	Time	Username	Problem	Language	Result	Execution time	Memory
49190		someone_aa	Duathlon (APIO18_duathlon)	C++17	10 / 100	1070 ms	9104 KiB

count_triplets

#include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;

const int maxn = 100100;
vector<int>g[maxn];
bool visited[maxn];
int n, m, u, v;
ll result;

void dfs(int node, int depth=0) {
    if(visited[node]) return;
    visited[node] = true;
    if(depth >= 2) result += depth - 1;
    for(int i:g[node]) {
        if(!visited[i]) {
            dfs(i, depth+1);
        }
    }
}

int main() {
    cin>>n>>m;
    for(int i=0;i<m;i++) {
        cin>>u>>v;
        g[u].pb(v);
        g[v].pb(u);
    }

    for(int i=1;i<=n;i++) {
        memset(visited,0,sizeof(visited));
        dfs(i);
    }
    cout<<result<<"\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