結果

問題 No.1098 LCAs
ユーザー 37zigen
提出日時 2020-06-27 04:28:56
言語 Java
(openjdk 23)
結果
AC  
実行時間 1,817 ms / 2,000 ms
コード長 3,202 bytes
コンパイル時間 2,173 ms
コンパイル使用メモリ 79,908 KB
実行使用メモリ 102,008 KB
最終ジャッジ日時 2024-07-05 08:44:02
合計ジャッジ時間 15,528 ms
ジャッジサーバーID
(参考情報)
judge3 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 28
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.NoSuchElementException;
public class Main {
public static void main(String[] args) {
new Main().run();
}
long[] sz;
long[] ans;
void dfs(int cur,int par,ArrayList<Integer>[] g) {
sz[cur]=1;
long sum=0;
for (int dst:g[cur]) {
if (dst==par) continue;
dfs(dst,cur,g);
sz[cur]+=sz[dst];
sum-=sz[dst]*sz[dst];
}
sum+=(sz[cur]-1)*(sz[cur]-1);
ans[cur]+=sum;
ans[cur]+=2*(sz[cur]-1);
ans[cur]+=1;
}
void run() {
FastScanner sc=new FastScanner();
int N=sc.nextInt();
ArrayList<Integer>[] g=new ArrayList[N];
for (int i=0;i<N;++i) g[i]=new ArrayList<>();
for (int i=0;i<N-1;++i) {
int u=sc.nextInt()-1;
int v=sc.nextInt()-1;
g[u].add(v);
g[v].add(u);
}
sz=new long[N];
ans=new long[N];
dfs(0,-1,g);
PrintWriter pw=new PrintWriter(System.out);
for (int i=0;i<N;++i) {
pw.println(ans[i]);
}
pw.flush();
}
void tr(Object...o) {System.out.println(Arrays.deepToString(o));}
}
class FastScanner {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
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;}
public boolean hasNext() { while(hasNextByte() && !isPrintableChar(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 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 double nextDouble() { return Double.parseDouble(next());}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0