Submission #8873571

---

Source Code Expand

#include <bits/stdc++.h>
typedef long long lint;

#define PI acos(-1)
#define INF64 1LL << 60
#define INF32 1 << 29
#define all(a) (a).begin(), (a).end()

using namespace std;

void execute()
{
	int N, M;
	int a, b;
	int count;
	int current;
	int ans = 0;
	cin >> N >> M;
	vector<bool> IsThrough(N, false);
	vector<vector<bool>> root(N, vector<bool>(N, false));
	vector<vector<int>> i_root(M, vector<int>(2, 0));
	queue<int> next;
	for (int i = 0; i < M; i++)
	{
		cin >> a >> b;
		i_root[i][0] = a - 1;
		i_root[i][1] = b - 1;
		root[i_root[i][0]][i_root[i][1]] = true;
		root[i_root[i][1]][i_root[i][0]] = true;
	}

	for (int i = 0; i < M; i++)
	{
		IsThrough = vector<bool>(N, false);
		root[i_root[i][0]][i_root[i][1]] = false;
		root[i_root[i][1]][i_root[i][0]] = false;
		next.push(0);
		count = 0;
		for (; !next.empty();)
		{
			current = next.front();
			next.pop();

			for (int j = 0; j < N; j++)
			{
				if (root[current][j] && !IsThrough[j])
				{
					IsThrough[j] = true;
					next.push(j);
				}
			}
			count++;
		}
		if (count <= N)
			ans++;

		root[i_root[i][0]][i_root[i][1]] = true;
		root[i_root[i][1]][i_root[i][0]] = true;
	}
	cout << ans << endl;
	return;
}

int main()
{
	cin.tie(0);
	ios_base::sync_with_stdio(false);
	std::cout << std::fixed << std::setprecision(15);
	execute();

	int stop;
	cin >> stop;

	return 0;
}

Submission Info

Judge Result