結果

問題 No.912 赤黒木
ユーザー りあんりあん
提出日時 2019-10-18 23:03:40
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 1,519 ms / 3,000 ms
コード長 7,886 bytes
コンパイル時間 1,035 ms
コンパイル使用メモリ 122,816 KB
実行使用メモリ 131,800 KB
最終ジャッジ日時 2024-06-25 18:46:22
合計ジャッジ時間 20,423 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 26 ms
18,176 KB
testcase_01 AC 27 ms
18,432 KB
testcase_02 AC 29 ms
19,072 KB
testcase_03 AC 31 ms
19,328 KB
testcase_04 AC 29 ms
18,560 KB
testcase_05 AC 28 ms
19,200 KB
testcase_06 AC 29 ms
18,944 KB
testcase_07 AC 30 ms
19,328 KB
testcase_08 AC 27 ms
18,304 KB
testcase_09 AC 29 ms
19,072 KB
testcase_10 AC 28 ms
18,560 KB
testcase_11 AC 29 ms
18,816 KB
testcase_12 AC 737 ms
41,836 KB
testcase_13 AC 741 ms
42,224 KB
testcase_14 AC 696 ms
41,336 KB
testcase_15 AC 762 ms
42,232 KB
testcase_16 AC 726 ms
41,580 KB
testcase_17 AC 746 ms
41,724 KB
testcase_18 AC 693 ms
41,332 KB
testcase_19 AC 699 ms
41,204 KB
testcase_20 AC 681 ms
41,456 KB
testcase_21 AC 665 ms
41,076 KB
testcase_22 AC 685 ms
42,880 KB
testcase_23 AC 713 ms
43,036 KB
testcase_24 AC 685 ms
43,424 KB
testcase_25 AC 733 ms
41,836 KB
testcase_26 AC 743 ms
42,468 KB
testcase_27 AC 722 ms
41,460 KB
testcase_28 AC 1,519 ms
131,800 KB
testcase_29 AC 1,475 ms
131,156 KB
testcase_30 AC 1,513 ms
131,564 KB
testcase_31 AC 1,359 ms
126,052 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
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.Collections.Generic;
using System.Linq;
using System.IO;
using System.Threading;
using System.Text;
using System.Diagnostics;
using static util;
using P = pair<int, int>;

class Program {
    static void Main(string[] args) {
        var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
        var solver = new Solver(sw);
        // var t = new Thread(solver.solve, 1 << 26); // 64 MB
        // t.Start();
        // t.Join();
        solver.solve();
        sw.Flush();
    }
}

class Solver {
    StreamWriter sw;
    Scan sc;
    void Prt(string a) => sw.WriteLine(a);
    void Prt<T>(IEnumerable<T> a) => Prt(string.Join(" ", a));
    void Prt(params object[] a) => Prt(string.Join(" ", a));
    public Solver(StreamWriter sw) {
        this.sw = sw;
        this.sc = new Scan();
    }

    public void solve() {
        int n = sc.Int;
        edge = new List<int>[n];
        for (int i = 0; i < n; i++)
        {
            edge[i] = new List<int>();
        }
        for (int i = 0; i < n - 1; i++)
        {
            int u, v;
            sc.Multi(out u, out v);
            --u;
            --v;
            edge[u].Add(v);
            edge[v].Add(u);
        }
        odd = new bool[n];
        for (int i = 0; i < n - 1; i++)
        {
            int u, v;
            sc.Multi(out u, out v);
            --u;
            --v;
            odd[u] = !odd[u];
            odd[v] = !odd[v];
        }
        var dp = dfs(0, -1);
        Prt(Math.Min(dp[0][0], dp[2][0]) + n - 1);

    }
    bool[] odd;
    List<int>[] edge;
    int[][] dfs(int p, int par) {
        var dp = new int[3][];
        for (int i = 0; i < 3; i++)
        {
            dp[i] = new int[2];
            for (int j = 0; j < 2; j++)
            {
                dp[i][j] = M;
            }
        }
        if (odd[p]) {
            dp[0][1] = 0;
            dp[1][0] = 0;
        }
        else {
            dp[0][0] = 0;
        }
        foreach (var item in edge[p])
        {
            if (item == par) continue;
            var d = dfs(item, p);
            var nex = new int[3][];
            for (int i = 0; i < 3; i++)
            {
                nex[i] = new int[2];
                for (int j = 0; j < 2; j++)
                {
                    nex[i][j] = M;
                }
            }
            for (int i = 0; i < 3; i++)
            {
                for (int j = 0; j < 2; j++)
                {
                    for (int k = 0; k < 3 && i + k < 3; k++)
                    {
                        for (int l = 0; l < 2; l++)
                        {
                            nex[i + k][(j + l) % 2] = Math.Min(nex[i + k][(j + l) % 2], dp[i][j] + d[k][l] + l);
                        }
                    }
                }
            }
            dp = nex;
        }
        return dp;
    }
}

class pair<T, U> : IComparable<pair<T, U>> {
    public T v1;
    public U v2;
    public pair() : this(default(T), default(U)) {}
    public pair(T v1, U v2) { this.v1 = v1; this.v2 = v2; }
    public int CompareTo(pair<T, U> a) {
        int c = Comparer<T>.Default.Compare(v1, a.v1);
        return c != 0 ? c : Comparer<U>.Default.Compare(v2, a.v2);
    }
    public override string ToString() => v1 + " " + v2;
    public void Deconstruct(out T a, out U b) { a = v1; b = v2; }
}
static class util {
    public static readonly int M = 1000000007;
    // public static readonly int M = 998244353;
    public static readonly long LM = 1L << 60;
    public static readonly double eps = 1e-11;
    public static void DBG(string a) => Console.Error.WriteLine(a);
    public static void DBG<T>(IEnumerable<T> a) => DBG(string.Join(" ", a));
    public static void DBG(params object[] a) => DBG(string.Join(" ", a));
    public static void Assert(bool cond) { if (!cond) throw new Exception(); }
    public static pair<T, U> make_pair<T, U>(T v1, U v2) => new pair<T, U>(v1, v2);
    public static int CompareList<T>(IList<T> a, IList<T> b) where T : IComparable<T> {
        for (int i = 0; i < a.Count && i < b.Count; i++)
            if (a[i].CompareTo(b[i]) != 0) return a[i].CompareTo(b[i]);
        return a.Count.CompareTo(b.Count);
    }
    public static bool inside(int i, int j, int h, int w) => i >= 0 && i < h && j >= 0 && j < w;
    static readonly int[] dd = { 0, 1, 0, -1 };
    // static readonly string dstring = "RDLU";
    public static P[] adjacents(int i, int j)
        => Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1])).ToArray();
    public static P[] adjacents(int i, int j, int h, int w)
        => Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1]))
                                         .Where(p => inside(p.v1, p.v2, h, w)).ToArray();
    public static P[] adjacents(this P p) => adjacents(p.v1, p.v2);
    public static P[] adjacents(this P p, int h, int w) => adjacents(p.v1, p.v2, h, w);
    public static Dictionary<T, int> compress<T>(this IEnumerable<T> a)
        => a.Distinct().OrderBy(v => v).Select((v, i) => new { v, i }).ToDictionary(p => p.v, p => p.i);
    public static Dictionary<T, int> compress<T>(params IEnumerable<T>[] a) => compress(a.Aggregate(Enumerable.Union));
    public static int[] compressed<T>(this IEnumerable<T> a) {
        var cmp = a.compress();
        return a.Select(x => cmp[x]).ToArray();
    }
    public static T[] inv<T>(this Dictionary<T, int> dic) {
        var res = new T[dic.Count];
        foreach (var item in dic) res[item.Value] = item.Key;
        return res;
    }
    public static void swap<T>(ref T a, ref T b) where T : struct { var t = a; a = b; b = t; }
    public static void swap<T>(this IList<T> a, int i, int j) where T : struct { var t = a[i]; a[i] = a[j]; a[j] = t; }
    public static T[] copy<T>(this IList<T> a) {
        var ret = new T[a.Count];
        for (int i = 0; i < a.Count; i++) ret[i] = a[i];
        return ret;
    }
}

class Scan {
    StreamReader sr;
    public Scan() { sr = new StreamReader(Console.OpenStandardInput()); }
    public Scan(string path) { sr = new StreamReader(path); }
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public string Str => sr.ReadLine().Trim();
    public pair<T, U> Pair<T, U>() {
        T a; U b;
        Multi(out a, out b);
        return new pair<T, U>(a, b);
    }
    public P P => Pair<int, int>();
    public int[] IntArr => StrArr.Select(int.Parse).ToArray();
    public long[] LongArr => StrArr.Select(long.Parse).ToArray();
    public double[] DoubleArr => StrArr.Select(double.Parse).ToArray();
    public string[] StrArr => Str.Split(new[]{' '}, StringSplitOptions.RemoveEmptyEntries);
    bool eq<T, U>() => typeof(T).Equals(typeof(U));
    T ct<T, U>(U a) => (T)Convert.ChangeType(a, typeof(T));
    T cv<T>(string s) => eq<T, int>()    ? ct<T, int>(int.Parse(s))
                       : eq<T, long>()   ? ct<T, long>(long.Parse(s))
                       : eq<T, double>() ? ct<T, double>(double.Parse(s))
                       : eq<T, char>()   ? ct<T, char>(s[0])
                                         : ct<T, string>(s);
    public void Multi<T>(out T a) => a = cv<T>(Str);
    public void Multi<T, U>(out T a, out U b)
    { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); }
    public void Multi<T, U, V>(out T a, out U b, out V c)
    { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); }
    public void Multi<T, U, V, W>(out T a, out U b, out V c, out W d)
    { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); }
    public void Multi<T, U, V, W, X>(out T a, out U b, out V c, out W d, out X e)
    { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); e = cv<X>(ar[4]); }
}
0