結果
問題 | No.439 チワワのなる木 |
ユーザー | 紙ぺーぱー |
提出日時 | 2016-10-29 00:42:03 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 131 ms / 5,000 ms |
コード長 | 5,767 bytes |
コンパイル時間 | 2,874 ms |
コンパイル使用メモリ | 111,872 KB |
実行使用メモリ | 45,568 KB |
最終ジャッジ日時 | 2024-11-24 06:58:03 |
合計ジャッジ時間 | 4,869 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 25 ms
18,560 KB |
testcase_01 | AC | 25 ms
18,432 KB |
testcase_02 | AC | 25 ms
18,304 KB |
testcase_03 | AC | 25 ms
18,432 KB |
testcase_04 | AC | 26 ms
18,432 KB |
testcase_05 | AC | 26 ms
18,560 KB |
testcase_06 | AC | 25 ms
18,560 KB |
testcase_07 | AC | 26 ms
18,560 KB |
testcase_08 | AC | 26 ms
18,432 KB |
testcase_09 | AC | 26 ms
18,304 KB |
testcase_10 | AC | 26 ms
18,560 KB |
testcase_11 | AC | 26 ms
18,560 KB |
testcase_12 | AC | 25 ms
18,304 KB |
testcase_13 | AC | 26 ms
18,560 KB |
testcase_14 | AC | 26 ms
18,304 KB |
testcase_15 | AC | 25 ms
18,688 KB |
testcase_16 | AC | 26 ms
18,432 KB |
testcase_17 | AC | 26 ms
18,432 KB |
testcase_18 | AC | 80 ms
28,672 KB |
testcase_19 | AC | 76 ms
28,416 KB |
testcase_20 | AC | 108 ms
33,024 KB |
testcase_21 | AC | 41 ms
21,276 KB |
testcase_22 | AC | 39 ms
20,512 KB |
testcase_23 | AC | 110 ms
34,424 KB |
testcase_24 | AC | 131 ms
43,772 KB |
testcase_25 | AC | 111 ms
34,296 KB |
testcase_26 | AC | 107 ms
34,432 KB |
testcase_27 | AC | 85 ms
45,568 KB |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System; using System.Linq; using System.Linq.Expressions; using System.Collections.Generic; using Debug = System.Diagnostics.Debug; using StringBuilder = System.Text.StringBuilder; using System.Numerics; using Number = System.Int64; namespace Program { public class Solver { public void Solve() { var n = sc.Integer(); var s = sc.Scan(); var a = s.Count(x => x == 'c'); var b = n - a; var A = new long[n]; var B = new long[n]; var G = Enumerate(n, x => new List<int>()); for (int i = 0; i < n - 1; i++) { var f = sc.Integer() - 1; var t = sc.Integer() - 1; G[f].Add(t); G[t].Add(f); } long ret = 0; Action<int, int> dfs = null; dfs = (prev, cur) => { foreach (var to in G[cur]) { if (prev == to) continue; dfs(cur, to); if (s[cur] == 'w') { ret += A[cur] * B[to]; ret += B[cur] * A[to]; } A[cur] += A[to]; B[cur] += B[to]; } if (s[cur] == 'c') A[cur]++; else { var x = a - A[cur]; var y = b - B[cur] - 1; ret += x * B[cur]; ret += y * A[cur]; B[cur]++; } }; dfs(-1, 0); IO.Printer.Out.WriteLine(ret); } public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput()); static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; } static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; } } } #region main static class Ex { static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); } static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); } static public void Main() { var solver = new Program.Solver(); solver.Solve(); Program.IO.Printer.Out.Flush(); } } #endregion #region Ex namespace Program.IO { using System.IO; using System.Text; using System.Globalization; public class Printer: StreamWriter { static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; } public static Printer Out { get; set; } public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } } public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { } public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { } public void Write<T>(string format, T[] source) { base.Write(format, source.OfType<object>().ToArray()); } public void WriteLine<T>(string format, T[] source) { base.WriteLine(format, source.OfType<object>().ToArray()); } } public class StreamScanner { public StreamScanner(Stream stream) { str = stream; } public readonly Stream str; private readonly byte[] buf = new byte[1024]; private int len, ptr; public bool isEof = false; public bool IsEndOfStream { get { return isEof; } } private byte read() { if (isEof) return 0; if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } } return buf[ptr++]; } public char Char() { byte b = 0; do b = read(); while ((b < 33 || 126 < b) && !isEof); return (char)b; } public string Scan() { var sb = new StringBuilder(); for (var b = Char(); b >= 33 && b <= 126; b = (char)read()) sb.Append(b); return sb.ToString(); } public string ScanLine() { var sb = new StringBuilder(); for (var b = Char(); b != '\n'; b = (char)read()) if (b == 0) break; else if (b != '\r') sb.Append(b); return sb.ToString(); } public long Long() { if (isEof) return long.MinValue; long ret = 0; byte b = 0; var ng = false; do b = read(); while (b != 0 && b != '-' && (b < '0' || '9' < b)); if (b == 0) return long.MinValue; if (b == '-') { ng = true; b = read(); } for (; true; b = read()) { if (b < '0' || '9' < b) return ng ? -ret : ret; else ret = ret * 10 + b - '0'; } } public int Integer() { return (isEof) ? int.MinValue : (int)Long(); } public double Double() { var s = Scan(); return s != "" ? double.Parse(s, CultureInfo.InvariantCulture) : double.NaN; } private T[] enumerate<T>(int n, Func<T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(); return a; } public char[] Char(int n) { return enumerate(n, Char); } public string[] Scan(int n) { return enumerate(n, Scan); } public double[] Double(int n) { return enumerate(n, Double); } public int[] Integer(int n) { return enumerate(n, Integer); } public long[] Long(int n) { return enumerate(n, Long); } } } #endregion