Submission #71936

#	Time	Username	Problem	Language	Result	Execution time	Memory
71936		KLPP	Duathlon (APIO18_duathlon)	C++14	10 / 100	1071 ms	7416 KiB

count_triplets

#include<iostream>
#include<stdio.h>
#include<vector>
#include<queue>
#include<algorithm>

using namespace std;
typedef long long int lld;

int main(){
	int n,m;
	cin>>n>>m;
	vector<int>nei[n];
	for(int i=0;i<m;i++){
		int x,y;
		cin>>x>>y;
		x--;y--;
		nei[x].push_back(y);
		nei[y].push_back(x);
	}
	lld ans=0;
	for(int i=0;i<n;i++){
		lld dist[n];
		for(int j=0;j<n;j++)dist[j]=-1;
		dist[i]=0;
		queue<int>q;
		q.push(i);
		while(!q.empty()){
			int u=q.front();q.pop();
			for(int j=0;j<nei[u].size();j++){
				int v=nei[u][j];
				if(dist[v]==-1){
					dist[v]=dist[u]+1;
					q.push(v);
				}
			}
		}
		//for(int j=0;j<n;j++)cout<<dist[j]<<" ";
		//cout<<endl;
		for(int j=0;j<n;j++){
			if(dist[j]>0)ans+=dist[j]-1;
		}
	}
	cout<<ans<<endl;

	return 0;	
}

Compilation message (stderr)

count_triplets.cpp: In function 'int main()':
count_triplets.cpp:30:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int j=0;j<nei[u].size();j++){
                ~^~~~~~~~~~~~~~

• 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