#include<cstdio> #include<vector> #include<algorithm> #include<set> #include<iostream> using namespace std; #define rep(i,n) for(int i=0; i<(int)n; i++) #define st first #define nd second #define mp make_pair #define pb push_back typedef vector<int> vi; typedef pair<int, int> pi; typedef vector<pi> vpii; typedef set<int> SI; #ifdef DEBUG const bool debug = true; #else const bool debug = false; #endif int n, m, k, l, d, a, b; const int inf = 1000 * 1000 * 1000 ; const int MAKSN = 1000 * 1000 + 13; // UZUPElnic long long mini = inf; long long sum = 0; set<int> E[MAKSN]; bool usable[MAKSN] = {true}; bool vis[MAKSN] = {false}; int deg[MAKSN]; int num[MAKSN] = { -1}; vector<int> toDel; void readIn() { scanf("%d %d %d", &n, &m, &d); rep(i, m) { scanf("%d %d", &a, &b); a--; b--; E[a].insert(b); E[b].insert(a); } rep(i, n) { deg[i] = E[i].size(); if (deg[i] < d) toDel.pb(i); } rep(i, MAKSN) { num[i] = -1; vis[i] = false; } } void deleteAll() { while (!toDel.empty()) { int akt = toDel.back(); toDel.pop_back(); for (set<int>::iterator it = E[akt].begin(); it != E[akt].end(); it++) { E[*it].erase(akt); if ((int)E[*it].size() < d) toDel.pb(*it); } E[akt].clear(); } } void dfs(int akt, int nr) { // printf("ide do %d\n",akt); vis[akt] = true; num[akt] = nr; for (set<int>::iterator it = E[akt].begin(); it != E[akt].end(); it++) { if (!vis[*it]) { dfs(*it, nr); } } } void solve() { deleteAll(); int ile[MAKSN]; rep(i, n) { // printf("%d ",num[i]); if (!vis[i] && E[i].size() > 0) { // printf("weszlem\n"); dfs(i, i); } // printf("%d\n",num[i]); ile[i] = 0; } int akt_maks = 0; int nr_maks = 0; rep(i, n) { if (num[i] < 0) continue; ile[num[i]]++; if (ile[num[i]] > akt_maks) { akt_maks = ile[num[i]]; nr_maks = num[i]; } } if (akt_maks > d) { printf("%d\n", akt_maks); rep(i, n) { if (num[i] == nr_maks) { printf("%d ", i + 1); } } printf("\n"); } else printf("NIE\n"); } int main() { readIn(); solve(); 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 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 | #include<cstdio> #include<vector> #include<algorithm> #include<set> #include<iostream> using namespace std; #define rep(i,n) for(int i=0; i<(int)n; i++) #define st first #define nd second #define mp make_pair #define pb push_back typedef vector<int> vi; typedef pair<int, int> pi; typedef vector<pi> vpii; typedef set<int> SI; #ifdef DEBUG const bool debug = true; #else const bool debug = false; #endif int n, m, k, l, d, a, b; const int inf = 1000 * 1000 * 1000 ; const int MAKSN = 1000 * 1000 + 13; // UZUPElnic long long mini = inf; long long sum = 0; set<int> E[MAKSN]; bool usable[MAKSN] = {true}; bool vis[MAKSN] = {false}; int deg[MAKSN]; int num[MAKSN] = { -1}; vector<int> toDel; void readIn() { scanf("%d %d %d", &n, &m, &d); rep(i, m) { scanf("%d %d", &a, &b); a--; b--; E[a].insert(b); E[b].insert(a); } rep(i, n) { deg[i] = E[i].size(); if (deg[i] < d) toDel.pb(i); } rep(i, MAKSN) { num[i] = -1; vis[i] = false; } } void deleteAll() { while (!toDel.empty()) { int akt = toDel.back(); toDel.pop_back(); for (set<int>::iterator it = E[akt].begin(); it != E[akt].end(); it++) { E[*it].erase(akt); if ((int)E[*it].size() < d) toDel.pb(*it); } E[akt].clear(); } } void dfs(int akt, int nr) { // printf("ide do %d\n",akt); vis[akt] = true; num[akt] = nr; for (set<int>::iterator it = E[akt].begin(); it != E[akt].end(); it++) { if (!vis[*it]) { dfs(*it, nr); } } } void solve() { deleteAll(); int ile[MAKSN]; rep(i, n) { // printf("%d ",num[i]); if (!vis[i] && E[i].size() > 0) { // printf("weszlem\n"); dfs(i, i); } // printf("%d\n",num[i]); ile[i] = 0; } int akt_maks = 0; int nr_maks = 0; rep(i, n) { if (num[i] < 0) continue; ile[num[i]]++; if (ile[num[i]] > akt_maks) { akt_maks = ile[num[i]]; nr_maks = num[i]; } } if (akt_maks > d) { printf("%d\n", akt_maks); rep(i, n) { if (num[i] == nr_maks) { printf("%d ", i + 1); } } printf("\n"); } else printf("NIE\n"); } int main() { readIn(); solve(); return 0; } |