結果
問題 | No.277 根掘り葉掘り |
ユーザー |
![]() |
提出日時 | 2015-10-19 01:21:00 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 417 ms / 3,000 ms |
コード長 | 3,746 bytes |
コンパイル時間 | 2,774 ms |
コンパイル使用メモリ | 82,808 KB |
実行使用メモリ | 72,492 KB |
最終ジャッジ日時 | 2024-07-21 19:17:04 |
合計ジャッジ時間 | 8,924 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 18 |
ソースコード
import java.io.InputStream;import java.io.IOException;import java.io.PrintWriter;import java.util.ArrayDeque;import java.util.ArrayList;import java.util.Arrays;import java.util.Comparator;import java.util.Deque;import java.util.InputMismatchException;import java.util.NoSuchElementException;import java.math.BigDecimal;import java.math.BigInteger;public class Main{static PrintWriter out;static InputReader ir;static final int INF=Integer.MAX_VALUE;static final long LINF=Long.MAX_VALUE;static void solve(){int n=ir.nextInt();AdjacencyList[] tree=new AdjacencyList[n];int[] dist=new int[n];Arrays.fill(dist,INF);for(int i=0;i<n;i++) tree[i]=new AdjacencyList();for(int i=0;i<n-1;i++){int x=ir.nextInt()-1;int y=ir.nextInt()-1;tree[x].add(y);tree[y].add(x);}Deque<Integer> q=new ArrayDeque<>();q.offerLast(0);dist[0]=0;for(int i=1;i<n;i++)if(tree[i].size()==1){q.offerLast(i);dist[i]=0;}while(!q.isEmpty()){int e=q.pollFirst();for(int i=0;i<tree[e].size();i++){int next=tree[e].get(i);if(dist[next]>dist[e]+1){dist[next]=dist[e]+1;q.offerLast(next);}}}for(int i=0;i<n;i++)out.println(dist[i]);}public static void main(String[] args) throws Exception{ir=new InputReader(System.in);out=new PrintWriter(System.out);solve();out.flush();}static class AdjacencyList extends ArrayList<Integer>{}static class InputReader {private InputStream in;private byte[] buffer=new byte[1024];private int curbuf;private int lenbuf;public InputReader(InputStream in) {this.in=in; this.curbuf=this.lenbuf=0;}public boolean hasNextByte() {if(curbuf>=lenbuf){curbuf= 0;try{lenbuf=in.read(buffer);}catch(IOException e) {throw new InputMismatchException();}if(lenbuf<=0) return false;}return true;}private int readByte(){if(hasNextByte()) return buffer[curbuf++]; else return -1;}private boolean isSpaceChar(int c){return !(c>=33&&c<=126);}private void skip(){while(hasNextByte()&&isSpaceChar(buffer[curbuf])) curbuf++;}public boolean hasNext(){skip(); return hasNextByte();}public String next(){if(!hasNext()) throw new NoSuchElementException();StringBuilder sb=new StringBuilder();int b=readByte();while(!isSpaceChar(b)){sb.appendCodePoint(b);b=readByte();}return sb.toString();}public int nextInt() {if(!hasNext()) throw new NoSuchElementException();int c=readByte();while (isSpaceChar(c)) c=readByte();boolean minus=false;if (c=='-') {minus=true;c=readByte();}int res=0;do{if(c<'0'||c>'9') throw new InputMismatchException();res=res*10+c-'0';c=readByte();}while(!isSpaceChar(c));return (minus)?-res:res;}public long nextLong() {if(!hasNext()) throw new NoSuchElementException();int c=readByte();while (isSpaceChar(c)) c=readByte();boolean minus=false;if (c=='-') {minus=true;c=readByte();}long res = 0;do{if(c<'0'||c>'9') throw new InputMismatchException();res=res*10+c-'0';c=readByte();}while(!isSpaceChar(c));return (minus)?-res:res;}public double nextDouble(){return Double.parseDouble(next());}public BigInteger nextBigInteger(){return new BigInteger(next());}public BigDecimal nextBigDecimal(){return new BigDecimal(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 char[][] nextCharMap(int n,int m){char[][] map=new char[n][m];for(int i=0;i<n;i++) map[i]=next().toCharArray();return map;}}}