4975 2023. 04. 08 01:33:05 TomaSajt Hálózati biztonság (50) cpp17 Accepted 50/50 254ms 49136 KiB 
#include <bits/stdc++.h>
using namespace std;

int main() {
  cin.tie(0), ios::sync_with_stdio(0);
  int n, m, k;
  cin >> n >> m >> k;
  vector<set<int>> g(n + 1);
  while (m--) {
    int u, v;
    cin >> u >> v;
    g[u].insert(v);
    g[v].insert(u);
  }
  queue<int> bad;
  for (int i = 1; i <= n; i++) {
    if (g[i].size() < k)
      bad.push(i);
  }
  while (!bad.empty()) {
    int u = bad.front();
    bad.pop();
    for (int v : g[u]) {
      g[v].erase(u);
      if (g[v].size() < k)
        bad.push(v);
    }
  }
  vector<int> res;
  for (int i = 1; i <= n; i++) {
    if (g[i].size() >= k)
      res.push_back(i);
  }
  cout << res.size() << '\n';
  for (auto &u : res)
    cout << u << ' ';
}
Subtask Sum Test Verdict Time Memory
base 50/50
1 Accepted 0/0 3ms 1828 KiB
2 Accepted 0/0 130ms 26792 KiB
3 Accepted 2/2 3ms 2236 KiB
4 Accepted 2/2 3ms 2452 KiB
5 Accepted 2/2 3ms 2824 KiB
6 Accepted 2/2 2ms 2748 KiB
7 Accepted 2/2 3ms 3020 KiB
8 Accepted 2/2 3ms 3272 KiB
9 Accepted 2/2 3ms 3448 KiB
10 Accepted 2/2 8ms 5640 KiB
11 Accepted 2/2 3ms 4088 KiB
12 Accepted 2/2 6ms 4816 KiB
13 Accepted 3/3 3ms 3928 KiB
14 Accepted 3/3 6ms 5676 KiB
15 Accepted 3/3 7ms 7104 KiB
16 Accepted 3/3 254ms 28988 KiB
17 Accepted 3/3 7ms 5768 KiB
18 Accepted 3/3 9ms 11112 KiB
19 Accepted 3/3 96ms 33288 KiB
20 Accepted 3/3 240ms 49136 KiB
21 Accepted 3/3 107ms 35496 KiB
22 Accepted 3/3 3ms 4256 KiB