From f90693e3f78cdb4461c8c1aca660276bf6bde043 Mon Sep 17 00:00:00 2001 From: oncsr Date: Wed, 11 Jun 2025 22:04:46 +0900 Subject: [PATCH] =?UTF-8?q?[20250611]=20BOJ=20/=20P5=20/=20=EB=82=98?= =?UTF-8?q?=EB=AC=B4=20=EC=9C=84=EC=9D=98=20=EC=9E=85=EC=9E=90=20/=20?= =?UTF-8?q?=EA=B6=8C=ED=98=81=EC=A4=80?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- ...4\354\235\230 \354\236\205\354\236\220.md" | 128 ++++++++++++++++++ 1 file changed, 128 insertions(+) create mode 100644 "khj20006/202506/11 BOJ P5 \353\202\230\353\254\264 \354\234\204\354\235\230 \354\236\205\354\236\220.md" diff --git "a/khj20006/202506/11 BOJ P5 \353\202\230\353\254\264 \354\234\204\354\235\230 \354\236\205\354\236\220.md" "b/khj20006/202506/11 BOJ P5 \353\202\230\353\254\264 \354\234\204\354\235\230 \354\236\205\354\236\220.md" new file mode 100644 index 00000000..3df08a6f --- /dev/null +++ "b/khj20006/202506/11 BOJ P5 \353\202\230\353\254\264 \354\234\204\354\235\230 \354\236\205\354\236\220.md" @@ -0,0 +1,128 @@ +```java +import java.util.*; +import java.io.*; + +class IOController { + BufferedReader br; + BufferedWriter bw; + StringTokenizer st; + + public IOController() { + br = new BufferedReader(new InputStreamReader(System.in)); + bw = new BufferedWriter(new OutputStreamWriter(System.out)); + st = new StringTokenizer(""); + } + + void nextLine() throws Exception { + st = new StringTokenizer(br.readLine()); + } + + String nextToken() throws Exception { + while (!st.hasMoreTokens()) nextLine(); + return st.nextToken(); + } + + int nextInt() throws Exception { + return Integer.parseInt(nextToken()); + } + + long nextLong() throws Exception { + return Long.parseLong(nextToken()); + } + + double nextDouble() throws Exception { + return Double.parseDouble(nextToken()); + } + + void close() throws Exception { + bw.flush(); + bw.close(); + } + + void write(String content) throws Exception { + bw.write(content); + } + +} + +public class Main { + + static IOController io; + + // + + static int N, M; + static List[] V; + static int[] par; + static int[] OD, OU, ED, EU; + + public static void main(String[] args) throws Exception { + + io = new IOController(); + + init(); + solve(); + + io.close(); + + } + + public static void init() throws Exception { + + N = io.nextInt(); + M = io.nextInt(); + V = new List[N+1]; + for(int i=1;i<=N;i++) V[i] = new ArrayList<>(); + for(int i=1;i0) { + int u = io.nextInt(), v = io.nextInt(), c = io.nextInt(); + if(par[v] == u){ + if(c == 0) io.write((OU[v] * OD[v] + EU[v] * ED[v]) + "\n"); + else io.write((OU[v] * ED[v] + EU[v] * OD[v]) + "\n"); + } + else{ + if(c == 0) io.write((OU[u] * OD[u] + EU[u] * ED[u]) + "\n"); + else io.write((OU[u] * ED[u] + EU[u] * OD[u]) + "\n"); + } + } + + } + + static void dfs1(int n, int p) { + par[n] = p; + for(int i:V[n]) if(i != p) { + dfs1(i,n); + OD[n] += ED[i]; + ED[n] += OD[i]; + } + ED[n]++; + } + + static void dfs2(int n, int p) { + if(n != 1) { + OU[n] = EU[p] + ED[p] - OD[n]; + EU[n] = OU[p] + OD[p] - ED[n]; + } + for(int i:V[n]) if(i != p) dfs2(i,n); + } + +} +```