結果
問題 | No.317 辺の追加 |
ユーザー |
![]() |
提出日時 | 2015-12-10 10:58:21 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 543 ms / 2,000 ms |
コード長 | 5,743 bytes |
コンパイル時間 | 2,359 ms |
コンパイル使用メモリ | 81,784 KB |
実行使用メモリ | 71,932 KB |
最終ジャッジ日時 | 2024-09-15 07:27:53 |
合計ジャッジ時間 | 19,465 ms |
ジャッジサーバーID (参考情報) |
judge6 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 38 |
ソースコード
package no317;import java.io.IOException;import java.io.InputStream;import java.io.PrintWriter;import java.util.ArrayDeque;import java.util.ArrayList;import java.util.Arrays;import java.util.Collections;import java.util.InputMismatchException;import java.util.NoSuchElementException;import java.util.Queue;public class Main {public static void main(String[] args) {IO io = new IO();int n = io.nextInt();int m = io.nextInt();Graph g = new Graph(n);for(int i=0;i<m;i++) {int u = io.nextInt()-1;int v = io.nextInt()-1;g.addBidirectionalEdge(u, v, 1);}ArrayList<Integer> a = g.cc();Collections.sort(a);int[] dp = new int[n+1];Arrays.fill(dp, 1<<29);dp[0] = -1;int max = 0;for(int i=0;i<a.size();i++) {int num = a.get(i);int count = 1;while(i+1<a.size() && a.get(i+1)==num) {count++;i++;}for(int c=1;count>0;c<<=1) {int x = Math.min(c,count);int y = num * x;max += y;for(int j=max;j>=y;j--) {dp[j] = Math.min(dp[j], dp[j-y] + x);}count -= x;}}for(int i=1;i<=n;i++) {io.println(dp[i] >= 1 << 29 ? -1 : dp[i]);}io.flush();}}class Graph {public static final int INF = 1<<29;int n;ArrayList<Edge>[] graph;@SuppressWarnings("unchecked")public Graph(int n) {this.n = n;this.graph = new ArrayList[n];for(int i=0;i<n;i++) {graph[i] = new ArrayList<Edge>();}}public void addBidirectionalEdge(int from,int to,int cost) {addEdge(from,to,cost);addEdge(to,from,cost);}public void addEdge(int from,int to,int cost) {graph[from].add(new Edge(to, cost));}public ArrayList<Integer> cc() {ArrayList<Integer> ret = new ArrayList<Integer>();boolean[] used = new boolean[n];for(int i=0;i<n;i++) {if (!used[i]) {int size = 1;Queue<Integer> q = new ArrayDeque<>();used[i] = true;q.offer(i);while(!q.isEmpty()) {int v = q.poll();for(Edge e:graph[v]) {int u = e.to;if (!used[u]) {used[u] = true;size++;q.offer(u);}}}ret.add(size);}}return ret;}class Edge {int to;int cost;public Edge(int to,int cost) {this.to = to;this.cost = cost;}}}class IO extends PrintWriter {private final InputStream in;private final byte[] buffer = new byte[1024];private int ptr = 0;private int buflen = 0;public IO() { this(System.in);}public IO(InputStream source) { super(System.out); this.in = source;}private boolean hasNextByte() {if (ptr < buflen) {return true;}else{ptr = 0;try {buflen = in.read(buffer);} catch (IOException e) {e.printStackTrace();}if (buflen <= 0) {return false;}}return true;}private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}public boolean hasNextLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++; return hasNextByte();}public String next() {if (!hasNext()) {throw new NoSuchElementException();}StringBuilder sb = new StringBuilder();int b = readByte();while(isPrintableChar(b)) {sb.appendCodePoint(b);b = readByte();}return sb.toString();}public char[] nextCharArray(int len) {if (!hasNext()) {throw new NoSuchElementException();}char[] s = new char[len];int i = 0;int b = readByte();while(isPrintableChar(b)) {if (i == len) {throw new InputMismatchException();}s[i++] = (char) b;b = readByte();}return s;}public String nextLine() {if (!hasNextLine()) {throw new NoSuchElementException();}StringBuilder sb = new StringBuilder();int b = readByte();while(!isNewLine(b)) {sb.appendCodePoint(b);b = readByte();}return sb.toString();}public long nextLong() {if (!hasNext()) {throw new NoSuchElementException();}long n = 0;boolean minus = false;int b = readByte();if (b == '-') {minus = true;b = readByte();}if (b < '0' || '9' < b) {throw new NumberFormatException();}while(true){if ('0' <= b && b <= '9') {n *= 10;n += b - '0';}else if(b == -1 || !isPrintableChar(b)){return minus ? -n : n;}else{throw new NumberFormatException();}b = readByte();}}public int nextInt() {long nl = nextLong();if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {throw new NumberFormatException();}return (int) nl;}public char nextChar() {if (!hasNext()) {throw new NoSuchElementException();}return (char) readByte();}public double nextDouble() { return Double.parseDouble(next());}public int[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}public long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}public void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;}public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}public void close() { super.close(); try {in.close();} catch (IOException e) {}}}