//package com.company; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.io.PrintWriter; import java.lang.Integer; import java.util.*; /** * Kornel * PA2015/2B/MIS */ public class mis { private static final int MAX = 200005; private static int N; private static int M; private static int D; private static City[] city = new City[MAX]; public static final String NO_WAY = "NIE"; public static void main(String[] args) throws IOException { long time = System.currentTimeMillis(); BufferedReader in = new BufferedReader(new InputStreamReader(System.in)); PrintWriter out = new PrintWriter(System.out); String[] res = in.readLine().split(" "); N = Integer.valueOf(res[0]); M = Integer.valueOf(res[1]); D = Integer.valueOf(res[2]); int from; int to; for (int i = 1; i <= M; i++) { res = in.readLine().split(" "); from = Integer.valueOf(res[0]); to = Integer.valueOf(res[1]); if (city[from] == null) { city[from] = new City(from); } if (city[to] == null) { city[to] = new City(to); } city[from].connected.add(to); city[to].connected.add(from); } List<City> list = new LinkedList<>(); for (int i = 0; i < MAX; i++) { if (city[i] != null) { list.add(city[i]); } } City c; int size; while (true) { size = list.size(); Iterator<City> iter = list.iterator(); while (iter.hasNext()) { c = iter.next(); if (c.connected.size() < D) { c.remove(); iter.remove(); } } if (size == list.size()) { break; } } int maxGroup = 0; int maxGroupSize = 0; int group = 1; int groupSize; Iterator<City> iter = list.iterator(); while (iter.hasNext()) { c = iter.next(); groupSize = bfs(c.id, group); if (groupSize > maxGroupSize) { maxGroupSize = groupSize; maxGroup = group; } group++; } if (size == 0) { out.println(NO_WAY); } else { out.println(maxGroupSize); iter = list.iterator(); while (iter.hasNext()) { c = iter.next(); if (c.group == maxGroup) { out.print(c.id + " "); } } } out.flush(); } public static int bfs(int startFrom, int group) { if (city[startFrom].group != 0) { return -1; } int groupSize = 0; Queue<Integer> queue = new LinkedList<>(); queue.add(startFrom); city[startFrom].visited = true; city[startFrom].group = group; groupSize++; while(!queue.isEmpty()) { Integer parent = queue.remove(); int size = city[parent].connected.size(); for (int i = 0; i < size; i++) { Integer child = city[parent].connected.get(i); if (!city[child].visited) { city[child].visited = true; city[child].group = group; groupSize++; queue.add(child); } } } return groupSize; } static class City { List<Integer> connected = new ArrayList<>(); boolean isRemoved; boolean visited; int id; int group; public City(int id) { this.id = id; } public void remove() { isRemoved = true; for (int i = 0; i < connected.size(); i++) { int index = city[connected.get(i)].connected.indexOf(id); if (index != -1) { city[connected.get(i)].connected.remove(index); } } } } }
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 | //package com.company; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.io.PrintWriter; import java.lang.Integer; import java.util.*; /** * Kornel * PA2015/2B/MIS */ public class mis { private static final int MAX = 200005; private static int N; private static int M; private static int D; private static City[] city = new City[MAX]; public static final String NO_WAY = "NIE"; public static void main(String[] args) throws IOException { long time = System.currentTimeMillis(); BufferedReader in = new BufferedReader(new InputStreamReader(System.in)); PrintWriter out = new PrintWriter(System.out); String[] res = in.readLine().split(" "); N = Integer.valueOf(res[0]); M = Integer.valueOf(res[1]); D = Integer.valueOf(res[2]); int from; int to; for (int i = 1; i <= M; i++) { res = in.readLine().split(" "); from = Integer.valueOf(res[0]); to = Integer.valueOf(res[1]); if (city[from] == null) { city[from] = new City(from); } if (city[to] == null) { city[to] = new City(to); } city[from].connected.add(to); city[to].connected.add(from); } List<City> list = new LinkedList<>(); for (int i = 0; i < MAX; i++) { if (city[i] != null) { list.add(city[i]); } } City c; int size; while (true) { size = list.size(); Iterator<City> iter = list.iterator(); while (iter.hasNext()) { c = iter.next(); if (c.connected.size() < D) { c.remove(); iter.remove(); } } if (size == list.size()) { break; } } int maxGroup = 0; int maxGroupSize = 0; int group = 1; int groupSize; Iterator<City> iter = list.iterator(); while (iter.hasNext()) { c = iter.next(); groupSize = bfs(c.id, group); if (groupSize > maxGroupSize) { maxGroupSize = groupSize; maxGroup = group; } group++; } if (size == 0) { out.println(NO_WAY); } else { out.println(maxGroupSize); iter = list.iterator(); while (iter.hasNext()) { c = iter.next(); if (c.group == maxGroup) { out.print(c.id + " "); } } } out.flush(); } public static int bfs(int startFrom, int group) { if (city[startFrom].group != 0) { return -1; } int groupSize = 0; Queue<Integer> queue = new LinkedList<>(); queue.add(startFrom); city[startFrom].visited = true; city[startFrom].group = group; groupSize++; while(!queue.isEmpty()) { Integer parent = queue.remove(); int size = city[parent].connected.size(); for (int i = 0; i < size; i++) { Integer child = city[parent].connected.get(i); if (!city[child].visited) { city[child].visited = true; city[child].group = group; groupSize++; queue.add(child); } } } return groupSize; } static class City { List<Integer> connected = new ArrayList<>(); boolean isRemoved; boolean visited; int id; int group; public City(int id) { this.id = id; } public void remove() { isRemoved = true; for (int i = 0; i < connected.size(); i++) { int index = city[connected.get(i)].connected.indexOf(id); if (index != -1) { city[connected.get(i)].connected.remove(index); } } } } } |