#892137 (C#) No.5017 Tool-assisted Shooting

提出ソース

結果

問題	No.5017 Tool-assisted Shooting
ユーザー	KumaTachiRen
提出日時	2023-07-16 15:49:19
言語	C# (.NET 8.0.203)
結果	AC
実行時間	193 ms / 2,000 ms
コード長	18,919 bytes
コンパイル時間	7,626 ms
コンパイル使用メモリ	147,612 KB
実行使用メモリ	54,492 KB
スコア	1,152,978
平均クエリ数	992.17
最終ジャッジ日時	2023-07-16 15:49:50
合計ジャッジ時間	29,483 ms
ジャッジサーバーID （参考情報）	judge15 / judge14
	純コード判定しない問題か言語

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	186 ms 52,100 KB
testcase_01	AC	170 ms 52,376 KB
testcase_02	AC	169 ms 51,848 KB
testcase_03	AC	185 ms 52,440 KB
testcase_04	AC	169 ms 52,256 KB
testcase_05	AC	170 ms 52,220 KB
testcase_06	AC	170 ms 51,948 KB
testcase_07	AC	171 ms 52,292 KB
testcase_08	AC	169 ms 52,412 KB
testcase_09	AC	169 ms 51,772 KB
testcase_10	AC	181 ms 52,608 KB
testcase_11	AC	171 ms 54,400 KB
testcase_12	AC	169 ms 52,632 KB
testcase_13	AC	169 ms 51,924 KB
testcase_14	AC	168 ms 51,744 KB
testcase_15	AC	170 ms 54,264 KB
testcase_16	AC	193 ms 52,608 KB
testcase_17	AC	170 ms 51,972 KB
testcase_18	AC	167 ms 52,104 KB
testcase_19	AC	167 ms 52,408 KB
testcase_20	AC	169 ms 52,724 KB
testcase_21	AC	170 ms 52,072 KB
testcase_22	AC	170 ms 54,424 KB
testcase_23	AC	182 ms 54,388 KB
testcase_24	AC	169 ms 52,072 KB
testcase_25	AC	170 ms 54,160 KB
testcase_26	AC	170 ms 51,716 KB
testcase_27	AC	168 ms 51,820 KB
testcase_28	AC	170 ms 53,776 KB
testcase_29	AC	169 ms 52,052 KB
testcase_30	AC	170 ms 54,492 KB
testcase_31	AC	170 ms 52,044 KB
testcase_32	AC	180 ms 51,940 KB
testcase_33	AC	100 ms 49,028 KB
testcase_34	AC	169 ms 52,152 KB
testcase_35	AC	169 ms 52,264 KB
testcase_36	AC	169 ms 51,760 KB
testcase_37	AC	170 ms 52,536 KB
testcase_38	AC	178 ms 53,840 KB
testcase_39	AC	168 ms 51,944 KB
testcase_40	AC	168 ms 51,968 KB
testcase_41	AC	170 ms 52,416 KB
testcase_42	AC	182 ms 52,616 KB
testcase_43	AC	170 ms 52,344 KB
testcase_44	AC	168 ms 52,040 KB
testcase_45	AC	181 ms 51,928 KB
testcase_46	AC	170 ms 52,524 KB
testcase_47	AC	169 ms 52,056 KB
testcase_48	AC	169 ms 51,788 KB
testcase_49	AC	169 ms 52,492 KB
testcase_50	AC	171 ms 52,036 KB
testcase_51	AC	179 ms 52,492 KB
testcase_52	AC	172 ms 51,696 KB
testcase_53	AC	172 ms 52,128 KB
testcase_54	AC	170 ms 52,660 KB
testcase_55	AC	169 ms 53,836 KB
testcase_56	AC	171 ms 53,896 KB
testcase_57	AC	169 ms 52,748 KB
testcase_58	AC	170 ms 51,848 KB
testcase_59	AC	171 ms 52,216 KB
testcase_60	AC	168 ms 51,704 KB
testcase_61	AC	181 ms 51,784 KB
testcase_62	AC	168 ms 52,196 KB
testcase_63	AC	170 ms 52,192 KB
testcase_64	AC	170 ms 52,340 KB
testcase_65	AC	169 ms 52,684 KB
testcase_66	AC	168 ms 54,192 KB
testcase_67	AC	169 ms 52,572 KB
testcase_68	AC	170 ms 53,912 KB
testcase_69	AC	170 ms 52,216 KB
testcase_70	AC	179 ms 52,036 KB
testcase_71	AC	170 ms 52,136 KB
testcase_72	AC	171 ms 51,992 KB
testcase_73	AC	171 ms 52,252 KB
testcase_74	AC	170 ms 52,320 KB
testcase_75	AC	171 ms 52,552 KB
testcase_76	AC	170 ms 52,072 KB
testcase_77	AC	170 ms 52,632 KB
testcase_78	AC	170 ms 52,244 KB
testcase_79	AC	169 ms 51,848 KB
testcase_80	AC	174 ms 52,332 KB
testcase_81	AC	168 ms 52,148 KB
testcase_82	AC	168 ms 52,652 KB
testcase_83	AC	169 ms 53,972 KB
testcase_84	AC	172 ms 51,960 KB
testcase_85	AC	168 ms 52,084 KB
testcase_86	AC	169 ms 52,400 KB
testcase_87	AC	170 ms 52,376 KB
testcase_88	AC	167 ms 52,544 KB
testcase_89	AC	180 ms 52,288 KB
testcase_90	AC	168 ms 51,972 KB
testcase_91	AC	170 ms 53,956 KB
testcase_92	AC	172 ms 52,460 KB
testcase_93	AC	170 ms 51,872 KB
testcase_94	AC	170 ms 52,632 KB
testcase_95	AC	171 ms 52,112 KB
testcase_96	AC	171 ms 52,184 KB
testcase_97	AC	171 ms 52,592 KB
testcase_98	AC	179 ms 51,892 KB
testcase_99	AC	168 ms 52,536 KB

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

コンパイルメッセージ

  Determining projects to restore...
  Restored /home/judge/data/code/main.csproj (in 118 ms).
.NET 向け Microsoft (R) Build Engine バージョン 17.0.0-preview-21470-01+cb055d28f
Copyright (C) Microsoft Corporation.All rights reserved.

  プレビュー版の .NET を使用しています。https://aka.ms/dotnet-core-preview をご覧ください
/home/judge/data/code/Main.cs(45,13): warning CS8321: ローカル関数 'Dist' は宣言されていますが、一度も使用されていません [/home/judge/data/code/main.csproj]
  main -> /home/judge/data/code/bin/Release/net6.0/main.dll
  main -> /home/judge/data/code/bin/Release/net6.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();
    }

    const int width = 25;
    const int height = 60;
    const int max_turn = 1000;

    void Solve()
    {
        var enemy = new (long health, long power, long point)[width, height];
        for (int i = 0; i < width; i++)
            for (int j = 0; j < height; j++)
                enemy[i, j] = (0, 0, 0);

        int Dist(int x, int y) => Math.Min(Math.Abs(x - y), Math.Min(Math.Abs(x - y - width), Math.Abs(x - y + width)));

        int player_pos = 12;
        long score = 0;
        long power_sum = 0;

        int target = -1;
        long target_pt = 0, target_time = 10000000;
        int target_limit = 0;
        var move_deque = new Deque<int>();

        for (int turn = 0; turn < max_turn; turn++)
        {

            long level = 1 + power_sum / 100;

            if (target != -1 && enemy[target, 0].health > 0) target = -1;
            for (int i = 0; i < width; i++)
            {
                for (int j = 0; j + 1 < height; j++)
                    enemy[i, j] = enemy[i, j + 1];
                enemy[i, height - 1] = (0, 0, 0);
            }

            {
                int n = ri;
                if (n == -1) break;

                for (int i = 0; i < n; i++)
                {
                    int h = ri, p = ri, x = ri;
                    enemy[x, height - 1] = (h, p, h);
                }
            }

            {
                {

                    var dp = new int[width, height];
                    dp[player_pos, 0] = enemy[player_pos, 1].health > level ? 1 : 2;
                    for (int k = 0; k + 1 < height; k++)
                    {
                        for (int x = 0; x < width; x++)
                        {
                            if (dp[x, k] != 2) continue;

                            for (int diff = -1; diff <= 1; diff++)
                            {
                                int y = SafeMod(x + diff, width);
                                if (enemy[y, k].health > 0) continue;
                                dp[y, k + 1] = 2;
                                if (enemy[y, k + 1].health > level) dp[y, k + 1] = 1;
                            }
                        }
                    }

                    int best = -1;
                    long best_pt = 0, best_time = 10000;
                    int best_start = 0, best_limit = 0;
                    for (int x = 0; x < width; x++)
                    {
                        var near = enemy[x, 0];
                        int limit_time = 0;
                        for (int i = 0; i < height; i++)
                            if (enemy[x, i].health > 0)
                            {
                                near = enemy[x, i];
                                limit_time = i;
                                break;
                            }

                        int start_time = 0;
                        while (start_time < height && dp[x, start_time] == 0) start_time++;
                        if (start_time >= limit_time) continue;
                        long time = start_time + Ceil(near.health, level);
                        if (time > limit_time) continue;
                        if ((best_pt * time < near.point * best_time)
                            || (best_pt * time == near.point * best_time && time < best_time)
                            || (limit_time < best_limit - 20))
                        {
                            best = x;
                            best_pt = near.point;
                            best_time = time;
                            best_start = start_time;
                            best_limit = limit_time;
                        }
                    }
                    bool update = false;
                    if (best != -1)
                    {
                        if (target == -1)
                        {
                            update = true;
                        }
                        else
                        {
                            update |= best_pt * target_time > target_pt * best_time * 3;
                            update |= target_limit - best_limit > target_time;
                        }
                    }
                    if (update)
                    {
                        target = best;
                        target_pt = best_pt;
                        target_time = best_time;
                        while (move_deque.Count > 0) move_deque.PopFront();
                        int x = best;
                        for (int time = best_start; time > 0; time--)
                        {
                            for (int d = -1; d <= 1; d++)
                            {
                                int y = SafeMod(x - d, width);
                                if (dp[y, time - 1] == 2)
                                {
                                    move_deque.PushFront(d);
                                    break;
                                }
                            }
                        }
                    }
                }

                int move = 0;
                if (target != -1)
                {
                    if (move_deque.Count > 0)
                        move = move_deque.PopFront();
                }

                {
                    int next_pos = SafeMod(player_pos + move, width);
                    if (enemy[next_pos, 0].health > 0 || enemy[next_pos, 1].health > level)
                    {
                        for (int d = -1; d <= 1; d++)
                        {
                            int y = SafeMod(player_pos + d, width);
                            if (enemy[y, 0].health == 0 && enemy[y, 1].health <= level)
                            {
                                move = d;
                                target = -1;
                                WriteError($"[!] time: {turn} pos: {player_pos} -> {y}");
                                break;
                            }
                        }
                    }
                }

                if (move == -1) WriteFlush("L");
                if (move == 0) WriteFlush("S");
                if (move == 1) WriteFlush("R");
                player_pos = SafeMod(player_pos + move, width);
            }

            if (enemy[player_pos, 0].health > 0)
            {
                WriteError($"[!] time: {turn} pos: {player_pos}");
                break;
            }

            for (int i = 0; i < height; i++)
            {
                if (enemy[player_pos, i].health > 0)
                {
                    var (h, p, pt) = enemy[player_pos, i];
                    if (h <= level)
                    {
                        power_sum += p;
                        score += pt;
                        WriteError($"time: {turn} pos: {player_pos} point: {pt} score: {score}");
                        target = -1;
                        h = 0;
                        p = 0;
                        pt = 0;
                    }
                    else
                    {
                        h -= level;
                    }
                    enemy[player_pos, i] = (h, p, pt);
                    break;
                }
            }
        }
        WriteError($"Score: {score}");
    }

    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");
}

public class Deque<T>
{
    class Node
    {
        public Node Prev, Next;
        public T Value;
        public Node(T v)
        {
            Value = v;
            Prev = null;
            Next = null;
        }
    }
    public int Count { get; private set; }
    Node Front, Back;
    public Deque() { }
    [MethodImpl(256)]
    public void PushBack(T v)
    {
        Node x = new Node(v);
        if (Count == 0)
        {
            Front = x;
            Back = x;
        }
        else
        {
            Back.Next = x;
            x.Prev = Back;
            Back = x;
        }
        Count++;
    }
    [MethodImpl(256)]
    public void PushFront(T v)
    {
        Node x = new Node(v);
        if (Count == 0)
        {
            Front = x;
            Back = x;
        }
        else
        {
            Front.Prev = x;
            x.Next = Front;
            Front = x;
        }
        Count++;
    }
    [MethodImpl(256)]
    public T PopBack()
    {
        if (Count == 0) throw new InvalidOperationException("Deque empty.");
        T v = Back.Value;
        Count--;
        if (Count == 0)
        {
            Front = null;
            Back = null;
        }
        else
        {
            Back = Back.Prev;
        }
        return v;
    }
    [MethodImpl(256)]
    public T PopFront()
    {
        if (Count == 0) throw new InvalidOperationException("Deque empty.");
        T v = Front.Value;
        Count--;
        if (Count == 0)
        {
            Front = null;
            Back = null;
        }
        else
        {
            Front = Front.Next;
        }
        return v;
    }
    [MethodImpl(256)]
    public T PeekBack()
    {
        if (Count == 0) throw new InvalidOperationException("Deque empty.");
        return Back.Value;
    }
    [MethodImpl(256)]
    public T PeekFront()
    {
        if (Count == 0) throw new InvalidOperationException("Deque empty.");
        return Front.Value;
    }
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード