#898203 (C#) No.2404 Vertical Throw Up

提出ソース

結果

問題	No.2404 Vertical Throw Up
ユーザー	KumaTachiRen
提出日時	2023-08-04 21:41:21
言語	C# (.NET 8.0.203)
結果	AC
実行時間	96 ms / 2,000 ms
コード長	13,768 bytes
コンパイル時間	10,131 ms
コンパイル使用メモリ	168,296 KB
実行使用メモリ	189,932 KB
最終ジャッジ日時	2024-10-14 19:39:45
合計ジャッジ時間	13,504 ms
ジャッジサーバーID （参考情報）	judge2 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	51 ms 28,032 KB
testcase_01	AC	46 ms 24,064 KB
testcase_02	AC	51 ms 28,020 KB
testcase_03	AC	88 ms 36,608 KB
testcase_04	AC	82 ms 34,176 KB
testcase_05	AC	96 ms 37,632 KB
testcase_06	AC	52 ms 28,032 KB
testcase_07	AC	96 ms 37,632 KB
testcase_08	AC	87 ms 34,688 KB
testcase_09	AC	82 ms 34,176 KB
testcase_10	AC	67 ms 31,476 KB
testcase_11	AC	67 ms 31,616 KB
testcase_12	AC	58 ms 28,916 KB
testcase_13	AC	52 ms 27,904 KB
testcase_14	AC	52 ms 28,032 KB
testcase_15	AC	52 ms 28,160 KB
testcase_16	AC	52 ms 28,288 KB
testcase_17	AC	53 ms 28,032 KB
testcase_18	AC	52 ms 28,160 KB
testcase_19	AC	52 ms 28,032 KB
testcase_20	AC	53 ms 28,020 KB
testcase_21	AC	53 ms 28,160 KB
testcase_22	AC	51 ms 28,160 KB
testcase_23	AC	52 ms 28,032 KB
testcase_24	AC	52 ms 27,904 KB
testcase_25	AC	52 ms 28,160 KB
testcase_26	AC	52 ms 28,160 KB
testcase_27	AC	52 ms 28,160 KB
testcase_28	AC	52 ms 28,032 KB
testcase_29	AC	52 ms 28,032 KB
testcase_30	AC	51 ms 28,160 KB
testcase_31	AC	51 ms 28,032 KB
testcase_32	AC	53 ms 189,932 KB

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

コンパイルメッセージ

  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (98 ms)。
MSBuild のバージョン 17.9.6+a4ecab324 (.NET)
  main -> /home/judge/data/code/bin/Release/net8.0/main.dll
  main -> /home/judge/data/code/bin/Release/net8.0/publish/

ソースコード

raw source code

using System;
using System.ComponentModel;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.Diagnostics.Contracts;
using System.IO;
using System.Linq;
using System.Numerics;
using System.Runtime.Intrinsics.X86;
using System.Runtime.CompilerServices;
using System.Runtime.InteropServices;
using System.Text;
using static Functions;
using static OutputLib;

static class Program
{
    static public void Main(string[] args)
    {
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver();
        Console.Out.Flush();
    }
}

public class Solver
{
    public Solver()
    {
        Solve();
    }

    void Solve()
    {
        long a = rl;
        int q = ri;
        var ans = new List<long>();

        var lct = new DynamicLiChaoTreeLong(0, 100000000);

        while (q-- > 0)
        {
            if (ri == 1)
            {
                long s = rl, t = rl;
                lct.AddSegment(s, t, -(s + t), s * t);
            }
            else
            {
                long t = rl;
                long v = lct.Query(t);
                if (v >= 1L << 50) v = 0;
                else v = -a * t * t - a * v;
                ans.Add(v);
            }
        }
        WriteJoin("\n", ans);
    }

    const long INF = 1L << 60;
    int ri { [MethodImpl(256)] get => (int)sc.Integer(); }
    long rl { [MethodImpl(256)] get => sc.Integer(); }
    uint rui { [MethodImpl(256)] get => (uint)sc.UInteger(); }
    ulong rul { [MethodImpl(256)] get => sc.UInteger(); }
    double rd { [MethodImpl(256)] get => sc.Double(); }
    string rs { [MethodImpl(256)] get => sc.Scan(); }
    string rline { [MethodImpl(256)] get => sc.Line(); }
    public StreamScanner sc = new StreamScanner(Console.OpenStandardInput());
}

public static class Functions
{
    [MethodImpl(256)]
    public static int Popcount(ulong x)
    {
        x = (x & 0x5555555555555555UL) + ((x >> 1) & 0x5555555555555555UL);
        x = (x & 0x3333333333333333UL) + ((x >> 2) & 0x3333333333333333UL);
        x = (x & 0x0f0f0f0f0f0f0f0fUL) + ((x >> 4) & 0x0f0f0f0f0f0f0f0fUL);
        x = (x & 0x00ff00ff00ff00ffUL) + ((x >> 8) & 0x00ff00ff00ff00ffUL);
        x = (x & 0x0000ffff0000ffffUL) + ((x >> 16) & 0x0000ffff0000ffffUL);
        x = (x & 0x00000000ffffffffUL) + ((x >> 32) & 0x00000000ffffffffUL);
        return (int)x;
    }
    [MethodImpl(256)]
    public static int Popcount(int x)
    {
        x = (x & 0x55555555) + ((x >> 1) & 0x55555555);
        x = (x & 0x33333333) + ((x >> 2) & 0x33333333);
        x = (x & 0x0f0f0f0f) + ((x >> 4) & 0x0f0f0f0f);
        x = (x & 0x00ff00ff) + ((x >> 8) & 0x00ff00ff);
        x = (x & 0x0000ffff) + ((x >> 16) & 0x0000ffff);
        return x;
    }
    [MethodImpl(256)]
    public static int Ctz(long x)
    {
        if (x == 0) return -1;
        return Popcount((ulong)((x & -x) - 1));
    }
    [MethodImpl(256)]
    public static int CeilPow2(int n)
    {
        int x = 0;
        while ((1 << x) < n) x++;
        return x;
    }
    [MethodImpl(256)]
    public static int SafeMod(int x, int m)
    {
        int r = x % m;
        return r < 0 ? r + Math.Abs(m) : r;
    }
    [MethodImpl(256)]
    public static long SafeMod(long x, long m)
    {
        long r = x % m;
        return r < 0 ? r + Math.Abs(m) : r;
    }
    [MethodImpl(256)] public static int Sign(long x) => x == 0 ? 0 : (x < 0 ? -1 : 1);
    [MethodImpl(256)] public static int Sign(double x) => x == 0 ? 0 : (x < 0 ? -1 : 1);
    [MethodImpl(256)] public static int DigitSum(long n, int d = 10) { long s = 0; while (n > 0) { s += n % d; n /= d; } return (int)s; }
    [MethodImpl(256)] public static long Floor(long a, long b) => a >= 0 ? a / b : (a + 1) / b - 1;
    [MethodImpl(256)] public static long Ceil(long a, long b) => a > 0 ? (a - 1) / b + 1 : a / b;
    [MethodImpl(256)] public static int Gcd(int a, int b) => b == 0 ? a : Gcd(b, a % b);
    [MethodImpl(256)] public static long Gcd(long a, long b) => b == 0 ? a : Gcd(b, a % b);
    [MethodImpl(256)] public static void Swap(ref int x, ref int y) { x ^= y; y ^= x; x ^= y; }
    [MethodImpl(256)] public static void Swap(ref long x, ref long y) { x ^= y; y ^= x; x ^= y; }
    [MethodImpl(256)] public static void Swap<T>(ref T x, ref T y) { T t = y; y = x; x = t; }
    [MethodImpl(256)] public static T Clamp<T>(T x, T l, T r) where T : IComparable<T> => x.CompareTo(l) <= 0 ? l : (x.CompareTo(r) <= 0 ? x : r);
    [MethodImpl(256)] public static T Clamp<T>(ref T x, T l, T r) where T : IComparable<T> => x = x.CompareTo(l) <= 0 ? l : (x.CompareTo(r) <= 0 ? x : r);
    [MethodImpl(256)] public static void Chmin<T>(ref T x, T y) where T : IComparable<T> { if (x.CompareTo(y) > 0) x = y; }
    [MethodImpl(256)] public static void Chmax<T>(ref T x, T y) where T : IComparable<T> { if (x.CompareTo(y) < 0) x = y; }
    public static int LowerBound(long[] arr, long val, int l = -1, int r = -1) => LowerBound<long>(arr.AsSpan(), t => Sign(t - val), l, r);
    public static int LowerBound(int[] arr, int val, int l = -1, int r = -1) => LowerBound<int>(arr.AsSpan(), t => t - val, l, r);
    public static int LowerBound<T>(T[] arr, Func<T, int> comp, int l = -1, int r = -1) => LowerBound<T>(arr.AsSpan<T>(), comp, l, r);
    public static int LowerBound<T>(Span<T> data, Func<T, int> comp, int l = -1, int r = -1)
    {
        if (data.Length == 0) return -1;
        if (l == -1) l = 0;
        if (r == -1) r = data.Length;
        while (l < r)
        {
            int x = (l + r) / 2;
            if (comp(data[x]) < 0) l = x + 1;
            else r = x;
        }
        return l;
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static string ToBase2(long v, int digit = -1)
    {
        if (digit == -1)
        {
            digit = 0;
            while ((v >> digit) > 0) digit++;
        }
        var c = new string[digit];
        for (int i = 0; i < digit; i++) c[digit - 1 - i] = ((v >> i) & 1) == 0 ? "0" : "1";
        return string.Join("", c);
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static string ToBaseN(long v, int n, int digit = -1)
    {
        if (digit == -1)
        {
            digit = 0;
            long pow = 1;
            while (v >= pow) { digit++; pow *= n; }
        }
        var c = new int[digit];
        for (int i = 0; i < digit; i++, v /= n) c[digit - 1 - i] = (int)(v % n);
        return string.Join("", c);
    }
}

public class StreamScanner
{
    public StreamScanner(Stream stream) { str = stream; }
    private readonly Stream str;
    private readonly byte[] buf = new byte[1024];
    private int len, ptr;
    public bool isEof = false;
    public bool IsEndOfStream { get { return isEof; } }
    [MethodImpl(256)]
    private byte read()
    {
        if (isEof) throw new EndOfStreamException();
        if (ptr >= len)
        {
            ptr = 0;
            if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; }
        }
        return buf[ptr++];
    }
    [MethodImpl(256)]
    public char Char()
    {
        byte b = 0;
        do b = read();
        while (b < 33 || 126 < b);
        return (char)b;
    }
    [MethodImpl(256)]
    public string Line()
    {
        var sb = new StringBuilder();
        for (var b = Char(); b != 10 && !isEof; b = (char)read()) sb.Append(b);
        return sb.ToString();
    }
    [MethodImpl(256)]
    public string Scan()
    {
        var sb = new StringBuilder();
        for (var b = Char(); b >= 33 && b <= 126; b = (char)read()) sb.Append(b);
        return sb.ToString();
    }
    [MethodImpl(256)]
    public long Integer()
    {
        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';
        }
    }
    [MethodImpl(256)]
    public ulong UInteger()
    {
        ulong ret = 0; byte b = 0;
        do b = read();
        while (b < '0' || '9' < b);
        for (; true; b = read())
        {
            if (b < '0' || '9' < b) return ret;
            else ret = ret * 10 + b - '0';
        }
    }
    [MethodImpl(256)]
    public double Double() => double.Parse(Scan());
}

public static class OutputLib
{
    [MethodImpl(256)] public static void WriteJoin<T>(string s, IEnumerable<T> t) => Console.WriteLine(string.Join(s, t));
    [MethodImpl(256)]
    public static void WriteMat<T>(T[,] a)
    {
        int sz1 = a.GetLength(0);
        int sz2 = a.GetLength(1);
        for (int i = 0; i < sz1; i++)
        {
            var b = new T[sz2];
            for (int j = 0; j < sz2; j++) b[j] = a[i, j];
            WriteJoin(" ", b);
        }
    }
    [MethodImpl(256)] public static void WriteMat<T>(T[][] a) { for (int i = 0; i < a.Length; i++) WriteJoin(" ", a[i]); }
    [MethodImpl(256)] public static void Write(object t) => Console.WriteLine(t.ToString());
    [MethodImpl(256)] public static void Write(string str) => Console.WriteLine(str);
    [MethodImpl(256)] public static void Write(string str, object arg1) => Console.WriteLine(str, arg1);
    [MethodImpl(256)] public static void Write(string str, object arg1, object arg2) => Console.WriteLine(str, arg1, arg2);
    [MethodImpl(256)] public static void Write(string str, object arg1, object arg2, object arg3) => Console.WriteLine(str, arg1, arg2, arg3);
    [MethodImpl(256)] public static void Write(string str, params object[] arg) => Console.WriteLine(str, arg);
    [MethodImpl(256)] public static void WriteFlush(object t) { Console.WriteLine(t.ToString()); Console.Out.Flush(); }
    [MethodImpl(256)] public static void WriteError(object t) => Console.Error.WriteLine(t.ToString());
    [MethodImpl(256)] public static void Flush() => Console.Out.Flush();
    [MethodImpl(256)] public static void YN(bool t) => Console.WriteLine(t ? "YES" : "NO");
    [MethodImpl(256)] public static void Yn(bool t) => Console.WriteLine(t ? "Yes" : "No");
    [MethodImpl(256)] public static void yn(bool t) => Console.WriteLine(t ? "yes" : "no");
}

class DynamicLiChaoTreeLong
{
    struct Line
    {
        public long a { get; private set; }
        public long b { get; private set; }
        public Line(long _a, long _b)
        {
            a = _a;
            b = _b;
        }
        public Line(Line l)
        {
            a = l.a;
            b = l.b;
        }
    }
    class Node
    {
        public Line Line;
        public Node Left;
        public Node Right;
        public Node(Line line, Node left = null, Node right = null)
        {
            Line = line;
            Left = left;
            Right = right;
        }
    }
    const long INF = 1L << 60;
    readonly long x_low, x_high;
    Node root = null;
    public DynamicLiChaoTreeLong(long _x_low, long _x_high)
    {
        x_low = _x_low;
        x_high = _x_high;
    }
    [MethodImpl(256)]
    long Eval(Line l, long v) => l.a * v + l.b;
    [MethodImpl(256)]
    public void AddLine(long a, long b)
    {
        var x = new Line(a, b);
        root = AddLine(root, x, x_low, x_high, Eval(x, x_low), Eval(x, x_high));
    }
    [MethodImpl(256)]
    Node AddLine(Node e, Line x, long l, long r, long x_l, long x_r)
    {
        if (e == null) return new Node(x);
        long t_l = Eval(e.Line, l), t_r = Eval(e.Line, r);
        if (t_l <= x_l && t_r <= x_r) return e;
        else if (t_l >= x_l && t_r >= x_r)
        {
            e.Line = x;
            return e;
        }
        else
        {
            long m = (l + r) / 2;
            if (m == r) m--;
            long t_m = Eval(e.Line, m), x_m = Eval(x, m);
            if (t_m > x_m)
            {
                var tmp = e.Line;
                e.Line = x;
                x = tmp;
                if (x_l >= t_l) e.Left = AddLine(e.Left, x, l, m, t_l, t_m);
                else e.Right = AddLine(e.Right, x, m + 1, r, t_m + x.a, t_r);
            }
            else
            {
                if (t_l >= x_l) e.Left = AddLine(e.Left, x, l, m, x_l, x_m);
                else e.Right = AddLine(e.Right, x, m + 1, r, x_m + x.a, x_r);
            }
            return e;
        }
    }
    [MethodImpl(256)]
    public void AddSegment(long l, long r, long a, long b)
    {
        var x = new Line(a, b);
        root = AddSegment(root, x, l, r - 1, x_low, x_high, Eval(x, x_low), Eval(x, x_high));
    }
    [MethodImpl(256)]
    Node AddSegment(Node e, Line x, long a, long b, long l, long r, long x_l, long x_r)
    {
        if (r < a || b < l) return e;
        if (a <= l && r <= b) return AddLine(e, new Line(x), l, r, x_l, x_r);
        if (e != null)
        {
            long t_l = Eval(e.Line, l), t_r = Eval(e.Line, r);
            if (t_l <= x_l && t_r <= x_r) return e;
        }
        else
        {
            e = new Node(new Line(default(long), INF));
        }
        long m = (l + r) / 2;
        if (m == r) m--;
        long x_m = Eval(x, m);
        e.Left = AddSegment(e.Left, x, a, b, l, m, x_l, x_m);
        e.Right = AddSegment(e.Right, x, a, b, m + 1, r, x_m + x.a, x_r);
        return e;
    }
    [MethodImpl(256)]
    public long Query(long x) => Query(root, x_low, x_high, x);
    [MethodImpl(256)]
    long Query(Node e, long l, long r, long x)
    {
        if (e == null) return INF;
        if (l == r) return Eval(e.Line, x);
        long m = (l + r) / 2;
        if (m == r) m--;
        if (x <= m) return Math.Min(Eval(e.Line, x), Query(e.Left, l, m, x));
        else return Math.Min(Eval(e.Line, x), Query(e.Right, m + 1, r, x));
    }
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード