#include <cstdio> #include <vector> const int maxn=200005; using namespace std; int d,wyn,m,n; vector<int> wek[maxn]; int ile[maxn]; int fun(int x) {ile[x]=-1; wyn--; for(int i=0;i<wek[x].size();i++) { ile[wek[x][i]]--; if((ile[wek[x][i]]<d)&&(ile[wek[x][i]]>=0)) fun(wek[x][i]); } } int main() {int a,b; scanf("%d%d%d",&n,&m,&d); wyn=n+1; for(int i=0;i<m;i++) { scanf("%d%d",&a,&b); ile[a]++; ile[b]++; wek[a].push_back(b); wek[b].push_back(a); } int l=0; while(l<=n) {while(ile[++l]>=d); if(ile[l]>=0) fun(l); } if(wyn>0) { printf("%d\n",wyn); for(int i=1;(i<=n)&&(wyn>0);i++) if(ile[i]>=d) {printf("%d ",i); wyn--; } } else printf("NIE"); }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 | #include <cstdio> #include <vector> const int maxn=200005; using namespace std; int d,wyn,m,n; vector<int> wek[maxn]; int ile[maxn]; int fun(int x) {ile[x]=-1; wyn--; for(int i=0;i<wek[x].size();i++) { ile[wek[x][i]]--; if((ile[wek[x][i]]<d)&&(ile[wek[x][i]]>=0)) fun(wek[x][i]); } } int main() {int a,b; scanf("%d%d%d",&n,&m,&d); wyn=n+1; for(int i=0;i<m;i++) { scanf("%d%d",&a,&b); ile[a]++; ile[b]++; wek[a].push_back(b); wek[b].push_back(a); } int l=0; while(l<=n) {while(ile[++l]>=d); if(ile[l]>=0) fun(l); } if(wyn>0) { printf("%d\n",wyn); for(int i=1;(i<=n)&&(wyn>0);i++) if(ile[i]>=d) {printf("%d ",i); wyn--; } } else printf("NIE"); } |