Codeforces Round #479 (Div. 3) E. Cyclic Components

题目描述

You are given an undirected graph consisting of 𝑛n vertices and 𝑚m edges. Your task is to find the number of connected components which are cycles.

Here are some definitions of graph theory.

An undirected graph consists of two sets: set of nodes (called vertices) and set of edges. Each edge connects a pair of vertices. All edges are bidirectional (i.e. if a vertex 𝑎a is connected with a vertex 𝑏b, a vertex 𝑏b is also connected with a vertex 𝑎a). An edge can't connect vertex with itself, there is at most one edge between a pair of vertices.

Two vertices 𝑢u and 𝑣v belong to the same connected component if and only if there is at least one path along edges connecting 𝑢u and 𝑣v.

A connected component is a cycle if and only if its vertices can be reordered in such a way that:

• the first vertex is connected with the second vertex by an edge,
• the second vertex is connected with the third vertex by an edge,
• ...
• the last vertex is connected with the first vertex by an edge,
• all the described edges of a cycle are distinct.

A cycle doesn't contain any other edges except described above. By definition any cycle contains three or more vertices.

There are 66 connected components, 22 of them are cycles: [7,10,16][7,10,16] and [5,11,9,15][5,11,9,15].

Input

The first line contains two integer numbers 𝑛n and 𝑚m (1≤𝑛≤2⋅1051≤n≤2⋅105, 0≤𝑚≤2⋅1050≤m≤2⋅105) — number of vertices and edges.

The following 𝑚m lines contains edges: edge 𝑖i is given as a pair of vertices 𝑣𝑖vi, 𝑢𝑖ui (1≤𝑣𝑖,𝑢𝑖≤𝑛1≤vi,ui≤n, 𝑢𝑖≠𝑣𝑖ui≠vi). There is no multiple edges in the given graph, i.e. for each pair (𝑣𝑖,𝑢𝑖vi,ui) there no other pairs (𝑣𝑖,𝑢𝑖vi,ui) and (𝑢𝑖,𝑣𝑖ui,vi) in the list of edges.

Output

Print one integer — the number of connected components which are also cycles.

Examples

input

Copy

5 4
1 2
3 4
5 4
3 5

output

Copy

1

input

Copy

17 15
1 8
1 12
5 11
11 9
9 15
15 5
4 13
3 13
4 3
10 16
7 10
16 7
14 3
14 4
17 6

output

Copy

2

Note

In the first example only component [3,4,5][3,4,5] is also a cycle.

The illustration above corresponds to the second example.

 思路

• 从未访问过的点开始dfs
• 如果出现环, 且中途经过的点的度数都为2,则满足条件

代码

#include<iostream>
#include<vector>
#include<cstring>
using namespace std;
#define _for(i,a,b) for(int i=(a);i<(b);i++)
#define _rep(i,a,b) for(int i=(a);i<=(b);i++)
typedef pair<int, int> PLL;
typedef long long ll;
const int N = 2e5+5;
const int INF = 0x3f3f3f3f;
int readint(){
    int x;scanf("%d",&x);return x;
}
struct Node {
    int v, idx;
};
int n, m;
vector<Node> edge[N];
int visitV[N];
bool visitE[2 * N];
bool ok;
int cnt = 1;
void dfs(int x) {
    visitV[x]++;
    if(edge[x].size() != 2) {
        ok = false;
        return;
    }
    if(visitV[x] >= 2) {
        ok = true;
        return;
    }
    
    for(auto y : edge[x]) {
        int v = y.v, idx = y.idx;
        if(!visitE[idx]) {
            visitE[idx] = visitE[idx ^ 1] = true;
            dfs(v);
        }
    }
    
}
int main()
{
    n = readint(), m = readint();
    _rep(i, 1, m) {
        int x = readint(), y = readint();
        edge[x].push_back({y, ++cnt});
        edge[y].push_back({x, ++cnt});
    }
    int ans = 0;
    _rep(i, 1, n) {
        if(!visitV[i]) {
            ok = false;
            dfs(i);
            if(ok) ans++;
        }
    }
    printf("%d\n", ans);
    return 0;
}