#include <cstdio> #include <vector> #include <queue> #include <algorithm> using namespace std; vector< vector<int> > preV, V; vector< vector<int> > group_members; vector<int> edge_count; vector<bool> visi; int n, m, d; queue<int> fixQ; void fix() { for(int i = 0; i < n; i++) { if(edge_count[i] < d) { // printf("%d has less that %d edges\n", i, d); fixQ.push(i); } } while(!fixQ.empty()) { int front = fixQ.front(); // printf("front = %d\n", front); fixQ.pop(); edge_count[front] = 0; for(int i = 0; i < preV[front].size(); i++) { // printf("\tchecking %d\n", preV[front][i]); if(edge_count[ preV[front][i] ] > 0) { // printf("\t\t%d stole one edge from %d\n", front, preV[front][i]); edge_count[ preV[front][i] ]--; } if(edge_count[ preV[front][i] ] == d-1) { // printf("\t\tcomes out that %d has less that %d edges\n", i, d); fixQ.push(preV[front][i]); } } V[front].clear(); } } void count_group(int x, int repr) { // printf("count_group(%d, %d)\n", x, repr); group_members[repr].push_back(x); visi[x] = true; for(int i = 0; i < V[x].size(); i++) if(!visi[ V[x][i] ]) count_group(V[x][i], repr); } int main() { scanf("%d%d%d", &n, &m, &d); V.resize(n); preV.resize(n); edge_count.resize(n); group_members.resize(n); visi.resize(n); int end1, end2; for(int i = 0; i < m; i++) { scanf("%d%d", &end1, &end2); end1--; end2--; preV[end1].push_back(end2); preV[end2].push_back(end1); } for(int i = 0; i < n; i++) edge_count[i] = preV[i].size(); // printf("edge_count: "); // for(int i = 0; i < n; i++) // printf("%d ", i); // // if(edge_count[i] >= d) // printf("\n"); fix(); // printf("end fix\n"); for(int i = 0; i < n; i++) { if(edge_count[i] >= d) { // is candidate for(int j = 0; j < preV[i].size(); j++) { if(edge_count[ preV[i][j] ] >= d) { V[i].push_back(preV[i][j]); } } } } // printf("edges\n"); // for(int i = 0; i < n; i++) { // if(edge_count[i] >= d) { // printf("%d:", i); // for(int j = 0; j < V[i].size(); j++) { // printf(" %d", V[i][j]); // } // printf("\n"); // } // } // printf("\n"); // printf("edge_count: "); // for(int i = 0; i < n; i++) // if(edge_count[i] >= d) // printf("%d ", edge_count[i]); // printf("\n"); // return 0; // graph V now consists only of vertices that have >= d // edges to other vertices matching this requirement for(int i = 0; i < n; i++) if(edge_count[i] >= d && !visi[i]) count_group(i, i); // printf("gm_count: "); // for(int i = 0; i < n; i++) // if(group_members[i].size() > 0) // printf("%d ", group_members[i].size()); int max_value = 0, max_group = 0; for(int i = 0; i < n; i++) { if(group_members[i].size() > max_value) { max_value = group_members[i].size(); max_group = i; } } if(max_value < d) { printf("NIE"); return 0; } sort(group_members[max_group].begin(), group_members[max_group].end()); printf("%d\n", group_members[max_group].size()); for(int i = 0; i < group_members[max_group].size(); i++) printf("%d ", group_members[max_group][i]+1); // printf("\n"); 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 | #include <cstdio> #include <vector> #include <queue> #include <algorithm> using namespace std; vector< vector<int> > preV, V; vector< vector<int> > group_members; vector<int> edge_count; vector<bool> visi; int n, m, d; queue<int> fixQ; void fix() { for(int i = 0; i < n; i++) { if(edge_count[i] < d) { // printf("%d has less that %d edges\n", i, d); fixQ.push(i); } } while(!fixQ.empty()) { int front = fixQ.front(); // printf("front = %d\n", front); fixQ.pop(); edge_count[front] = 0; for(int i = 0; i < preV[front].size(); i++) { // printf("\tchecking %d\n", preV[front][i]); if(edge_count[ preV[front][i] ] > 0) { // printf("\t\t%d stole one edge from %d\n", front, preV[front][i]); edge_count[ preV[front][i] ]--; } if(edge_count[ preV[front][i] ] == d-1) { // printf("\t\tcomes out that %d has less that %d edges\n", i, d); fixQ.push(preV[front][i]); } } V[front].clear(); } } void count_group(int x, int repr) { // printf("count_group(%d, %d)\n", x, repr); group_members[repr].push_back(x); visi[x] = true; for(int i = 0; i < V[x].size(); i++) if(!visi[ V[x][i] ]) count_group(V[x][i], repr); } int main() { scanf("%d%d%d", &n, &m, &d); V.resize(n); preV.resize(n); edge_count.resize(n); group_members.resize(n); visi.resize(n); int end1, end2; for(int i = 0; i < m; i++) { scanf("%d%d", &end1, &end2); end1--; end2--; preV[end1].push_back(end2); preV[end2].push_back(end1); } for(int i = 0; i < n; i++) edge_count[i] = preV[i].size(); // printf("edge_count: "); // for(int i = 0; i < n; i++) // printf("%d ", i); // // if(edge_count[i] >= d) // printf("\n"); fix(); // printf("end fix\n"); for(int i = 0; i < n; i++) { if(edge_count[i] >= d) { // is candidate for(int j = 0; j < preV[i].size(); j++) { if(edge_count[ preV[i][j] ] >= d) { V[i].push_back(preV[i][j]); } } } } // printf("edges\n"); // for(int i = 0; i < n; i++) { // if(edge_count[i] >= d) { // printf("%d:", i); // for(int j = 0; j < V[i].size(); j++) { // printf(" %d", V[i][j]); // } // printf("\n"); // } // } // printf("\n"); // printf("edge_count: "); // for(int i = 0; i < n; i++) // if(edge_count[i] >= d) // printf("%d ", edge_count[i]); // printf("\n"); // return 0; // graph V now consists only of vertices that have >= d // edges to other vertices matching this requirement for(int i = 0; i < n; i++) if(edge_count[i] >= d && !visi[i]) count_group(i, i); // printf("gm_count: "); // for(int i = 0; i < n; i++) // if(group_members[i].size() > 0) // printf("%d ", group_members[i].size()); int max_value = 0, max_group = 0; for(int i = 0; i < n; i++) { if(group_members[i].size() > max_value) { max_value = group_members[i].size(); max_group = i; } } if(max_value < d) { printf("NIE"); return 0; } sort(group_members[max_group].begin(), group_members[max_group].end()); printf("%d\n", group_members[max_group].size()); for(int i = 0; i < group_members[max_group].size(); i++) printf("%d ", group_members[max_group][i]+1); // printf("\n"); return 0; } |