Submission #62772741

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
map<pair<ll, ll>, ll> edges;
map<ll, set<ll>> adj;
int main() {
    ll N, M;
    cin >> N >> M;
    ll u, v;
    ll self_loops = 0, multi_edges = 0;
    for (ll i = 0; i < M; ++i) {
        cin >> u >> v;
        if (u == v) self_loops++;
        else {
            if (edges[{min(u, v), max(u, v)}]++) multi_edges++;
            adj[u].insert(v);
            adj[v].insert(u);
        }
    }
    cout << self_loops + multi_edges << endl;
    return 0;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
map<pair<ll, ll>, ll> edges;
map<ll, set<ll>> adj;
int main() {
    ll N, M;
    cin >> N >> M;
    ll u, v;
    ll self_loops = 0, multi_edges = 0;
    for (ll i = 0; i < M; ++i) {
        cin >> u >> v;
        if (u == v) self_loops++;
        else {
            if (edges[{min(u, v), max(u, v)}]++) multi_edges++;
            adj[u].insert(v);
            adj[v].insert(u);
        }
    }
    cout << self_loops + multi_edges << endl;
    return 0;
}

Submission Info

Judge Result