結果

問題 No.439 チワワのなる木
ユーザー 紙ぺーぱー
提出日時 2016-10-29 01:19:08
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 253 ms / 5,000 ms
コード長 6,242 bytes
コンパイル時間 2,840 ms
コンパイル使用メモリ 110,848 KB
実行使用メモリ 62,076 KB
最終ジャッジ日時 2024-11-24 07:02:19
合計ジャッジ時間 3,578 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 28
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

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()
        {
            calc();
        }
        int N;
        string S;
        List<int>[] es;
        long ans;
        int AllC, AllW;

        void calc()
        {
            N = sc.Integer();
            S = sc.Scan();

            AllC = AllW = 0;
            foreach (var c in S)
            {
                if (c == 'c') AllC++;
                else AllW++;
            }

            es = new List<int>[N];
            for (int i = 0; i < N; i++)
            {
                es[i] = new List<int>();
            }
            for (int i = 0; i < N - 1; i++)
            {
                int a = sc.Integer() - 1;
                int b = sc.Integer() - 1;
                es[a].Add(b);
                es[b].Add(a);
            }
            ans = 0;
            dfs(0, -1);
            Console.WriteLine(ans);
        }

        Tuple<int, int> dfs(int p, int pre)
        {
            List<Tuple<int, int>> lt = new List<Tuple<int, int>>();
            foreach (var to in es[p])
            {
                if (to == pre) continue;
                lt.Add(dfs(to, p));
            }

            int sumC = 0;
            int sumW = 0;
            foreach (var item in lt)
            {
                sumC += item.Item1;
                sumW += item.Item2;
            }
            if (S[p] == 'c') sumC++;
            else sumW++;

            if (p != 0)
            {
                lt.Add(Tuple.Create(AllC - sumC, AllW - sumW));
            }

            long addAns = 0;
            if (S[p] == 'w')
            {
                AllW--;

                foreach (var item in lt)
                {
                    addAns += (AllC - (long)item.Item1) * item.Item2;
                }

                AllW++;
            }
            ans += addAns;
            //Console.WriteLine(p + " " + addAns + " " + sumC + " " + sumW);

            return Tuple.Create(sumC, sumW);
        }

        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
0