233702026-01-20 19:04:10PappMatyasHálózati biztonság (50)cpp17Accepted 50/50165ms6708 KiB
#include <iostream>
#include <vector>

using namespace std;

int main()
{
	int n, m, k;
	cin >> n >> m >> k;

	vector<int> a(n, 0);
	vector<vector<int>> c(n);

	for (int i = 0; i < m; i++)
	{
		int x, y;
		cin >> x >> y;
		x--; y--;
		c[x].push_back(y);
		c[y].push_back(x);
		a[x]++;
		a[y]++;
	}

	bool changed = true;
	while (changed)
	{
		changed = false;

		for (int i = 0; i < n; i++)
		{
			if (a[i] > 0)
			{
				if (a[i] < k)
				{
					int s = c[i].size();
					for (int j = 0; j < s; j++)
					{
						int ind = c[i][j];
						a[ind]--;
					}
					a[i] = 0;
					changed = true;
				}
			}
		}
	}
	int count = 0;

	for (int i = 0; i < n; i++)
	{
		if (a[i] >= k)
		{
			count++;
		}
	}
	cout << count << endl;
	for (int i = 0; i < n; i++)
	{
		if (a[i] >= k)
		{
			cout << i + 1 << " ";
		}
	}
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms500 KiB
2Accepted0/089ms3636 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms320 KiB
7Accepted2/21ms316 KiB
8Accepted2/21ms316 KiB
9Accepted2/21ms500 KiB
10Accepted2/27ms500 KiB
11Accepted2/22ms316 KiB
12Accepted2/24ms564 KiB
13Accepted3/31ms316 KiB
14Accepted3/34ms820 KiB
15Accepted3/37ms1076 KiB
16Accepted3/382ms2848 KiB
17Accepted3/36ms564 KiB
18Accepted3/310ms2100 KiB
19Accepted3/397ms5832 KiB
20Accepted3/3165ms6708 KiB
21Accepted3/3100ms6100 KiB
22Accepted3/31ms316 KiB