import java.io.BufferedInputStream; import java.io.BufferedOutputStream; import java.io.InputStream; import java.io.OutputStream; import java.util.ArrayList; import java.util.Collections; import java.util.Comparator; import java.util.List; public class mis { static class Vertex { public Vertex(int nr) { this.nr = nr; } List<Vertex> neighbours = new ArrayList<Vertex>(); boolean visited = false; int dd = 0; int nr, heapIndex; } static Vertex[] heap; static int heapSize; static void up(int i) { Vertex v = heap[i]; while (i > 1) { int p = i / 2; Vertex pv = heap[p]; if (v.dd >= pv.dd) break; pv.heapIndex = i; heap[i] = pv; i = p; } v.heapIndex = i; heap[i] = v; } static void down(int i) { Vertex v = heap[i]; while (2 * i <= heapSize) { int c = 2 * i; Vertex cv = heap[c]; if (c + 1 <= heapSize && heap[c + 1].dd < heap[c].dd) { c = c + 1; cv = heap[c]; } if (v.dd <= cv.dd) break; cv.heapIndex = i; heap[i] = cv; i = c; } v.heapIndex = i; heap[i] = v; } public static void main(String[] args) { int n = R.i(); int m = R.i(); int d = R.i(); Vertex[] vertices = new Vertex[n + 1]; for (int i = 1; i <= n; i++) { vertices[i] = new Vertex(i); } int a, b; for (int i = 0; i < m; i++) { a = R.i(); b = R.i(); vertices[a].neighbours.add(vertices[b]); vertices[b].neighbours.add(vertices[a]); } heap = new Vertex[n + 1]; heapSize = 0; for (int i = 1; i <= n; i++) { vertices[i].dd = vertices[i].neighbours.size(); heap[i] = vertices[i]; heapSize++; up(i); } while (heapSize > 1 && heap[1].dd < d) { Vertex top = heap[1]; top.dd = 0; top.heapIndex = 0; heap[1] = heap[heapSize]; heapSize--; down(1); for (Vertex v : top.neighbours) { if (v.heapIndex > 0) { v.dd--; up(v.heapIndex); } } } if (heapSize <= 1) { W.ss("NIE"); } else { List<Vertex> bestSet = null; for (int i = 1; i <= heapSize; i++) { Vertex v = heap[i]; if (!v.visited && v.heapIndex > 0) { List<Vertex> set = new ArrayList<Vertex>(); set.add(v); v.visited = true; int j = 0; while (j < set.size()) { for (Vertex nv : set.get(j).neighbours) { if (!nv.visited && nv.heapIndex > 0) { set.add(nv); nv.visited = true; } } j++; } if (bestSet == null || set.size() > bestSet.size()) { bestSet = set; } } } if (bestSet == null) { W.ss("NIE"); } else { W.in(bestSet.size()); Collections.sort(bestSet, new Comparator<Vertex>() { @Override public int compare(Vertex o1, Vertex o2) { return o1.nr - o2.nr; } }); for (Vertex v : bestSet) { W.is(v.nr); } W.newLine(); } } W.flush(); } static class R { static InputStream is=new BufferedInputStream(System.in); static int b='\n'; static void next(){try{b=is.read();}catch(Exception e){}} static void skip(){while(b=='\n'||b==' '||b=='\r'||b=='\t')next();} static char c(){skip();char c=(char)b;next();return c;} static int i(){skip();int i=0;while(b>='0'&&b<='9'){i=10*i+(b-'0');next();}return i;} static long l(){skip();long i=0;while(b>='0'&&b<='9'){i=10*i+(b-'0');next();}return i;} } static class W { static OutputStream os=new BufferedOutputStream(System.out,4096); static void b(int b){try{os.write(b);}catch(Exception e){}} static void c(char c){b(c);} static void cs(char c){c(c);space();} static void cn(char c){c(c);newLine();} static void i(int i){if(i>9)i(i/10);b('0'+(i%10));} static void is(int i){i(i);space();} static void in(int i){i(i);newLine();} static void l(long l){if(l>9)l(l/10);b('0'+(int)(l%10));} static void ls(long l){l(l);space();} static void ln(long l){l(l);newLine();} static void s(String s){try{os.write(s.getBytes());}catch(Exception e){}} static void ss(String s){s(s);space();} static void sn(String s){s(s);newLine();} static void tn(boolean b){sn(b?"TAK":"NIE");} static void space(){b(' ');} static void newLine(){b('\n');} static void flush(){try{os.flush();}catch(Exception e){}}; } static class T { static List<String> s=new ArrayList<String>(); static List<Long> t=new ArrayList<Long>(); static void t(String n){s.add(n);t.add(System.currentTimeMillis());} static void err(){t.add(System.currentTimeMillis());System.err.println();for(int i=0;i<s.size();i++){System.err.println(s.get(i)+": "+(t.get(i+1)-t.get(i)));}System.err.println("TOTAL: "+(t.get(t.size() - 1)-t.get(0)));System.err.flush();} } }
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 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 | import java.io.BufferedInputStream; import java.io.BufferedOutputStream; import java.io.InputStream; import java.io.OutputStream; import java.util.ArrayList; import java.util.Collections; import java.util.Comparator; import java.util.List; public class mis { static class Vertex { public Vertex(int nr) { this.nr = nr; } List<Vertex> neighbours = new ArrayList<Vertex>(); boolean visited = false; int dd = 0; int nr, heapIndex; } static Vertex[] heap; static int heapSize; static void up(int i) { Vertex v = heap[i]; while (i > 1) { int p = i / 2; Vertex pv = heap[p]; if (v.dd >= pv.dd) break; pv.heapIndex = i; heap[i] = pv; i = p; } v.heapIndex = i; heap[i] = v; } static void down(int i) { Vertex v = heap[i]; while (2 * i <= heapSize) { int c = 2 * i; Vertex cv = heap[c]; if (c + 1 <= heapSize && heap[c + 1].dd < heap[c].dd) { c = c + 1; cv = heap[c]; } if (v.dd <= cv.dd) break; cv.heapIndex = i; heap[i] = cv; i = c; } v.heapIndex = i; heap[i] = v; } public static void main(String[] args) { int n = R.i(); int m = R.i(); int d = R.i(); Vertex[] vertices = new Vertex[n + 1]; for (int i = 1; i <= n; i++) { vertices[i] = new Vertex(i); } int a, b; for (int i = 0; i < m; i++) { a = R.i(); b = R.i(); vertices[a].neighbours.add(vertices[b]); vertices[b].neighbours.add(vertices[a]); } heap = new Vertex[n + 1]; heapSize = 0; for (int i = 1; i <= n; i++) { vertices[i].dd = vertices[i].neighbours.size(); heap[i] = vertices[i]; heapSize++; up(i); } while (heapSize > 1 && heap[1].dd < d) { Vertex top = heap[1]; top.dd = 0; top.heapIndex = 0; heap[1] = heap[heapSize]; heapSize--; down(1); for (Vertex v : top.neighbours) { if (v.heapIndex > 0) { v.dd--; up(v.heapIndex); } } } if (heapSize <= 1) { W.ss("NIE"); } else { List<Vertex> bestSet = null; for (int i = 1; i <= heapSize; i++) { Vertex v = heap[i]; if (!v.visited && v.heapIndex > 0) { List<Vertex> set = new ArrayList<Vertex>(); set.add(v); v.visited = true; int j = 0; while (j < set.size()) { for (Vertex nv : set.get(j).neighbours) { if (!nv.visited && nv.heapIndex > 0) { set.add(nv); nv.visited = true; } } j++; } if (bestSet == null || set.size() > bestSet.size()) { bestSet = set; } } } if (bestSet == null) { W.ss("NIE"); } else { W.in(bestSet.size()); Collections.sort(bestSet, new Comparator<Vertex>() { @Override public int compare(Vertex o1, Vertex o2) { return o1.nr - o2.nr; } }); for (Vertex v : bestSet) { W.is(v.nr); } W.newLine(); } } W.flush(); } static class R { static InputStream is=new BufferedInputStream(System.in); static int b='\n'; static void next(){try{b=is.read();}catch(Exception e){}} static void skip(){while(b=='\n'||b==' '||b=='\r'||b=='\t')next();} static char c(){skip();char c=(char)b;next();return c;} static int i(){skip();int i=0;while(b>='0'&&b<='9'){i=10*i+(b-'0');next();}return i;} static long l(){skip();long i=0;while(b>='0'&&b<='9'){i=10*i+(b-'0');next();}return i;} } static class W { static OutputStream os=new BufferedOutputStream(System.out,4096); static void b(int b){try{os.write(b);}catch(Exception e){}} static void c(char c){b(c);} static void cs(char c){c(c);space();} static void cn(char c){c(c);newLine();} static void i(int i){if(i>9)i(i/10);b('0'+(i%10));} static void is(int i){i(i);space();} static void in(int i){i(i);newLine();} static void l(long l){if(l>9)l(l/10);b('0'+(int)(l%10));} static void ls(long l){l(l);space();} static void ln(long l){l(l);newLine();} static void s(String s){try{os.write(s.getBytes());}catch(Exception e){}} static void ss(String s){s(s);space();} static void sn(String s){s(s);newLine();} static void tn(boolean b){sn(b?"TAK":"NIE");} static void space(){b(' ');} static void newLine(){b('\n');} static void flush(){try{os.flush();}catch(Exception e){}}; } static class T { static List<String> s=new ArrayList<String>(); static List<Long> t=new ArrayList<Long>(); static void t(String n){s.add(n);t.add(System.currentTimeMillis());} static void err(){t.add(System.currentTimeMillis());System.err.println();for(int i=0;i<s.size();i++){System.err.println(s.get(i)+": "+(t.get(i+1)-t.get(i)));}System.err.println("TOTAL: "+(t.get(t.size() - 1)-t.get(0)));System.err.flush();} } } |