#109325 (C#(csc)) No.409 ダイエット

提出ソース

結果

問題	No.409 ダイエット
ユーザー	紙ぺーぱー
提出日時	2016-08-07 00:56:32
言語	C#(csc) (csc 3.9.0)
結果	AC
実行時間	371 ms / 2,000 ms
コード長	7,963 bytes
コンパイル時間	3,486 ms
コンパイル使用メモリ	115,160 KB
実行使用メモリ	37,740 KB
最終ジャッジ日時	2023-09-08 16:58:36
合計ジャッジ時間	16,720 ms
ジャッジサーバーID （参考情報）	judge11 / judge15

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	51 ms 22,676 KB
testcase_01	AC	52 ms 20,568 KB
testcase_02	AC	53 ms 22,592 KB
testcase_03	AC	51 ms 20,536 KB
testcase_04	AC	53 ms 22,696 KB
testcase_05	AC	53 ms 20,648 KB
testcase_06	AC	52 ms 20,596 KB
testcase_07	AC	48 ms 20,544 KB
testcase_08	AC	52 ms 20,628 KB
testcase_09	AC	52 ms 22,628 KB
testcase_10	AC	52 ms 20,596 KB
testcase_11	AC	53 ms 20,700 KB
testcase_12	AC	53 ms 22,704 KB
testcase_13	AC	53 ms 20,552 KB
testcase_14	AC	53 ms 22,708 KB
testcase_15	AC	48 ms 20,492 KB
testcase_16	AC	53 ms 20,584 KB
testcase_17	AC	52 ms 20,696 KB
testcase_18	AC	53 ms 20,600 KB
testcase_19	AC	53 ms 22,644 KB
testcase_20	AC	53 ms 22,640 KB
testcase_21	AC	52 ms 20,496 KB
testcase_22	AC	48 ms 18,600 KB
testcase_23	AC	53 ms 20,552 KB
testcase_24	AC	49 ms 20,508 KB
testcase_25	AC	53 ms 22,576 KB
testcase_26	AC	52 ms 20,672 KB
testcase_27	AC	53 ms 20,612 KB
testcase_28	AC	49 ms 22,596 KB
testcase_29	AC	53 ms 22,596 KB
testcase_30	AC	53 ms 20,660 KB
testcase_31	AC	51 ms 18,588 KB
testcase_32	AC	53 ms 20,544 KB
testcase_33	AC	52 ms 20,648 KB
testcase_34	AC	53 ms 20,556 KB
testcase_35	AC	55 ms 18,520 KB
testcase_36	AC	55 ms 20,788 KB
testcase_37	AC	55 ms 18,524 KB
testcase_38	AC	56 ms 22,712 KB
testcase_39	AC	55 ms 20,716 KB
testcase_40	AC	55 ms 20,792 KB
testcase_41	AC	54 ms 20,660 KB
testcase_42	AC	56 ms 22,712 KB
testcase_43	AC	54 ms 20,680 KB
testcase_44	AC	54 ms 20,652 KB
testcase_45	AC	55 ms 20,528 KB
testcase_46	AC	55 ms 22,764 KB
testcase_47	AC	55 ms 20,648 KB
testcase_48	AC	55 ms 20,580 KB
testcase_49	AC	55 ms 20,716 KB
testcase_50	AC	55 ms 20,716 KB
testcase_51	AC	55 ms 20,620 KB
testcase_52	AC	56 ms 20,612 KB
testcase_53	AC	56 ms 22,572 KB
testcase_54	AC	55 ms 20,620 KB
testcase_55	AC	105 ms 31,204 KB
testcase_56	AC	145 ms 22,216 KB
testcase_57	AC	149 ms 34,716 KB
testcase_58	AC	100 ms 29,044 KB
testcase_59	AC	133 ms 31,328 KB
testcase_60	AC	102 ms 28,724 KB
testcase_61	AC	133 ms 35,784 KB
testcase_62	AC	122 ms 34,488 KB
testcase_63	AC	160 ms 31,312 KB
testcase_64	AC	112 ms 30,852 KB
testcase_65	AC	217 ms 30,060 KB
testcase_66	AC	156 ms 34,072 KB
testcase_67	AC	140 ms 32,948 KB
testcase_68	AC	150 ms 31,268 KB
testcase_69	AC	173 ms 35,460 KB
testcase_70	AC	257 ms 33,316 KB
testcase_71	AC	150 ms 33,288 KB
testcase_72	AC	283 ms 34,644 KB
testcase_73	AC	371 ms 35,688 KB
testcase_74	AC	140 ms 32,932 KB
testcase_75	AC	282 ms 37,740 KB
testcase_76	AC	145 ms 34,656 KB
testcase_77	AC	211 ms 29,288 KB
testcase_78	AC	106 ms 31,880 KB
testcase_79	AC	148 ms 30,704 KB
testcase_80	AC	201 ms 34,236 KB
testcase_81	AC	332 ms 35,576 KB
testcase_82	AC	215 ms 33,024 KB
testcase_83	AC	225 ms 34,640 KB
testcase_84	AC	246 ms 29,076 KB
testcase_85	AC	71 ms 25,072 KB
testcase_86	AC	253 ms 31,100 KB
testcase_87	AC	250 ms 35,456 KB
testcase_88	AC	154 ms 28,964 KB
testcase_89	AC	263 ms 26,900 KB
testcase_90	AC	145 ms 23,992 KB
testcase_91	AC	282 ms 29,108 KB

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

コンパイルメッセージ

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 Number = System.Int64;
namespace Program
{
    public class Solver
    {
        public void Solve()
        {
            var n = sc.Integer();
            var A = sc.Integer();
            var B = sc.Integer();
            var dp = new long[n + 1];
            dp[0] = sc.Integer();
            var f = new Optimization.SimpleCHT();
            Action<long, long> addline = (j, val) =>
                {
                    f.AddLine(-j * B, A * j + (j * j - j) * B / 2 + val);
                };
            for (long i = 0; i < n; i++)
            {
                addline(i, dp[i]);
                var min = f.Get((int)(i));
                var v = sc.Integer();

                dp[i + 1] = -A * i + B * (i * i + i) / 2 + v + min;
            }
            Debug.WriteLine(dp.AsJoinedString());
            var ans = long.MaxValue;
            for (int i = 0; i <= n; i++)
                ans = Math.Min(ans, dp[i] - 1L * A * (n - i) + 1L * B * Math.BigMul(n - i, n - i + 1) / 2);
            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 != 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 CHT
namespace Optimization
{
    using N = System.Int64;
    struct L
    {
        internal N a, b;
        /// <summary>
        /// u*x+v
        /// </summary>
        public L(N u, N v) : this() { a = u; b = v; }

        /// <summary>
        /// F(x)=a*x+b
        /// </summary>
        public N F(int x) { return a * x + b; }
    }
    /// <summary>
    /// 追加される直線の傾きが単調減少
    /// </summary>
    public class SimpleCHT
    {
        int s, t;
        List<L> deq = new List<L>();
        /// <summary>
        /// ax+b を追加
        /// aは単調減少でないとダメ,ならしO(1)
        /// </summary>
        public void AddLine(N a, N b)
        {
            var l = new L(a, b);
            while (s + 1 < t && check_slow(deq[t - 2], deq[t - 1], l)) { t--; deq.RemoveAt(t); }
            deq.Add(l);
            t++;
        }
        /// <summary>
        /// xが単調増加のときのみ使ってよい,ならしO(1)
        /// </summary>
        public N Get(int x)
        {
            while (s + 1 < t && deq[s].F(x) >= deq[s + 1].F(x)) s++;
            return deq[s].F(x);
        }

        /// <summary>
        /// xが単調増加でないときでも使える,O(logN)
        /// </summary>
        /// <param name="x"></param>
        /// <returns></returns>
        public N Query(int x)
        {
            var l = s - 1; var h = t - 1;
            while (l + 1 < h)
            {
                var m = (l + h) / 2;
                if (isR_fast(deq[m], deq[m + 1], x)) l = m;
                else h = m;
            }
            return deq[h].F(x);

        }

        /// <summary>
        /// ax,bが小さい
        /// </summary>
        private bool isR_fast(L l1, L l2, int x)
        {
            return (l1.b - l2.b) >= x * (l2.a - l1.a);
        }
        /// <summary>
        /// ax,bが大きい
        /// </summary>
        private bool isR_slow(L l1, L l2, int x)
        {
            BigInteger b1 = l1.b, b2 = l2.b;
            BigInteger a1 = l1.a, a2 = l2.a;
            return (b1 - b2) >= x * (a2 - a1);
        }

        /// <summary>
        /// a*bが小さい
        /// </summary>
        private bool check_fast(L l1, L l2, L l3)
        {
            return (l2.a - l1.a) * (l3.b - l2.b) >= (l2.b - l1.b) * (l3.a - l2.a);
        }
        /// <summary>
        /// a*bが大きい
        /// </summary>
        private bool check_slow(L l1, L l2, L l3)
        {
            BigInteger a1 = l1.a, a2 = l2.a, a3 = l3.a;
            BigInteger b1 = l1.b, b2 = l2.b, b3 = l3.b;

            return (a2 - a1) * (b3 - b2) >= (b2 - b1) * (a3 - a2);
        }
    }
}
#endregion

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード