233692026-01-20 19:02:51PappMatyasHálózati biztonság (50)cpp17Wrong answer 0/50158ms6684 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;
				}
			}
		}
	}

	for (int i = 0; i < n; i++)
	{
		if (a[i] >= k)
		{
			cout << i + 1 << " ";
		}
	}
}
SubtaskSumTestVerdictTimeMemory
base0/50
1Wrong answer0/01ms316 KiB
2Wrong answer0/086ms3636 KiB
3Wrong answer0/21ms316 KiB
4Wrong answer0/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/21ms316 KiB
7Wrong answer0/21ms508 KiB
8Wrong answer0/21ms316 KiB
9Wrong answer0/21ms316 KiB
10Wrong answer0/26ms476 KiB
11Wrong answer0/22ms316 KiB
12Wrong answer0/24ms564 KiB
13Wrong answer0/32ms316 KiB
14Wrong answer0/36ms820 KiB
15Wrong answer0/37ms1168 KiB
16Wrong answer0/382ms2828 KiB
17Wrong answer0/36ms564 KiB
18Wrong answer0/39ms2068 KiB
19Wrong answer0/397ms5712 KiB
20Wrong answer0/3158ms6684 KiB
21Wrong answer0/398ms5940 KiB
22Wrong answer0/31ms316 KiB