147592025-02-01 19:27:52szjHálózati biztonság (50)cpp17Accepted 50/50163ms6968 KiB
#include <bits/stdc++.h>

using namespace std;
int main()
{
    int n, m, k, i, a, b, j;
    cin >> n>> m >>k;
    int kapcs[n];
    for(i=0; i<n; i++)
    {
        kapcs[i] = 0;
    }
    vector<vector<int>>vec(n);
    for(i=0; i<m; i++)
    {
        cin >> a >> b;
        a--;
        b--;
        vec[a].push_back(b);
        vec[b].push_back(a);
        kapcs[a]++;
        kapcs[b]++;
    }
    int rosz[n];
    for(i=0; i<n; i++)rosz[i] = 0;
    bool veg=0;
    int num = 0;
    while(!veg)
    {
        veg = 1;
        for(i=0; i<n; i++)
        {
            if(kapcs[i]<k && !rosz[i])
            {
                veg = 0;
                num = 0;
                rosz[i] = 1;
                for(j=0; j<vec[i].size(); j++)
                {
                    kapcs[vec[i][j]]--;
                }
            }
        }
    }
    for(i=0; i<n; i++)if(!rosz[i])num++;
    cout << num << endl;
    for(i=0; i<n; i++)if(!rosz[i])cout << i+1 << " ";
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/086ms3892 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms316 KiB
8Accepted2/21ms316 KiB
9Accepted2/21ms500 KiB
10Accepted2/26ms564 KiB
11Accepted2/22ms316 KiB
12Accepted2/24ms564 KiB
13Accepted3/31ms316 KiB
14Accepted3/34ms820 KiB
15Accepted3/37ms1332 KiB
16Accepted3/378ms3076 KiB
17Accepted3/36ms820 KiB
18Accepted3/310ms2100 KiB
19Accepted3/392ms6144 KiB
20Accepted3/3163ms6968 KiB
21Accepted3/3107ms6496 KiB
22Accepted3/31ms316 KiB