結果

問題 No.54 Happy Hallowe'en
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2015-06-13 11:04:09
言語 C#(csc)
(csc 3.9.0)
結果
WA  
実行時間 -
コード長 10,427 bytes
コンパイル時間 1,161 ms
コンパイル使用メモリ 119,308 KB
実行使用メモリ 26,136 KB
最終ジャッジ日時 2024-07-06 15:59:59
合計ジャッジ時間 2,711 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 24 ms
17,408 KB
testcase_01 AC 24 ms
17,792 KB
testcase_02 AC 25 ms
17,792 KB
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 AC 31 ms
18,304 KB
testcase_07 WA -
testcase_08 AC 34 ms
18,432 KB
testcase_09 AC 35 ms
18,380 KB
testcase_10 AC 24 ms
17,920 KB
testcase_11 AC 24 ms
17,792 KB
testcase_12 AC 32 ms
18,412 KB
testcase_13 AC 32 ms
18,408 KB
testcase_14 AC 24 ms
17,792 KB
testcase_15 AC 25 ms
17,792 KB
testcase_16 WA -
testcase_17 WA -
testcase_18 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.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
namespace Program
{

    public class Solver
    {
        public void Solve()
        {
            var n = sc.Integer();
            var dp = new AVLTree();
            dp.Add(0);
            var V = new int[n];
            var T = new int[n];
            for (int i = 0; i < n; i++)
            {
                V[i] = sc.Integer();
                T[i] = sc.Integer();
            }
            var id = Enumerate(n, x => x);
            Array.Sort(id, (l, r) =>
                {
                    var cmp = V[l].CompareTo(V[r]);
                    return cmp != 0 ? cmp : (V[l] + T[l]).CompareTo(V[r] + T[r]);
                });
            for (int i = 0; i < n; i++)
            {
                Debug.WriteLine("{0} {1}", T[id[i]], V[id[i]]);
                var p = dp.LowerBound(T[id[i]]) - 1;
                Debug.WriteLine(dp[p]);
                dp.Add(dp[p] + V[id[i]]);
            }
            IO.Printer.Out.WriteLine(dp[dp.Count - 1]);

        }
        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 AVLTree
public class AVLTree
{
    Node nil = new NilNode();
    Node root { get { return nil.lst; } }
    public AVLTree() { nil.lst = nil.rst = nil; }

    public int Count { get { return nil.lst.Count; } }
    public long Value { get { return root.val; } }
    public long Sum { get { return root.sum; } }
    public void Add(long v) { Insert(v, LowerBound(v)); }
    public bool Remove(long v)
    {
        if (EqualRange(v) == 0) return false;
        RemoveAt(LowerBound(v));
        return true;
    }


    public void Insert(long v, int k)
    {
        Node p = nil, t = nil.lst;
        if (t.Count < k)
            throw new IndexOutOfRangeException();
        var isL = true;
        while (t != nil)
            if (t.lst.Count >= k) { p = t; t = t.lst; isL = true; }
            else { k -= (t.lst.Count + 1); p = t; t = t.rst; isL = false; }
        if (isL) { p.lst = CreateNode(v, p); Balance(true, p.lst); }
        else { p.rst = CreateNode(v, p); Balance(true, p.rst); }
    }
    public void RemoveAt(int k)
    {
        var t = nil.lst;
        while (t != nil)
            if (t.lst.Count > k) { t = t.lst; }
            else if (t.lst.Count < k) { k -= t.lst.Count + 1; t = t.rst; }
            else
            {
                if (t.lst == nil) { Node.Replace(t, t.rst); Balance(false, t.rst); }
                else
                {
                    var m = GetMaxNode(t.lst);
                    t.val = m.val;
                    Node.Replace(m, m.lst);
                    Balance(false, m.lst);
                }
                return;
            }
    }
    public int EqualRange(long v) { return UpperBound(v) - LowerBound(v); }
    public int LowerBound(long v) { return lowerBound(nil.lst, v); }
    public int UpperBound(long v) { return upperBound(nil.lst, v); }
    public long this[int k] { get { return find(nil.lst, k); } }

    int lowerBound(Node t, long v)
    {
        if (t.Count == 0) return 0;
        if (v <= t.val) return lowerBound(t.lst, v);
        else return t.lst.Count + 1 + lowerBound(t.rst, v);
    }
    int upperBound(Node t, long v)
    {
        if (t.Count == 0) return 0;
        if (t.val <= v) return t.lst.Count + 1 + upperBound(t.rst, v);
        else return upperBound(t.lst, v);
    }
    long find(Node t, int k)
    {
        if (t.Count <= k) throw new IndexOutOfRangeException();
        if (k == t.lst.Count) return t.val;
        else if (k < t.lst.Count) return find(t.lst, k);
        else return find(t.rst, k - (t.lst.Count + 1));
    }

    class Node
    {
        int h, cnt;
        public int Count { get { return cnt; } }
        public int Height { get { return h; } }
        public int Bias { get { return lst.Height - rst.Height; } }
        internal long val, sum;
        internal Node par, lst, rst;
        internal Node() { }
        internal Node(long v, Node p) { h = 1; cnt = 1; val = v; sum = v; par = p; }
        public void Update()
        {
            h = 1 + Math.Max(lst.h, rst.h);
            cnt = 1 + lst.cnt + rst.cnt;
            sum = val + lst.sum + rst.sum;

        }
        public override string ToString()
        {
            return string.Format("count:{0}, value:{1}", cnt, val);
        }


        static internal void Replace(Node u, Node v)
        {
            var p = u.par;
            if (p.lst == u) p.lst = v;
            else p.rst = v;
            v.par = p;
        }
        static internal Node RotateL(Node v)
        {
            Node u = v.rst; Replace(v, u);
            v.rst = u.lst; u.lst.par = v;
            u.lst = v; v.par = u;
            v.Update();
            u.Update();
            return u;
        }
        static internal Node RotateR(Node u)
        {
            var v = u.lst; Replace(u, v);
            u.lst = v.rst; v.rst.par = u;
            v.rst = u; u.par = v;
            u.Update();
            v.Update();
            return v;
        }
        static internal Node RotateLR(Node t)
        {
            RotateL(t.lst);
            return RotateR(t);
        }
        static internal Node RotateRL(Node t)
        {
            RotateR(t.rst);
            return RotateL(t);
        }
    }
    class NilNode : Node { public override string ToString() { return "nil"; } }

    Node CreateNode() { return new Node() { lst = nil, rst = nil }; }
    Node CreateNode(long v, Node p) { return new Node(v, p) { lst = nil, rst = nil }; }

    void Balance(bool onInsert, Node t)
    {
        while (t.par != nil)
        {
            var u = t.par;
            var h = u.Height;
            if ((u.lst == t) == onInsert)
            {
                if (u.Bias == 2)
                {
                    if (u.lst.Bias >= 0) u = Node.RotateR(u);
                    else u = Node.RotateLR(u);
                }
                else u.Update();
            }
            else
            {
                if (u.Bias == -2)
                {
                    if (u.rst.Bias <= 0) u = Node.RotateL(u);
                    else u = Node.RotateRL(u);
                }
                else u.Update();
            }
            if (h == u.Height) break;
            t = u;
        }
        while (t.par != nil) { t.par.Update(); t = t.par; }
    }

    Node GetMaxNode(Node t)
    {
        while (t.rst != nil) t = t.rst;
        return t;
    }
}
#endregion
0