結果
問題 | No.439 チワワのなる木 |
ユーザー | Grenache |
提出日時 | 2017-09-17 13:02:20 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 490 ms / 5,000 ms |
コード長 | 5,187 bytes |
コンパイル時間 | 4,079 ms |
コンパイル使用メモリ | 80,576 KB |
実行使用メモリ | 64,200 KB |
最終ジャッジ日時 | 2024-11-08 01:52:20 |
合計ジャッジ時間 | 10,807 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 56 ms
37,060 KB |
testcase_01 | AC | 54 ms
36,816 KB |
testcase_02 | AC | 57 ms
37,280 KB |
testcase_03 | AC | 56 ms
37,256 KB |
testcase_04 | AC | 55 ms
37,204 KB |
testcase_05 | AC | 57 ms
36,804 KB |
testcase_06 | AC | 56 ms
37,288 KB |
testcase_07 | AC | 54 ms
37,172 KB |
testcase_08 | AC | 56 ms
37,240 KB |
testcase_09 | AC | 57 ms
37,172 KB |
testcase_10 | AC | 55 ms
37,136 KB |
testcase_11 | AC | 57 ms
37,008 KB |
testcase_12 | AC | 58 ms
37,200 KB |
testcase_13 | AC | 61 ms
37,256 KB |
testcase_14 | AC | 63 ms
37,468 KB |
testcase_15 | AC | 87 ms
38,232 KB |
testcase_16 | AC | 95 ms
38,904 KB |
testcase_17 | AC | 87 ms
38,200 KB |
testcase_18 | AC | 379 ms
57,428 KB |
testcase_19 | AC | 375 ms
54,056 KB |
testcase_20 | AC | 441 ms
58,592 KB |
testcase_21 | AC | 222 ms
46,984 KB |
testcase_22 | AC | 212 ms
47,004 KB |
testcase_23 | AC | 463 ms
58,572 KB |
testcase_24 | AC | 490 ms
63,772 KB |
testcase_25 | AC | 458 ms
59,976 KB |
testcase_26 | AC | 456 ms
62,516 KB |
testcase_27 | AC | 412 ms
64,200 KB |
ソースコード
import java.io.*; import java.util.*; public class Main_yukicoder439 { 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]; int[] cc = new int[n]; int[] cw = new int[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] == 'c') { cc[e]++; } else { cw[e]++; } if (e != p[e]) { cc[p[e]] += cc[e]; cw[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; } } } int tc = cc[root]; int tw = cw[root]; long ans = 0; for (int i = 0; i < n; i++) { if (s[i] == 'w') { int pc = tc - cc[i]; // int pw = tw - cw[i]; for (int next : edges.get(i)) { if (next == p[i]) { ans += (long)pc * (cw[i] - 1); } else { ans += (long)cc[next] * (tw - cw[next] - 1); } } } } 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); } } }