#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;
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 |
7416 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
8 ms |
7416 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
159 ms |
13852 KB |
Output is correct |
2 |
Correct |
164 ms |
14948 KB |
Output is correct |
3 |
Correct |
160 ms |
13412 KB |
Output is correct |
4 |
Correct |
163 ms |
14024 KB |
Output is correct |
5 |
Correct |
166 ms |
12816 KB |
Output is correct |
6 |
Correct |
165 ms |
12920 KB |
Output is correct |
7 |
Correct |
155 ms |
12456 KB |
Output is correct |
8 |
Correct |
168 ms |
12800 KB |
Output is correct |
9 |
Correct |
164 ms |
12084 KB |
Output is correct |
10 |
Correct |
164 ms |
12412 KB |
Output is correct |
11 |
Correct |
134 ms |
11744 KB |
Output is correct |
12 |
Correct |
137 ms |
11488 KB |
Output is correct |
13 |
Correct |
118 ms |
11384 KB |
Output is correct |
14 |
Correct |
122 ms |
11384 KB |
Output is correct |
15 |
Correct |
95 ms |
11000 KB |
Output is correct |
16 |
Correct |
92 ms |
10616 KB |
Output is correct |
17 |
Correct |
10 ms |
7544 KB |
Output is correct |
18 |
Correct |
9 ms |
7544 KB |
Output is correct |
19 |
Correct |
11 ms |
7544 KB |
Output is correct |
20 |
Correct |
11 ms |
7544 KB |
Output is correct |
21 |
Correct |
9 ms |
7544 KB |
Output is correct |
22 |
Correct |
9 ms |
7416 KB |
Output is correct |
# |
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 |
161 ms |
11388 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 |
157 ms |
11444 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
8 ms |
7416 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
8 ms |
7416 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |