#include "stdio.h" int M, E, D; int E1[200100]; int E2[200100]; int CNT[200100]; int OFF[200100]; int R[200100]; int removed[200100]; int NG[400200]; int toRemoveCnt; int toRemove[200100]; int toAddCnt; int toAdd[200100]; int main() { scanf("%i %i %i", &M, &E, &D); for (int i = 0; i <= M; i++) { CNT[i] = 0; } for (int i = 0; i < E; i++) { scanf("%i %i", &E1[i], &E2[i]); CNT[E1[i]]++; CNT[E2[i]]++; } int offset = 0; for (int i = 0; i <= M; i++) { OFF[i] = offset; offset += CNT[i]; } for (int i = 0; i <= M; i++) { CNT[i] = 0; } for (int i = 0; i < E; i++) { NG[OFF[E1[i]] + CNT[E1[i]]] = E2[i]; CNT[E1[i]]++; NG[OFF[E2[i]] + CNT[E2[i]]] = E1[i]; CNT[E2[i]]++; } for (int i = 0; i <= M; i++) { removed[i] = 0; R[i] = 0; } toRemoveCnt = 0; for (int i = 1; i <= M; i++) { if (CNT[i] < D) { toRemove[toRemoveCnt] = i; toRemoveCnt++; removed[i] = 1; } } while (toRemoveCnt > 0) { toRemoveCnt--; int id = toRemove[toRemoveCnt]; for (int i = OFF[id]; i < OFF[id] + CNT[id]; i++) { int nid = NG[i]; R[nid]++; if (CNT[nid] - R[nid] < D && removed[nid] == 0) { toRemove[toRemoveCnt] = nid; toRemoveCnt++; removed[nid] = 1; } } } int maxSum = 0; int bestID = 0; int ID = 2; for (int i = 1; i <= M; i++) { if (CNT[i] - R[i] >= D && removed[i] == 0) { ID++; int toAddCnt = 0; toAdd[toAddCnt] = i; toAddCnt++; removed[i] = ID; int sum = 0; while (toAddCnt > 0) { sum++; toAddCnt--; int id = toAdd[toAddCnt]; for (int i = OFF[id]; i < OFF[id] + CNT[id]; i++) { int nid = NG[i]; if (CNT[nid] >= D && removed[nid] == 0) { toAdd[toAddCnt] = nid; toAddCnt++; removed[nid] = ID; } } } if (sum > maxSum) { maxSum = sum; bestID = ID; } } } if (maxSum == 0) { printf("NIE\n"); } else { printf("%i\n", maxSum); for (int i = 1; i <= M; i++) { if (removed[i] == bestID) { printf("%i ", i); } } } 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 | #include "stdio.h" int M, E, D; int E1[200100]; int E2[200100]; int CNT[200100]; int OFF[200100]; int R[200100]; int removed[200100]; int NG[400200]; int toRemoveCnt; int toRemove[200100]; int toAddCnt; int toAdd[200100]; int main() { scanf("%i %i %i", &M, &E, &D); for (int i = 0; i <= M; i++) { CNT[i] = 0; } for (int i = 0; i < E; i++) { scanf("%i %i", &E1[i], &E2[i]); CNT[E1[i]]++; CNT[E2[i]]++; } int offset = 0; for (int i = 0; i <= M; i++) { OFF[i] = offset; offset += CNT[i]; } for (int i = 0; i <= M; i++) { CNT[i] = 0; } for (int i = 0; i < E; i++) { NG[OFF[E1[i]] + CNT[E1[i]]] = E2[i]; CNT[E1[i]]++; NG[OFF[E2[i]] + CNT[E2[i]]] = E1[i]; CNT[E2[i]]++; } for (int i = 0; i <= M; i++) { removed[i] = 0; R[i] = 0; } toRemoveCnt = 0; for (int i = 1; i <= M; i++) { if (CNT[i] < D) { toRemove[toRemoveCnt] = i; toRemoveCnt++; removed[i] = 1; } } while (toRemoveCnt > 0) { toRemoveCnt--; int id = toRemove[toRemoveCnt]; for (int i = OFF[id]; i < OFF[id] + CNT[id]; i++) { int nid = NG[i]; R[nid]++; if (CNT[nid] - R[nid] < D && removed[nid] == 0) { toRemove[toRemoveCnt] = nid; toRemoveCnt++; removed[nid] = 1; } } } int maxSum = 0; int bestID = 0; int ID = 2; for (int i = 1; i <= M; i++) { if (CNT[i] - R[i] >= D && removed[i] == 0) { ID++; int toAddCnt = 0; toAdd[toAddCnt] = i; toAddCnt++; removed[i] = ID; int sum = 0; while (toAddCnt > 0) { sum++; toAddCnt--; int id = toAdd[toAddCnt]; for (int i = OFF[id]; i < OFF[id] + CNT[id]; i++) { int nid = NG[i]; if (CNT[nid] >= D && removed[nid] == 0) { toAdd[toAddCnt] = nid; toAddCnt++; removed[nid] = ID; } } } if (sum > maxSum) { maxSum = sum; bestID = ID; } } } if (maxSum == 0) { printf("NIE\n"); } else { printf("%i\n", maxSum); for (int i = 1; i <= M; i++) { if (removed[i] == bestID) { printf("%i ", i); } } } return 0; } |