#include <cstdio> #include <vector> #include <set> #define FOR(i,b,e) for(int i=(b); i <= (e); ++i) #define SIZE(c) (int) (c).size() #define FORE(i,c) FOR(i,0,SIZE(c)-1) #define PB push_back #define MP make_pair #define ST first #define ND second using namespace std; typedef pair < int , int > PII; typedef vector < int > VI; typedef vector < bool > VB; typedef vector < VI > VVI; /*************************************************************************/ struct FAU { int cnt; VI p, r; FAU(int n) { cnt = n; p.resize(n,-1); r.resize(n,0); } int Find(int x) { if (p[x] == -1) return x; p[x] = Find(p[x]); return p[x]; } void Union(int x, int y) { x = Find(x); y = Find(y); if (x == y) return ; cnt--; if (r[x] > r[y]) p[y] = x; else p[x] = y; if (r[x] == r[y]) ++r[y]; return ; } }; /*************************************************************************/ int main() { int n, m, d; scanf("%d%d%d", &n, &m, &d); VVI G(n); FOR(i,1,m) { int u, v; scanf("%d%d", &u, &v); u--; v--; G[u].PB(v); G[v].PB(u); } VI deg(n); FORE(i,deg) deg[i] = SIZE(G[i]); set < PII > S; FOR(i,0,n-1) S.insert(MP(deg[i], i)); VI is(n,1); while (!S.empty() && S.begin()->ST < d) { int v = S.begin()->ND; S.erase(S.begin()); is[v] = 0; for (int u : G[v]) if (is[u]) { S.erase(MP(deg[u], u)); deg[u]--; S.insert(MP(deg[u], u)); } } if (S.empty()) printf("NIE"); else { FAU F(n); FOR(v,0,n-1) for (int u : G[v]) if (is[v] && is[u]) F.Union(u,v); VVI C(n); FOR(v,0,n-1) if (is[v]) C[ F.Find(v) ].PB(v); int mx = -1; FORE(i,C) mx = max(mx, SIZE(C[i])); FORE(i,C) if (SIZE(C[i]) == mx) { printf("%d\n", mx); for (int v : C[i]) printf("%d ", 1 + v); break; } } return 0; } /*************************************************************************/
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 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 | #include <cstdio> #include <vector> #include <set> #define FOR(i,b,e) for(int i=(b); i <= (e); ++i) #define SIZE(c) (int) (c).size() #define FORE(i,c) FOR(i,0,SIZE(c)-1) #define PB push_back #define MP make_pair #define ST first #define ND second using namespace std; typedef pair < int , int > PII; typedef vector < int > VI; typedef vector < bool > VB; typedef vector < VI > VVI; /*************************************************************************/ struct FAU { int cnt; VI p, r; FAU(int n) { cnt = n; p.resize(n,-1); r.resize(n,0); } int Find(int x) { if (p[x] == -1) return x; p[x] = Find(p[x]); return p[x]; } void Union(int x, int y) { x = Find(x); y = Find(y); if (x == y) return ; cnt--; if (r[x] > r[y]) p[y] = x; else p[x] = y; if (r[x] == r[y]) ++r[y]; return ; } }; /*************************************************************************/ int main() { int n, m, d; scanf("%d%d%d", &n, &m, &d); VVI G(n); FOR(i,1,m) { int u, v; scanf("%d%d", &u, &v); u--; v--; G[u].PB(v); G[v].PB(u); } VI deg(n); FORE(i,deg) deg[i] = SIZE(G[i]); set < PII > S; FOR(i,0,n-1) S.insert(MP(deg[i], i)); VI is(n,1); while (!S.empty() && S.begin()->ST < d) { int v = S.begin()->ND; S.erase(S.begin()); is[v] = 0; for (int u : G[v]) if (is[u]) { S.erase(MP(deg[u], u)); deg[u]--; S.insert(MP(deg[u], u)); } } if (S.empty()) printf("NIE"); else { FAU F(n); FOR(v,0,n-1) for (int u : G[v]) if (is[v] && is[u]) F.Union(u,v); VVI C(n); FOR(v,0,n-1) if (is[v]) C[ F.Find(v) ].PB(v); int mx = -1; FORE(i,C) mx = max(mx, SIZE(C[i])); FORE(i,C) if (SIZE(C[i]) == mx) { printf("%d\n", mx); for (int v : C[i]) printf("%d ", 1 + v); break; } } return 0; } /*************************************************************************/ |