Submission #764007

#	Time	Username	Problem	Language	Result	Execution time	Memory
764007		OrazB	Duathlon (APIO18_duathlon)	C++14	0 / 100	43 ms	14168 KiB

count_triplets

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_set;
//Dijkstra->set
//set.find_by_order(x) x-position value
//set.order_of_key(x) number of strictly less elements don't need *set.??
#define N 100005
#define wr cout << "Continue debugging\n";
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define pii pair <int, int>
#define pb push_back
#define ff first
#define ss second

bool vis[N];
ll ans = 0, sub[N];
vector<int> E[N];

void dfs(int nd){
	vis[nd] = 1;
	for (auto i : E[nd]){
		if (!vis[i]){
			dfs(i);
			sub[nd] += sub[i];
		} 
	}
	ans += sub[nd]*(sub[nd]-1);
	sub[nd]++;
}

int main ()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n, m;
	cin >> n >> m;
	while(m--){
		int u, v;
		cin >> u >> v;
		E[u].pb(v);
		E[v].pb(u);
	}
	ll sum = 0;
	for (int i = 1; i <= n; i++){
		if (!vis[i]){
			ans = 0;
			dfs(i);
			sum += ans;
		}
	}
	cout << sum << '\n';
}	

• 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