150902025-02-12 18:16:49horkaHálózati biztonság (50)cpp17Accepted 50/5087ms6996 KiB
#include <bits/stdc++.h>
using namespace std;

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int n,m,k; cin>>n>>m>>k;
    vector<int> foxam(n+1);
    vector<vector<int>> adj(n+1);
    for(int i=0; i<m; i++)
    {
        int a,b; cin>>a>>b;
        adj[a].push_back(b);
        adj[b].push_back(a);
        foxam[a]++,foxam[b]++;
    }
    queue<int> q;
    vector<bool> vis(n+1);
    for(int i=1; i<=n; i++)
    {
        if(foxam[i]<k)
        {
            q.push(i);
            vis[i]=1;
        }
    }
    while(!q.empty())
    {
        int cs=q.front();
        q.pop();
        for(int &i:adj[cs])
        {
            foxam[i]--;
            if(foxam[i]==k-1)
            {
                vis[i]=1;
                q.push(i);
            }
        }
    }
    vector<int> ans;
    for(int i=1; i<=n; i++)
        if(!vis[i]) ans.push_back(i);
    cout<<ans.size()<<"\n";
    for(int &i:ans)
        cout<<i<<" ";
    cout<<"\n";
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/041ms3940 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms316 KiB
8Accepted2/21ms316 KiB
9Accepted2/21ms316 KiB
10Accepted2/23ms564 KiB
11Accepted2/22ms508 KiB
12Accepted2/23ms564 KiB
13Accepted3/31ms316 KiB
14Accepted3/33ms1016 KiB
15Accepted3/34ms1332 KiB
16Accepted3/339ms2996 KiB
17Accepted3/34ms820 KiB
18Accepted3/37ms2188 KiB
19Accepted3/348ms6168 KiB
20Accepted3/387ms6996 KiB
21Accepted3/352ms6308 KiB
22Accepted3/31ms316 KiB