151312025-02-13 11:21:43BencuHálózati biztonság (50)cpp17Accepted 50/5093ms8900 KiB
#include <bits/stdc++.h>

using namespace std;
int n,m,k,ma,M[100001];
//vector <vector<int>szom,<int> fok>L;
struct Bencu{
    vector<int>szom;
    int fok;
    int csucs;
} L[100001];
void torol (int i) {
    L[i].fok=0;
    for (int j=0; j<L[i].csucs; j++) {
            L[L[i].szom[j]].fok--;
                if (L[L[i].szom[j]].fok<k && L[L[i].szom[j]].fok>0) torol(L[i].szom[j]);
    }
}
int main()
{
    ifstream f("be.in");
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin>>n>>m>>k;
    for (int i=1; i<=m; i++) {
        int x,y;
        cin>>x>>y;
        L[x].szom.push_back(y);
        L[x].fok++;
        L[x].csucs++;
        L[y].szom.push_back(x);
        L[y].fok++;
        L[y].csucs++;
    }
    for (int i=1; i<=n; i++) {
        if (L[i].fok<k && L[i].fok>0) {
            torol(i);
        }
    }
    for (int i=1; i<=n; i++) {
        if (L[i].fok>0) {
            M[ma]=i;
            ma++;
        }
    }
    cout<<ma<<endl;
    for (int i=0; i<ma; i++) cout<<M[i]<<" ";
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/03ms3380 KiB
2Accepted0/050ms6196 KiB
3Accepted2/24ms3500 KiB
4Accepted2/24ms3380 KiB
5Accepted2/23ms3380 KiB
6Accepted2/24ms3396 KiB
7Accepted2/23ms3380 KiB
8Accepted2/24ms3380 KiB
9Accepted2/24ms3380 KiB
10Accepted2/27ms3668 KiB
11Accepted2/24ms3576 KiB
12Accepted2/26ms3640 KiB
13Accepted3/33ms3380 KiB
14Accepted3/36ms3732 KiB
15Accepted3/38ms3856 KiB
16Accepted3/348ms5732 KiB
17Accepted3/36ms3636 KiB
18Accepted3/37ms3696 KiB
19Accepted3/368ms6984 KiB
20Accepted3/393ms8900 KiB
21Accepted3/357ms7328 KiB
22Accepted3/33ms3380 KiB