#include <bits/stdc++.h>
#include <vector>
using namespace std;
const int MAX=100005;
set<int> grafo [MAX];
void revisar_vecinos(int nodo){
vector<int> vecinos(grafo[nodo].begin(), grafo[nodo].end());
for (int i = 0; i < vecinos.size(); ++i) {
int u = vecinos[i];
if(u<=nodo) continue;
for (int j = i + 1; j < vecinos.size(); ++j) {
int v = vecinos[j];
if (v <= nodo) continue;
grafo[u].insert(v);
grafo[v].insert(u);
}
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
long long int n, q;
cin >> n >> q;
long long int a, b;
while (q--) {
cin >> a >> b;
grafo[b].insert(a);
grafo[a].insert(b);
}
long long int total=0;
for (int i = 1; i <= n; i++) {
revisar_vecinos(i);
total += grafo[i].size();
}
cout<<total/2;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |