結果
問題 | No.439 チワワのなる木 |
ユーザー | Grenache |
提出日時 | 2017-09-20 15:26:48 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 482 ms / 5,000 ms |
コード長 | 5,597 bytes |
コンパイル時間 | 4,044 ms |
コンパイル使用メモリ | 81,448 KB |
実行使用メモリ | 79,800 KB |
最終ジャッジ日時 | 2024-04-25 21:12:33 |
合計ジャッジ時間 | 10,257 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 49 ms
50,608 KB |
testcase_01 | AC | 48 ms
50,196 KB |
testcase_02 | AC | 49 ms
50,424 KB |
testcase_03 | AC | 49 ms
50,052 KB |
testcase_04 | AC | 50 ms
50,472 KB |
testcase_05 | AC | 50 ms
50,552 KB |
testcase_06 | AC | 51 ms
50,428 KB |
testcase_07 | AC | 52 ms
50,164 KB |
testcase_08 | AC | 52 ms
50,332 KB |
testcase_09 | AC | 51 ms
50,432 KB |
testcase_10 | AC | 51 ms
50,596 KB |
testcase_11 | AC | 51 ms
50,416 KB |
testcase_12 | AC | 51 ms
50,528 KB |
testcase_13 | AC | 55 ms
50,564 KB |
testcase_14 | AC | 56 ms
50,260 KB |
testcase_15 | AC | 75 ms
51,368 KB |
testcase_16 | AC | 86 ms
51,236 KB |
testcase_17 | AC | 90 ms
51,504 KB |
testcase_18 | AC | 361 ms
71,352 KB |
testcase_19 | AC | 343 ms
68,320 KB |
testcase_20 | AC | 442 ms
74,952 KB |
testcase_21 | AC | 192 ms
58,704 KB |
testcase_22 | AC | 192 ms
58,376 KB |
testcase_23 | AC | 476 ms
75,148 KB |
testcase_24 | AC | 482 ms
76,616 KB |
testcase_25 | AC | 426 ms
79,800 KB |
testcase_26 | AC | 416 ms
76,576 KB |
testcase_27 | AC | 370 ms
69,148 KB |
ソースコード
import java.io.*; import java.util.*; public class Main_yukicoder439_1 { private static Scanner sc; private static Printer pr; private static void solve() { int n = sc.nextInt(); char[] s = sc.next().toCharArray(); List<List<Integer>> edges = new ArrayList<>(n); for (int i = 0; i < n; i++) { edges.add(new ArrayList<>()); } for (int i = 0; i < n - 1; i++) { int a = sc.nextInt() - 1; int b = sc.nextInt() - 1; edges.get(a).add(b); edges.get(b).add(a); } boolean[] used = new boolean[n]; int[] p = new int[n]; long[] cw = new long[n]; long[] cww = new long[n]; Arrays.fill(p, -1); int root = 0; p[root] = root; Deque<Integer> st = new ArrayDeque<>(); st.push(root); while (!st.isEmpty()) { int e = st.peek(); if (used[e]) { st.pop(); if (s[e] == 'w') { cw[e]++; } if (e != p[e]) { cw[p[e]] += cw[e]; cww[p[e]] += cww[e]; if (s[p[e]] == 'w') { cww[p[e]] += cw[e]; } } } else { used[e] = true; for (int next : edges.get(e)) { if (p[next] != -1) { continue; } st.push(next); p[next] = e; } } } Arrays.fill(p, -1); p[root] = root; // long[] pw = new long[n]; long[] pww = new long[n]; long tw = cw[root]; // long tww = cww[root]; st = new ArrayDeque<>(); st.push(root); long ans = 0; while (!st.isEmpty()) { int e = st.pop(); for (int next : edges.get(e)) { if (p[next] != -1) { continue; } st.push(next); p[next] = e; } if (e != root) { long tmp = cww[p[e]] - cww[e]; if (s[p[e]] == 'w') { tmp -= cw[e]; } if (s[e] == 'c') { pww[e] += pww[p[e]]; pww[e] += tmp; } else { pww[e] += pww[p[e]]; pww[e] += tw - cw[e]; pww[e] += tmp; } } if (s[e] == 'c') { ans += pww[e]; ans += cww[e]; } } pr.println(ans); } // --------------------------------------------------- public static void main(String[] args) { sc = new Scanner(System.in); pr = new Printer(System.out); solve(); pr.close(); sc.close(); } @SuppressWarnings("unused") private static class Scanner { BufferedReader br; Scanner (InputStream in) { br = new BufferedReader(new InputStreamReader(in)); } private boolean isPrintable(int ch) { return ch >= '!' && ch <= '~'; } private boolean isCRLF(int ch) { return ch == '\n' || ch == '\r' || ch == -1; } private int nextPrintable() { try { int ch; while (!isPrintable(ch = br.read())) { if (ch == -1) { throw new NoSuchElementException(); } } return ch; } catch (IOException e) { throw new NoSuchElementException(); } } String next() { try { int ch = nextPrintable(); StringBuilder sb = new StringBuilder(); do { sb.appendCodePoint(ch); } while (isPrintable(ch = br.read())); return sb.toString(); } catch (IOException e) { throw new NoSuchElementException(); } } int nextInt() { try { // parseInt from Integer.parseInt() boolean negative = false; int res = 0; int limit = -Integer.MAX_VALUE; int radix = 10; int fc = nextPrintable(); if (fc < '0') { if (fc == '-') { negative = true; limit = Integer.MIN_VALUE; } else if (fc != '+') { throw new NumberFormatException(); } fc = br.read(); } int multmin = limit / radix; int ch = fc; do { int digit = ch - '0'; if (digit < 0 || digit >= radix) { throw new NumberFormatException(); } if (res < multmin) { throw new NumberFormatException(); } res *= radix; if (res < limit + digit) { throw new NumberFormatException(); } res -= digit; } while (isPrintable(ch = br.read())); return negative ? res : -res; } catch (IOException e) { throw new NoSuchElementException(); } } long nextLong() { try { // parseLong from Long.parseLong() boolean negative = false; long res = 0; long limit = -Long.MAX_VALUE; int radix = 10; int fc = nextPrintable(); if (fc < '0') { if (fc == '-') { negative = true; limit = Long.MIN_VALUE; } else if (fc != '+') { throw new NumberFormatException(); } fc = br.read(); } long multmin = limit / radix; int ch = fc; do { int digit = ch - '0'; if (digit < 0 || digit >= radix) { throw new NumberFormatException(); } if (res < multmin) { throw new NumberFormatException(); } res *= radix; if (res < limit + digit) { throw new NumberFormatException(); } res -= digit; } while (isPrintable(ch = br.read())); return negative ? res : -res; } catch (IOException e) { throw new NoSuchElementException(); } } float nextFloat() { return Float.parseFloat(next()); } double nextDouble() { return Double.parseDouble(next()); } String nextLine() { try { int ch; while (isCRLF(ch = br.read())) { if (ch == -1) { throw new NoSuchElementException(); } } StringBuilder sb = new StringBuilder(); do { sb.appendCodePoint(ch); } while (!isCRLF(ch = br.read())); return sb.toString(); } catch (IOException e) { throw new NoSuchElementException(); } } void close() { try { br.close(); } catch (IOException e) { // throw new NoSuchElementException(); } } } private static class Printer extends PrintWriter { Printer(PrintStream out) { super(out); } } }