#include <cstdio> #include <set> #include <algorithm> using namespace std; const int MAX = 200005; struct node { set<int> neig; int degree; } cities[MAX]; bool master[MAX]; struct cmp { bool operator()(const int &a, const int &b) { if (cities[a].degree != cities[b].degree) { return cities[a].degree < cities[b].degree; } return a < b; } }; int n, m, d; int main(int argc, char ** argv) { scanf("%d %d %d", &n, &m, &d); int a, b; for (int i = 1; i <= m; ++i) { scanf("%d %d", &a, &b); cities[a].degree++; cities[a].neig.insert(b); cities[b].degree++; cities[b].neig.insert(a); } set<int, cmp> degrees; int degreesSize = 0; for (int i = 1; i <= n; ++i) { degrees.insert(i); degreesSize++; } while (degreesSize > 0) { int lowest = *degrees.begin(); //printf("low %d", lowest); //printf("degree %d", cities[lowest].degree); if (cities[lowest].degree >= d) { break; } node city = cities[lowest]; for (set<int>::iterator it = city.neig.begin(); it != city.neig.end(); ++it) { cities[*it].neig.erase(lowest); degrees.erase(*it); cities[*it].degree--; degrees.insert(*it); } degrees.erase(lowest); city.degree = 0; degreesSize--; } if (degreesSize <= 0) { printf("NIE\n"); return 0; } printf("%d\n", degreesSize); for (set<int>::iterator it = degrees.begin(); it != degrees.end(); ++it) { master[*it] = true; } for(int i = 1; i <= n; ++i) { if (master[i] == true) { printf("%d ", i); } } 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 | #include <cstdio> #include <set> #include <algorithm> using namespace std; const int MAX = 200005; struct node { set<int> neig; int degree; } cities[MAX]; bool master[MAX]; struct cmp { bool operator()(const int &a, const int &b) { if (cities[a].degree != cities[b].degree) { return cities[a].degree < cities[b].degree; } return a < b; } }; int n, m, d; int main(int argc, char ** argv) { scanf("%d %d %d", &n, &m, &d); int a, b; for (int i = 1; i <= m; ++i) { scanf("%d %d", &a, &b); cities[a].degree++; cities[a].neig.insert(b); cities[b].degree++; cities[b].neig.insert(a); } set<int, cmp> degrees; int degreesSize = 0; for (int i = 1; i <= n; ++i) { degrees.insert(i); degreesSize++; } while (degreesSize > 0) { int lowest = *degrees.begin(); //printf("low %d", lowest); //printf("degree %d", cities[lowest].degree); if (cities[lowest].degree >= d) { break; } node city = cities[lowest]; for (set<int>::iterator it = city.neig.begin(); it != city.neig.end(); ++it) { cities[*it].neig.erase(lowest); degrees.erase(*it); cities[*it].degree--; degrees.insert(*it); } degrees.erase(lowest); city.degree = 0; degreesSize--; } if (degreesSize <= 0) { printf("NIE\n"); return 0; } printf("%d\n", degreesSize); for (set<int>::iterator it = degrees.begin(); it != degrees.end(); ++it) { master[*it] = true; } for(int i = 1; i <= n; ++i) { if (master[i] == true) { printf("%d ", i); } } printf("\n"); return 0; } |