結果

問題 No.284 門松と魔法(2)
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2015-07-17 11:40:15
言語 C#(csc)
(csc 3.9.0)
結果
WA  
(最新)
AC  
(最初)
実行時間 -
コード長 9,015 bytes
コンパイル時間 889 ms
コンパイル使用メモリ 122,756 KB
実行使用メモリ 31,876 KB
最終ジャッジ日時 2024-07-08 08:24:20
合計ジャッジ時間 25,062 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 27 ms
18,816 KB
testcase_01 AC 29 ms
18,816 KB
testcase_02 AC 28 ms
18,944 KB
testcase_03 AC 28 ms
19,328 KB
testcase_04 AC 28 ms
18,816 KB
testcase_05 AC 27 ms
19,328 KB
testcase_06 AC 28 ms
19,072 KB
testcase_07 AC 28 ms
18,944 KB
testcase_08 AC 29 ms
19,456 KB
testcase_09 AC 27 ms
18,944 KB
testcase_10 AC 34 ms
22,272 KB
testcase_11 AC 29 ms
19,968 KB
testcase_12 AC 32 ms
21,632 KB
testcase_13 AC 28 ms
19,456 KB
testcase_14 AC 31 ms
20,864 KB
testcase_15 AC 27 ms
19,840 KB
testcase_16 AC 31 ms
21,504 KB
testcase_17 AC 28 ms
19,584 KB
testcase_18 AC 31 ms
21,888 KB
testcase_19 AC 27 ms
19,840 KB
testcase_20 AC 28 ms
20,096 KB
testcase_21 AC 30 ms
20,736 KB
testcase_22 AC 36 ms
22,912 KB
testcase_23 AC 237 ms
23,168 KB
testcase_24 AC 2,578 ms
23,808 KB
testcase_25 AC 1,086 ms
23,200 KB
testcase_26 AC 27 ms
19,072 KB
testcase_27 AC 26 ms
18,816 KB
testcase_28 AC 27 ms
18,944 KB
testcase_29 AC 3,014 ms
24,064 KB
testcase_30 AC 2,840 ms
23,680 KB
testcase_31 AC 910 ms
25,020 KB
testcase_32 AC 3,028 ms
23,936 KB
testcase_33 AC 1,857 ms
23,296 KB
testcase_34 WA -
testcase_35 AC 28 ms
18,944 KB
testcase_36 AC 28 ms
18,944 KB
testcase_37 AC 3,486 ms
24,448 KB
testcase_38 AC 1,648 ms
23,168 KB
testcase_39 WA -
権限があれば一括ダウンロードができます
コンパイルメッセージ
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.Diagnostics;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;

namespace Program
{

    /// <summary>
    /// 嘘貪欲(落としたい)
    /// </summary>
    public class Solver
    {
        public void Solve()
        {
            var n = sc.Integer();
            var a = sc.Integer(n);
            var dec = new PriorityQueue<Triplet<int, int, int>>();
            var inc = new PriorityQueue<Triplet<int, int, int>>();
            inc.Enqueue(new Triplet<int, int, int>(0, 1 << 30, -100000));
            dec.Enqueue(new Triplet<int, int, int>(0, -100000, 1 << 30));
            foreach (var x in a)
            {
                var push_dec = new List<Triplet<int, int, int>>();
                var push_inc = new List<Triplet<int, int, int>>();
                for (int i = 0; i < 25 && dec.Any(); i++)
                {
                    var p = dec.Dequeue();
                    if (p.J < x && p.K != x)
                        push_inc.Add(Triplet.Create(p.I + 1, x, p.J));
                    push_dec.Add(p);
                }
                for (int i = 0; i < 25 && inc.Any(); i++)
                {
                    var p = inc.Dequeue();
                    if (p.J > x && p.K != x)
                        push_dec.Add(Triplet.Create(p.I + 1, x, p.J));
                    push_inc.Add(p);
                }
                foreach (var i in push_inc.Distinct())
                    inc.Enqueue(i);
                foreach (var d in push_dec.Distinct())
                    dec.Enqueue(d);
                while (inc.Count > 25) inc.Dequeue();
                while (dec.Count > 25) dec.Dequeue();
            }
            var ans = 0;
            while (inc.Any()) ans = Math.Max(ans, inc.Dequeue().I);
            while (dec.Any()) ans = Math.Max(ans, dec.Dequeue().I);
            if (ans < 3) ans = 0;
            IO.Printer.Out.WriteLine(ans);
        }

        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 != '-' && (b < '0' || '9' < b));
            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() { return double.Parse(Scan(), CultureInfo.InvariantCulture); }
        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 Triplet<ST,FT,TT>
static public class Triplet
{
    static public Triplet<FT, ST, TT> Create<FT, ST, TT>(FT f, ST s, TT t)
        where FT : IComparable<FT>
        where ST : IComparable<ST>
        where TT : IComparable<TT>
    { return new Triplet<FT, ST, TT>(f, s, t); }
}
public struct Triplet<FT, ST, TT> : IComparable<Triplet<FT, ST, TT>>
    where FT : IComparable<FT>
    where ST : IComparable<ST>
    where TT : IComparable<TT>
{
    public FT I;
    public ST J;
    public TT K;
    public Triplet(FT i, ST j, TT k) : this() { I = i; J = j; K = k; }
    public int CompareTo(Triplet<FT, ST, TT> other)
    {
        var cmp = I.CompareTo(other.I);
        if (cmp != 0) return cmp;
        cmp = J.CompareTo(other.J);
        if (cmp != 0) return cmp;
        return K.CompareTo(other.K);
    }
    public override string ToString() { return string.Format("{0} {1} {2}", I, J, K); }
}
#endregion
#region PriorityQueue and PairingHeap
public class PriorityQueue<T>
{
    PairingHeap<T> top;
    Comparison<T> compare;
    int size;
    public int Count { get { return size; } }
    public PriorityQueue() : this(Comparer<T>.Default) { }
    public PriorityQueue(Comparison<T> comparison) { compare = comparison; }
    public PriorityQueue(IComparer<T> comparer) { compare = comparer.Compare; }
    public void Enqueue(T item)
    {
        var heap = new PairingHeap<T>(item);
        top = PairingHeap<T>.Merge(top, heap, compare);
        size++;
    }
    public T Dequeue()
    {
        var ret = top.Key;
        size--;
        top = PairingHeap<T>.Pop(top, compare);
        return ret;
    }
    public bool Any() { return size > 0; }
    public T Peek() { return top.Key; }
}

#region PairingHeap
public class PairingHeap<T>
{
    public PairingHeap(T k) { key = k; }
    private readonly T key;
    public T Key { get { return key; } }
    private PairingHeap<T> head;
    private PairingHeap<T> next;
    static public PairingHeap<T> Pop(PairingHeap<T> s, Comparison<T> compare)
    {
        return MergeLst(s.head, compare);
    }
    static public PairingHeap<T> Merge(PairingHeap<T> l, PairingHeap<T> r, Comparison<T> compare)
    {
        if (l == null || r == null) return l == null ? r : l;
        if (compare(l.key, r.key) > 0) Swap(ref l, ref r);
        r.next = l.head;
        l.head = r;
        return l;
    }
    static public PairingHeap<T> MergeLst(PairingHeap<T> s, Comparison<T> compare)
    {
        var n = new PairingHeap<T>(default(T));
        while (s != null)
        {
            PairingHeap<T> a = s, b = null;
            s = s.next; a.next = null;
            if (s != null) { b = s; s = s.next; b.next = null; }
            a = Merge(a, b, compare); a.next = n.next;
            n.next = a;
        }
        while (n.next != null)
        {
            var j = n.next;
            n.next = n.next.next;
            s = Merge(j, s, compare);
        }
        return s;
    }
    static void Swap(ref PairingHeap<T> l, ref PairingHeap<T> r) { var t = l; l = r; r = t; }
}
#endregion
#endregion
0