結果

問題 No.777 再帰的ケーキ
ユーザー りあんりあん
提出日時 2018-12-24 01:03:25
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 1,004 ms / 2,000 ms
コード長 7,930 bytes
コンパイル時間 4,308 ms
コンパイル使用メモリ 123,236 KB
実行使用メモリ 64,788 KB
最終ジャッジ日時 2024-09-25 10:52:36
合計ジャッジ時間 11,351 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 41 ms
27,948 KB
testcase_01 AC 42 ms
28,072 KB
testcase_02 AC 41 ms
25,756 KB
testcase_03 AC 40 ms
26,032 KB
testcase_04 AC 39 ms
25,484 KB
testcase_05 AC 41 ms
25,900 KB
testcase_06 AC 41 ms
26,268 KB
testcase_07 AC 42 ms
25,780 KB
testcase_08 AC 40 ms
25,996 KB
testcase_09 AC 40 ms
23,860 KB
testcase_10 AC 41 ms
26,016 KB
testcase_11 AC 42 ms
26,012 KB
testcase_12 AC 41 ms
23,608 KB
testcase_13 AC 41 ms
26,016 KB
testcase_14 AC 41 ms
26,012 KB
testcase_15 AC 39 ms
25,504 KB
testcase_16 AC 41 ms
28,068 KB
testcase_17 AC 41 ms
28,176 KB
testcase_18 AC 42 ms
26,284 KB
testcase_19 AC 42 ms
28,072 KB
testcase_20 AC 41 ms
26,016 KB
testcase_21 AC 49 ms
25,900 KB
testcase_22 AC 49 ms
26,008 KB
testcase_23 AC 43 ms
25,884 KB
testcase_24 AC 44 ms
25,888 KB
testcase_25 AC 49 ms
26,012 KB
testcase_26 AC 49 ms
25,880 KB
testcase_27 AC 43 ms
25,776 KB
testcase_28 AC 975 ms
62,956 KB
testcase_29 AC 994 ms
60,664 KB
testcase_30 AC 1,004 ms
64,788 KB
testcase_31 AC 994 ms
62,580 KB
testcase_32 AC 684 ms
61,224 KB
testcase_33 AC 347 ms
40,788 KB
testcase_34 AC 495 ms
45,280 KB
testcase_35 AC 827 ms
59,512 KB
testcase_36 AC 823 ms
63,396 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.Linq.Expressions;
using System.IO;

using static util;
using P = pair<int, int>;

using Binary = System.Func<System.Linq.Expressions.ParameterExpression, System.Linq.Expressions.ParameterExpression,
                           System.Linq.Expressions.BinaryExpression>;
using Unary = System.Func<System.Linq.Expressions.ParameterExpression, System.Linq.Expressions.UnaryExpression>;

class Program
{
    static StreamWriter sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
    static Scan sc = new Scan();
    const int M = 1000000007;
    const int M2 = 998244353;
    const long LM = (long)1e18;
    const double eps = 1e-11;
    static readonly int[] dd = { 0, 1, 0, -1, 0 };
    const string dstring = "RDLU";
    static void Main()
    {
        int n = sc.Int;
        var a = new int[n];
        var b = new int[n];
        var c = new int[n];
        for (int i = 0; i < n; i++)
            sc.Multi(out a[i], out b[i], out c[i]);

        var dic = a.Distinct().OrderBy(x => x).Select((value, index) => new { value, index }).ToDictionary(x => x.value, x => x.index);
        a = a.Select(x => dic[x]).ToArray();
        dic = b.Distinct().OrderBy(x => x).Select((value, index) => new { value, index }).ToDictionary(x => x.value, x => x.index);
        int m = dic.Count;
        b = b.Select(x => dic[x]).ToArray();
        var p = new P[n];
        var key = new P[n];
        for (int i = 0; i < n; i++)
        {
            key[i] = new P(a[i], -b[i]);
            p[i] = new P(b[i], c[i]);
        }
        Array.Sort(key, p);
        var sg = new Segtree<long>(m, Math.Max, 0);
        foreach (var item in p)
            sg.update(item.v1, Math.Max(sg.look(item.v1), sg.run(0, item.v1) + item.v2));

        Prt(sg.run(0, m));
        sw.Flush();
    }
    static void DBG(string a) => Console.WriteLine(a);
    static void DBG<T>(IEnumerable<T> a) => DBG(string.Join(" ", a));
    static void DBG(params object[] a) => DBG(string.Join(" ", a));
    static void Prt(string a) => sw.WriteLine(a);
    static void Prt<T>(IEnumerable<T> a) => Prt(string.Join(" ", a));
    static void Prt(params object[] a) => Prt(string.Join(" ", a));
}
class pair<T, U> : IComparable<pair<T, U>>
{
    public T v1;
    public U v2;
    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 pair<T, T> make_pair<T>(this IList<T> l) => make_pair(l[0], l[1]);
    public static pair<T, U> make_pair<T, U>(T v1, U v2) => new pair<T, U>(v1, v2);
    public static T sq<T>(T a) => Operator<T>.Multiply(a, a);
    public static T Max<T>(params T[] a) => a.Max();
    public static T Min<T>(params T[] a) => a.Min();
    public static bool inside(int i, int j, int h, int w) => i >= 0 && i < h && j >= 0 && j < w;
    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;
    }
}
static class Operator<T>
{
    static readonly ParameterExpression x = Expression.Parameter(typeof(T), "x");
    static readonly ParameterExpression y = Expression.Parameter(typeof(T), "y");
    public static readonly Func<T, T, T> Add = Lambda(Expression.Add);
    public static readonly Func<T, T, T> Subtract = Lambda(Expression.Subtract);
    public static readonly Func<T, T, T> Multiply = Lambda(Expression.Multiply);
    public static readonly Func<T, T, T> Divide = Lambda(Expression.Divide);
    public static readonly Func<T, T> Plus = Lambda(Expression.UnaryPlus);
    public static readonly Func<T, T> Negate = Lambda(Expression.Negate);
    public static Func<T, T, T> Lambda(Binary op) => Expression.Lambda<Func<T, T, T>>(op(x, y), x, y).Compile();
    public static Func<T, T> Lambda(Unary op) => Expression.Lambda<Func<T, T>>(op(x), x).Compile();
}

class Scan
{
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public string Str => Console.ReadLine().Trim();
    public pair<T, U> Pair<T, U>() where T : IComparable<T> where U : IComparable<U> {
        T a; U b;
        Multi(out a, out b);
        return new pair<T, U>(a, b);
    }
    public P P {
        get {
            int a, b;
            Multi(out a, out b);
            return new P(a, b);
        }
    }
    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]); }
    public void Multi<T, U, V, W, X, Y>(out T a, out U b, out V c, out W d, out X e, out Y f)
    { 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]); f = cv<Y>(ar[5]); }
}

class Segtree<T> {
    int n, s, t;
    T[] tr;
    Func<T, T, T> f;
    T exnum;

    // expect : f(ex, ex) = ex
    public Segtree(int m, Func<T, T, T> f, T ex) {
        this.f = f; this.exnum = ex; n = 1;
        while (n < m) n <<= 1;
        tr = new T[(n << 1) - 1];
        for (int i = 0; i < tr.Length; i++) tr[i] = ex;
    }
    public Segtree(int m, T ini, Func<T, T, T> f, T ex) : this(m, f, ex) {
        for (int i = 0; i < m; ++i) assign(i, ini);
        all_update();
    }
    public Segtree(int m, IList<T> ini, Func<T, T, T> f, T ex) : this(m, f, ex) {
        for (int i = 0; i < m; ++i) assign(i, ini[i]);
        all_update();
    }
    public void assign(int j, T x) => tr[j + n - 1] = x;
    public void update(int j, T x) {
        assign(j, x);
        update(j);
    }
    public void update(int j) {
        int i = j + n - 1;
        while (i > 0) { i = i - 1 >> 1; tr[i] = f(tr[i << 1 | 1], tr[i + 1 << 1]); }
    }
    public void all_update() { for (int i = n - 2; i >= 0; i--) tr[i] = f(tr[i << 1 | 1], tr[i + 1 << 1]); }
    public T look(int i) => tr[i + n - 1];

    // [s, t)
    public T run(int s, int t) { this.s = s; this.t = t; return q(0, 0, n); }
    T q(int k, int l, int r) => r <= s || t <= l ? exnum : s <= l && r <= t ? tr[k]
                              : f(q(k << 1 | 1, l, l + r >> 1), q(k + 1 << 1, l + r >> 1, r));
}
0