Submission #982227

#	Time	Username	Problem	Language	Result	Execution time	Memory
982227		Jawad_Akbar_JJ	Duathlon (APIO18_duathlon)	C++17	0 / 100	62 ms	14420 KiB

count_triplets

#include <iostream>
#include <vector>
 
using namespace std;
#define int long long
const int N = 1e5 + 10;
vector<int> nei[N];
bool seen[55][55][55];
int Seen[N],cur;
 
void dfs(int u,vector<int> v){
	cur++;
	v.push_back(u);
 
	for (int i : v)
		seen[v[0]][u][i] = 1,Seen[i] = cur;
 
	for (int i : nei[u])
		if (Seen[i] != cur)
			dfs(i,v);
}
 
signed main(){
	int n,m;
	cin>>n>>m;
 
	for (int i=1;i<=m;i++){
		int a,b;
		cin>>a>>b;
		nei[a].push_back(b);
		nei[b].push_back(a);
	}
 
	for (int i=1;i<=n;i++)
		dfs(i,{});
 
	int ans = 0;
 
	for (int s = 1;s <= n; s++)
		for (int c = 1;c <= n; c++)
			for (int f = 1;f <= n; f++)
				if ( !(s == c or s == f or c == f) )
					ans += seen[s][f][c];
	cout<<ans<<'\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