Submission #62802575

---

Source Code Expand

#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
#include <functional>
#include <set>

using namespace std;
using ll = long long;
using v_int = vector<int>;
using v_ll = vector<long long>;
using vv_int = vector<vector<int>>;
using vv_ll = vector<vector<long long>>;
using p_ii = pair<int,int>;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define sorted(X) sort(X.begin(),X.end())

int main(){
  int N,M;
  cin >> N >> M;
  vv_int Graph(N,vector<int>(N,0));

  int ans=0;

  for (int i=0;i<M;i++){
    int a ,b;
    cin >> a >> b;
    a--;
    b--;
    
    if(a > b){
      int tmp = a;
      a = b;
      b = tmp;
    }
    if(Graph[a][b] == 0 && a!=b) Graph[a][b] = 1;
    else{
      ans += 1;
    }
  }


  cout << ans << endl;

}

Submission Info

Judge Result