Submission #138771

# Submission time Handle Problem Language Result Execution time Memory
138771 2019-07-30T10:09:08 Z FedericoS Duathlon (APIO18_duathlon) C++14
0 / 100
10 ms 7416 KB
#include <iostream>
#include <vector>
using namespace std;
typedef long long int ll;

ll N,M;
ll x,y;
ll A,B,ans;
bool V[300005];
vector<ll> grafo[300005];

void DFS(int k){

	B++;
	if(V[k])
		return;
	A++;
	V[k]=true;

	for(int f:grafo[k])
		DFS(f);

}

int main(){

	cin>>N>>M;

	if(M==N)
		cout<<(N*(N-1)*(N-2));
	else
		cout<<(N*(N-1)*(N-2))/3;

	/*
	for(int i=0;i<M;i++){
		cin>>x>>y;
		grafo[x].push_back(y);
		grafo[y].push_back(x);
	}

	for(int i=1;i<N+1;i++)
		if(!V[i]){
			A=B=0;
			DFS(i);
			if(B-1==2*A)
				ans+=(A*(A-1)*(A-2));
			else	
				ans+=(A*(A-1)*(A-2))/3;
		}

	cout<<ans;

	*/

}
# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 7288 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 7288 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 8 ms 7288 KB Output is correct
2 Correct 10 ms 7288 KB Output is correct
3 Incorrect 8 ms 7416 KB Output isn't correct
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 7416 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 7416 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 7416 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 7288 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 7288 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 7288 KB Output isn't correct
2 Halted 0 ms 0 KB -