#94789 (C#(csc)) No.363 門松サイクル

提出ソース

結果

問題	No.363 門松サイクル
ユーザー	紙ぺーぱー
提出日時	2016-05-31 16:16:07
言語	C#(csc) (csc 3.9.0)
結果	MLE
実行時間	-
コード長	10,922 bytes
コンパイル時間	1,366 ms
コンパイル使用メモリ	119,436 KB
実行使用メモリ	825,696 KB
最終ジャッジ日時	2024-10-08 01:07:41
合計ジャッジ時間	4,932 ms
ジャッジサーバーID （参考情報）	judge1 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	29 ms 24,292 KB
testcase_01	AC	30 ms 24,164 KB
testcase_02	MLE	-
testcase_03	--	-
testcase_04	--	-
testcase_05	--	-
testcase_06	--	-
testcase_07	--	-
testcase_08	--	-
testcase_09	--	-
testcase_10	--	-
testcase_11	--	-
testcase_12	--	-
testcase_13	--	-
testcase_14	--	-
testcase_15	--	-
testcase_16	--	-
testcase_17	--	-
testcase_18	--	-
testcase_19	--	-
testcase_20	--	-
testcase_21	--	-
testcase_22	--	-
testcase_23	--	-
testcase_24	--	-
testcase_25	--	-
testcase_26	--	-
testcase_27	--	-
testcase_28	--	-

権限があれば一括ダウンロードができます

コンパイルメッセージ

Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

raw source code

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 Point = System.Numerics.Complex;
using Number = System.Numerics.BigInteger;
namespace Program
{
    public class Solver
    {
        public void Solve()
        {
            var n = sc.Integer();
            var a = sc.Integer(n);
            var T = new Tree(n, a);
            for (int i = 0; i < n - 1; i++)
            {
                var f = sc.Integer() - 1;
                var t = sc.Integer() - 1;
                T.AddEdge(f, t);
            }

            T.Build(0);
            var q = sc.Integer();
            for (int i = 0; i < q; i++)
            {
                var f = sc.Integer() - 1;
                var t = sc.Integer() - 1;
                var lca = T.GetLCA(f, t);
                var k = T.depth[f] + T.depth[t] - 2 * T.depth[lca] + 1;
                if (k < 3)
                {
                    IO.Printer.Out.WriteLine("NO");
                    continue;
                }
                var A = T.Query(lca, f);
                var B = T.Query(lca, t);
                var ans = true;
                ans &= A;
                ans &= B;

                var pf = T.par[f];
                var pt = T.par[t];
                if (f == lca)
                {
                    var ptlca = T.GetAncestorAt(t, T.depth[lca] + 1);
                    ans &= ok(a[f], a[t], a[pt]);
                    ans &= ok(a[t], a[lca], a[ptlca]);
                }
                else if (t == lca)
                {
                    var pflca = T.GetAncestorAt(f, T.depth[lca] + 1);
                    ans &= ok(a[pf], a[f], a[t]);
                    ans &= ok(a[f], a[lca], a[pflca]);
                }
                else
                {
                    var ptlca = T.GetAncestorAt(t, T.depth[lca] + 1);
                    var pflca = T.GetAncestorAt(f, T.depth[lca] + 1);
                    ans &= ok(a[pf], a[f], a[t]);
                    ans &= ok(a[f], a[t], a[pt]);
                    ans &= ok(a[pflca], a[lca], a[ptlca]);
                }
                if (ans)
                    IO.Printer.Out.WriteLine("YES");
                else IO.Printer.Out.WriteLine("NO");
            }
        }
        public bool ok(int a, int b, int c)
        {
            if (a == b || b == c || a == c) return false;
            if (a < b && b > c) return true;
            if (a > b && b < c) return true;
            return false;
        }
        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
#region Tree

public class Tree
{
    public bool ok(int a, int b, int c)
    {
        if (a == b || b == c || a == c) return false;
        if (a < b && b > c) return true;
        if (a > b && b < c) return true;
        return false;
    }
    public bool Query(int from, int to)
    {
        switch (depth[to] - depth[from])
        {
            case 0: return true;
            case 1: return val[from] != val[to];
            case 2: return ok(val[from], val[par[to]], val[to]);
            default:
                var ans = true;
                var d = depth[to] - depth[from] - 2;
                for (int i = 0; i < 20; i++)
                    if ((((depth[to] - d) >> i) & 1) == 1)
                    {
                        ans &= OK[i, to];
                        to = parent[i, to];
                    }
                return ans&Query(from, to);

        }
    }
    List<Edge>[] G;
    public int[] par;
    int[] pos;
    int[,] parent;
    public int[] depth;
    int[] val;
    bool[,] OK;
    public Tree(int n, int[] a)
    {
        G = Enumerate(n, x => new List<Edge>());
        pos = new int[n];
        depth = new int[n];
        par = new int[n];
        parent = new int[20, n];
        OK = new bool[20, n];
        val = a;
    }
    public void AddEdge(int f, int t)
    {
        G[f].Add(new Edge(f, t));
        G[t].Add(new Edge(t, f));
    }
    #region impl
    public void Build(int root)
    {
        Walk(root);
        BuildLCA();

    }
    public void Walk(int root)
    {
        var q = new Queue<int>();
        q.Enqueue(root);
        q.Enqueue(-1);
        q.Enqueue(-2);
        while (q.Any())
        {
            var cur = q.Dequeue();
            var pre = q.Dequeue();
            var prepre = q.Dequeue();
            if (prepre == -2)
                OK[0, cur] = true;
            else if (prepre == -1)
                OK[0, cur] = val[cur] == val[pre];
            else
                OK[0, cur] = ok(val[cur], val[pre], val[prepre]);
            foreach (var e in G[cur])
            {
                if (e.to == pre) continue;
                depth[e.to] = depth[cur] + 1;
                par[e.to] = cur;
                q.Enqueue(e.to);
                q.Enqueue(cur);
                q.Enqueue(pre);
            }
        }
    }

    void BuildLCA()
    {
        for (int k = 0; k < 19; k++)
            for (int v = 0; v < G.Length; v++)
                parent[k, v] = -1;
        for (int i = 0; i < G.Length; i++)
            parent[0, i] = par[i];
        for (int k = 0; k < 19; k++)
        {
            for (int v = 0; v < G.Length; v++)
                if (parent[k, v] < 0) parent[k + 1, v] = -1;
                else
                {
                    parent[k + 1, v] = parent[k, parent[k, v]];
                    OK[k + 1, v] = OK[k, v] & OK[k, parent[k, v]];
                }
        }

    }


    public int To(Edge t) { return t.to; }
    public int GetLCA(int u, int v)
    {
        if (depth[u] > depth[v]) { var tmp = u; u = v; v = tmp; }
        for (int k = 0; k < 20; k++)
            if ((((depth[v] - depth[u]) >> k) & 1) == 1)
                v = parent[k, v];
        if (u == v)
            return u;
        for (int i = 19; i >= 0; i--)
            if (parent[i, u] != parent[i, v])
            {
                u = parent[i, u];
                v = parent[i, v];
            }
        return parent[0, u];
    }
    public int GetAncestor(int v, int k)
    {
        var to = depth[v] - k;
        for (int i = 0; i < 20; i++)
            if ((((depth[v] - to) >> i) & 1) == 1)
                v = parent[i, v];
        return v;
    }
    public int GetAncestorAt(int v, int d)
    {
        if (depth[v] < d)
            throw new Exception();
        for (int i = 0; i < 20; i++)
            if ((((depth[v] - d) >> i) & 1) == 1)
                v = parent[i, v];
        return v;
    }
    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; }
    #endregion
}
#endregion
#region TreeEdge
public struct Edge
{
    public int from, to;
    public Edge(int f, int t)
    {
        from = f; to = t;
    }
    public override string ToString()
    {
        return string.Format("{0}->{1}", from, to);
    }
}
#endregion

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード