#include <stdio.h> #include <list> class Node { public: int id; bool excluded; std::list<int> connections; int value; bool visited; Node() : id(0), excluded(false), value(0), visited(false) { } }; int main() { int n, m, d; scanf("%d %d %d", &n, &m, &d); Node* cities = new Node[n]; for (int i = 0; i < m; ++i) { int from, to; scanf("%d %d", &from, &to); --from; --to; cities[from].connections.push_back(to); cities[to].connections.push_back(from); ++cities[from].value; ++cities[to].value; } std::list<int> queue; for (int i = 0; i < n; i++) { //printf("%d: %d\n", i+1, cities[i].value); cities[i].id = i; if (cities[i].connections.size() < d) { cities[i].excluded = true; queue.push_back(i); } } while (queue.size() > 0) { int id = queue.front(); queue.pop_front(); auto it = cities[id].connections.begin(); for (; it != cities[id].connections.end(); it++) { int neighbor = *it; if (cities[neighbor].excluded == true) continue; --cities[neighbor].value; if (cities[neighbor].value < d) { cities[neighbor].excluded = true; queue.push_back(neighbor); } } } std::list<std::list<int>*> groups; for (int i = 0; i < n; ++i) { //printf("%d: %d %d\n", i + 1, cities[i].value, cities[i].excluded); if (cities[i].excluded == true || cities[i].visited == true) continue; std::list<int>* group = new std::list<int>(); group->push_back(i); cities[i].visited = true; queue.push_back(i); while (queue.size() > 0) { int id = queue.front(); queue.pop_front(); auto it = cities[id].connections.begin(); for (; it != cities[id].connections.end(); it++) { int neighbor = *it; if (cities[neighbor].excluded == true || cities[neighbor].visited == true) continue; cities[neighbor].visited = true; group->push_back(neighbor); queue.push_back(neighbor); } } groups.push_back(group); } int best = 0; std::list<int>* bestGroup; auto it = groups.begin(); for (; it != groups.end(); it++) { auto group = *it; if (group->size() > best) { best = group->size(); bestGroup = group; } } if (best > 0) { printf("%d\n", best); bestGroup->sort(); auto itg = bestGroup->begin(); for (; itg != bestGroup->end(); itg++) { printf("%d ", *itg + 1); } } else { printf("NIE\n"); } it = groups.begin(); for (; it != groups.end(); it++) { delete *it; } delete[] cities; 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 | #include <stdio.h> #include <list> class Node { public: int id; bool excluded; std::list<int> connections; int value; bool visited; Node() : id(0), excluded(false), value(0), visited(false) { } }; int main() { int n, m, d; scanf("%d %d %d", &n, &m, &d); Node* cities = new Node[n]; for (int i = 0; i < m; ++i) { int from, to; scanf("%d %d", &from, &to); --from; --to; cities[from].connections.push_back(to); cities[to].connections.push_back(from); ++cities[from].value; ++cities[to].value; } std::list<int> queue; for (int i = 0; i < n; i++) { //printf("%d: %d\n", i+1, cities[i].value); cities[i].id = i; if (cities[i].connections.size() < d) { cities[i].excluded = true; queue.push_back(i); } } while (queue.size() > 0) { int id = queue.front(); queue.pop_front(); auto it = cities[id].connections.begin(); for (; it != cities[id].connections.end(); it++) { int neighbor = *it; if (cities[neighbor].excluded == true) continue; --cities[neighbor].value; if (cities[neighbor].value < d) { cities[neighbor].excluded = true; queue.push_back(neighbor); } } } std::list<std::list<int>*> groups; for (int i = 0; i < n; ++i) { //printf("%d: %d %d\n", i + 1, cities[i].value, cities[i].excluded); if (cities[i].excluded == true || cities[i].visited == true) continue; std::list<int>* group = new std::list<int>(); group->push_back(i); cities[i].visited = true; queue.push_back(i); while (queue.size() > 0) { int id = queue.front(); queue.pop_front(); auto it = cities[id].connections.begin(); for (; it != cities[id].connections.end(); it++) { int neighbor = *it; if (cities[neighbor].excluded == true || cities[neighbor].visited == true) continue; cities[neighbor].visited = true; group->push_back(neighbor); queue.push_back(neighbor); } } groups.push_back(group); } int best = 0; std::list<int>* bestGroup; auto it = groups.begin(); for (; it != groups.end(); it++) { auto group = *it; if (group->size() > best) { best = group->size(); bestGroup = group; } } if (best > 0) { printf("%d\n", best); bestGroup->sort(); auto itg = bestGroup->begin(); for (; itg != bestGroup->end(); itg++) { printf("%d ", *itg + 1); } } else { printf("NIE\n"); } it = groups.begin(); for (; it != groups.end(); it++) { delete *it; } delete[] cities; return 0; } |